/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:09:37,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:09:37,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:09:37,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:09:37,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:09:37,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:09:37,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:09:37,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:09:37,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:09:37,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:09:37,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:09:37,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:09:37,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:09:37,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:09:37,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:09:37,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:09:37,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:09:37,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:09:37,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:09:37,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:09:37,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:09:37,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:09:37,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:09:37,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:09:37,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:09:37,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:09:37,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:09:37,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:09:37,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:09:37,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:09:37,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:09:37,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:09:37,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:09:37,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:09:37,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:09:37,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:09:37,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:09:37,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:09:37,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:09:37,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:09:37,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:09:37,366 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:09:37,381 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:09:37,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:09:37,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:09:37,382 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:09:37,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:09:37,383 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:37,383 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:09:37,383 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:09:37,383 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:09:37,384 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:09:37,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:09:37,385 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:09:37,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:09:37,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:09:37,385 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:09:37,386 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:09:37,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:09:37,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:09:37,386 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:09:37,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:37,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:09:37,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:09:37,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:09:37,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:09:37,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:09:37,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:09:37,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:09:37,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:09:37,574 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:09:37,574 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:09:37,638 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_X2EwEX/tmp/9ddc0d54e9824f2c8e663507f6f2f290/FLAG71bd16a36 [2020-07-01 13:09:37,970 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:09:37,971 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:09:37,971 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:09:37,978 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_X2EwEX/tmp/9ddc0d54e9824f2c8e663507f6f2f290/FLAG71bd16a36 [2020-07-01 13:09:38,394 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_X2EwEX/tmp/9ddc0d54e9824f2c8e663507f6f2f290 [2020-07-01 13:09:38,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:09:38,406 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:09:38,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:38,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:09:38,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:09:38,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed630b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38, skipping insertion in model container [2020-07-01 13:09:38,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:09:38,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:09:38,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:38,672 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:09:38,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:38,704 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:09:38,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38 WrapperNode [2020-07-01 13:09:38,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:38,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:38,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:09:38,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:09:38,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:38,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:09:38,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:09:38,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:09:38,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... [2020-07-01 13:09:38,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:09:38,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:09:38,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:09:38,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:09:38,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:09:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:09:38,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:09:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:09:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:09:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:09:39,153 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:09:39,153 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:09:39,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:39 BoogieIcfgContainer [2020-07-01 13:09:39,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:09:39,160 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:09:39,160 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:09:39,162 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:09:39,163 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:39" (1/1) ... [2020-07-01 13:09:39,179 INFO L313 BlockEncoder]: Initial Icfg 61 locations, 64 edges [2020-07-01 13:09:39,180 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:09:39,181 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:09:39,182 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:09:39,182 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:39,184 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:09:39,185 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:09:39,185 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:09:39,213 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:09:39,250 INFO L200 BlockEncoder]: SBE split 33 edges [2020-07-01 13:09:39,255 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:09:39,257 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:39,295 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:09:39,298 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:09:39,299 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:09:39,300 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:39,300 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:09:39,301 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:09:39,301 INFO L313 BlockEncoder]: Encoded RCFG 52 locations, 92 edges [2020-07-01 13:09:39,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:39 BasicIcfg [2020-07-01 13:09:39,302 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:09:39,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:09:39,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:09:39,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:09:39,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:09:38" (1/4) ... [2020-07-01 13:09:39,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ace4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:39, skipping insertion in model container [2020-07-01 13:09:39,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (2/4) ... [2020-07-01 13:09:39,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ace4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:39, skipping insertion in model container [2020-07-01 13:09:39,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:39" (3/4) ... [2020-07-01 13:09:39,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ace4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:39, skipping insertion in model container [2020-07-01 13:09:39,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:39" (4/4) ... [2020-07-01 13:09:39,311 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:39,321 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:09:39,329 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2020-07-01 13:09:39,343 INFO L251 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2020-07-01 13:09:39,367 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:09:39,367 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:09:39,367 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:39,367 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:39,367 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:39,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:09:39,368 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:39,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:09:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-01 13:09:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:39,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:39,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:39,391 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 140436, now seen corresponding path program 1 times [2020-07-01 13:09:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:39,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3846397] [2020-07-01 13:09:39,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:39,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3846397] [2020-07-01 13:09:39,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:39,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:39,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647530407] [2020-07-01 13:09:39,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:39,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:39,588 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-01 13:09:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:39,748 INFO L93 Difference]: Finished difference Result 102 states and 175 transitions. [2020-07-01 13:09:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:39,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:39,763 INFO L225 Difference]: With dead ends: 102 [2020-07-01 13:09:39,763 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 13:09:39,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 13:09:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-01 13:09:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 13:09:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2020-07-01 13:09:39,807 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 3 [2020-07-01 13:09:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:39,808 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2020-07-01 13:09:39,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2020-07-01 13:09:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:39,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:39,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:39,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:09:39,811 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 140498, now seen corresponding path program 1 times [2020-07-01 13:09:39,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:39,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698524645] [2020-07-01 13:09:39,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:39,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698524645] [2020-07-01 13:09:39,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:39,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685101007] [2020-07-01 13:09:39,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:39,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:39,873 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand 3 states. [2020-07-01 13:09:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,023 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2020-07-01 13:09:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,026 INFO L225 Difference]: With dead ends: 52 [2020-07-01 13:09:40,026 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:09:40,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:09:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:09:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:09:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 71 transitions. [2020-07-01 13:09:40,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 71 transitions. Word has length 3 [2020-07-01 13:09:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,033 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 71 transitions. [2020-07-01 13:09:40,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 71 transitions. [2020-07-01 13:09:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:40,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:40,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:09:40,034 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 140500, now seen corresponding path program 1 times [2020-07-01 13:09:40,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740573905] [2020-07-01 13:09:40,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740573905] [2020-07-01 13:09:40,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349330920] [2020-07-01 13:09:40,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,063 INFO L87 Difference]: Start difference. First operand 45 states and 71 transitions. Second operand 3 states. [2020-07-01 13:09:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,143 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2020-07-01 13:09:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,145 INFO L225 Difference]: With dead ends: 52 [2020-07-01 13:09:40,145 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:09:40,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:09:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:09:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:09:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2020-07-01 13:09:40,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 3 [2020-07-01 13:09:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,151 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2020-07-01 13:09:40,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2020-07-01 13:09:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:40,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:40,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:09:40,164 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 140501, now seen corresponding path program 1 times [2020-07-01 13:09:40,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567337359] [2020-07-01 13:09:40,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567337359] [2020-07-01 13:09:40,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542634220] [2020-07-01 13:09:40,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,206 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2020-07-01 13:09:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,308 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2020-07-01 13:09:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,310 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:09:40,310 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:09:40,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:09:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 13:09:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 13:09:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2020-07-01 13:09:40,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 57 transitions. Word has length 3 [2020-07-01 13:09:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,315 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 57 transitions. [2020-07-01 13:09:40,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2020-07-01 13:09:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:40,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:40,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:09:40,316 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 4352565, now seen corresponding path program 1 times [2020-07-01 13:09:40,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111452050] [2020-07-01 13:09:40,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111452050] [2020-07-01 13:09:40,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314596386] [2020-07-01 13:09:40,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,354 INFO L87 Difference]: Start difference. First operand 38 states and 57 transitions. Second operand 3 states. [2020-07-01 13:09:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,444 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2020-07-01 13:09:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,445 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:09:40,446 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:09:40,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:09:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:09:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:09:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2020-07-01 13:09:40,450 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 4 [2020-07-01 13:09:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,450 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2020-07-01 13:09:40,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2020-07-01 13:09:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:40,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:40,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:09:40,452 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash 4352567, now seen corresponding path program 1 times [2020-07-01 13:09:40,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060320943] [2020-07-01 13:09:40,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060320943] [2020-07-01 13:09:40,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307272873] [2020-07-01 13:09:40,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,494 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2020-07-01 13:09:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,564 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-01 13:09:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,565 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:09:40,565 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:09:40,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:09:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:09:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:09:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-07-01 13:09:40,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 4 [2020-07-01 13:09:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,570 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-07-01 13:09:40,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2020-07-01 13:09:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:09:40,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:09:40,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:09:40,571 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 134927886, now seen corresponding path program 1 times [2020-07-01 13:09:40,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735146997] [2020-07-01 13:09:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735146997] [2020-07-01 13:09:40,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319422785] [2020-07-01 13:09:40,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,606 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 3 states. [2020-07-01 13:09:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,654 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-07-01 13:09:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:09:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,655 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:09:40,655 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:09:40,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:09:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:09:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:09:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-01 13:09:40,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 5 [2020-07-01 13:09:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,659 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-01 13:09:40,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-01 13:09:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:09:40,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:40,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:09:40,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:09:40,660 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 134927888, now seen corresponding path program 1 times [2020-07-01 13:09:40,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416842797] [2020-07-01 13:09:40,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416842797] [2020-07-01 13:09:40,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858269927] [2020-07-01 13:09:40,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:40,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,702 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2020-07-01 13:09:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:40,749 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-01 13:09:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:40,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:09:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:40,750 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:09:40,750 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:09:40,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:09:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:09:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:09:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:09:40,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:09:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:40,752 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:40,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:09:40,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:09:40,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:09:40,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:09:40,822 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:40,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,824 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:09:40,824 INFO L268 CegarLoopResult]: For program point L16-1(lines 16 19) no Hoare annotation was computed. [2020-07-01 13:09:40,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,824 INFO L264 CegarLoopResult]: At program point L16-3(lines 15 19) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point L16-4(lines 16 19) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,825 INFO L268 CegarLoopResult]: For program point L13(lines 13 21) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L264 CegarLoopResult]: At program point L13-2(lines 12 21) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point L13-3(lines 13 21) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:09:40,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:09:40,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:09:40,831 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:09:40,841 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:40,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:40,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:40,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:40 BasicIcfg [2020-07-01 13:09:40,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:09:40,855 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:09:40,855 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:09:40,858 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:09:40,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:40,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:09:38" (1/5) ... [2020-07-01 13:09:40,859 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@125f0332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:40, skipping insertion in model container [2020-07-01 13:09:40,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:40,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:38" (2/5) ... [2020-07-01 13:09:40,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@125f0332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:40, skipping insertion in model container [2020-07-01 13:09:40,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:40,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:39" (3/5) ... [2020-07-01 13:09:40,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@125f0332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:40, skipping insertion in model container [2020-07-01 13:09:40,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:40,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:39" (4/5) ... [2020-07-01 13:09:40,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@125f0332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:40, skipping insertion in model container [2020-07-01 13:09:40,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:40,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:40" (5/5) ... [2020-07-01 13:09:40,862 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:40,883 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:09:40,883 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:09:40,883 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:40,883 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:40,883 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:40,884 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:09:40,884 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:40,884 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:09:40,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-07-01 13:09:40,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 13:09:40,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:40,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:40,899 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:09:40,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:09:40,900 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:09:40,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-07-01 13:09:40,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 13:09:40,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:40,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:40,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:09:40,903 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:09:40,909 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [109] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [191] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [93] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 48#L10-1true [137] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 24#L11true [110] L11-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 52#L13-2true [2020-07-01 13:09:40,910 INFO L796 eck$LassoCheckResult]: Loop: 52#L13-2true [144] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 53#L13true [148] L13-->L14: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 17#L14true [101] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_13|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_13|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 15#L14-1true [257] L14-1-->L15: Formula: (and (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_24 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_24) v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem4_6| 1))) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_17)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, #memory_int] 19#L15true [104] L15-->L16-3: Formula: (and (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1)) |v_#memory_int_11|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_19|} OutVars{#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 41#L16-3true [127] L16-3-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 29#L16true [116] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 28#L16-1true [175] L16-1-->L16-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 40#L16-4true [123] L16-4-->L20: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (= 1 (select |v_#valid_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #valid=|v_#valid_33|} OutVars{#valid=|v_#valid_33|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_31|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 35#L20true [262] L20-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_18 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_25)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_18) (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~x_ref~0.base_25 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~x_ref~0.base_25) v_ULTIMATE.start_test_fun_~x_ref~0.offset_18 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 2)))) |v_#memory_int_33|) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_25))) InVars {#valid=|v_#valid_53|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_18, #length=|v_#length_43|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_25, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_53|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_18, #length=|v_#length_43|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_25, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 52#L13-2true [2020-07-01 13:09:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 135076751, now seen corresponding path program 1 times [2020-07-01 13:09:40,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685517000] [2020-07-01 13:09:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:40,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685517000] [2020-07-01 13:09:40,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:40,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:40,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39835850] [2020-07-01 13:09:40,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:09:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2056669570, now seen corresponding path program 1 times [2020-07-01 13:09:40,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:40,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088478070] [2020-07-01 13:09:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:40,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:09:41,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:41,114 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-01 13:09:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:41,223 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2020-07-01 13:09:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:41,226 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:09:41,230 INFO L168 Benchmark]: Toolchain (without parser) took 2823.02 ms. Allocated memory was 514.9 MB in the beginning and 587.7 MB in the end (delta: 72.9 MB). Free memory was 438.0 MB in the beginning and 407.0 MB in the end (delta: 31.0 MB). Peak memory consumption was 103.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,230 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:09:41,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 438.0 MB in the beginning and 526.7 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.14 ms. Allocated memory is still 560.5 MB. Free memory was 526.7 MB in the beginning and 524.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,232 INFO L168 Benchmark]: Boogie Preprocessor took 23.71 ms. Allocated memory is still 560.5 MB. Free memory was 524.4 MB in the beginning and 523.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,233 INFO L168 Benchmark]: RCFGBuilder took 390.61 ms. Allocated memory is still 560.5 MB. Free memory was 522.8 MB in the beginning and 496.9 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,233 INFO L168 Benchmark]: BlockEncodingV2 took 141.64 ms. Allocated memory is still 560.5 MB. Free memory was 496.4 MB in the beginning and 483.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,234 INFO L168 Benchmark]: TraceAbstraction took 1551.25 ms. Allocated memory was 560.5 MB in the beginning and 587.7 MB in the end (delta: 27.3 MB). Free memory was 483.4 MB in the beginning and 451.8 MB in the end (delta: 31.6 MB). Peak memory consumption was 58.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,235 INFO L168 Benchmark]: BuchiAutomizer took 373.03 ms. Allocated memory is still 587.7 MB. Free memory was 451.8 MB in the beginning and 407.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:41,238 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 61 locations, 64 edges - StatisticsResult: Encoded RCFG 52 locations, 92 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 438.0 MB in the beginning and 526.7 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.14 ms. Allocated memory is still 560.5 MB. Free memory was 526.7 MB in the beginning and 524.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.71 ms. Allocated memory is still 560.5 MB. Free memory was 524.4 MB in the beginning and 523.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 390.61 ms. Allocated memory is still 560.5 MB. Free memory was 522.8 MB in the beginning and 496.9 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.64 ms. Allocated memory is still 560.5 MB. Free memory was 496.4 MB in the beginning and 483.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1551.25 ms. Allocated memory was 560.5 MB in the beginning and 587.7 MB in the end (delta: 27.3 MB). Free memory was 483.4 MB in the beginning and 451.8 MB in the end (delta: 31.6 MB). Peak memory consumption was 58.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 373.03 ms. Allocated memory is still 587.7 MB. Free memory was 451.8 MB in the beginning and 407.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:09:41,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:41,249 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:41,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 13:09:41,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:41,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:41,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:41,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 390 SDslu, 4 SDs, 0 SdLazy, 367 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:09:35.144 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_X2EwEX/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:09:41.480 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check