./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a93221bc263791497331acd2a7a0150037c621aa ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:54:06,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:54:06,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:54:06,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:54:06,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:54:06,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:54:06,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:54:06,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:54:06,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:54:06,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:54:06,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:54:06,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:54:06,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:54:06,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:54:06,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:54:06,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:54:06,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:54:06,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:54:06,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:54:06,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:54:06,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:54:06,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:54:06,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:54:06,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:54:06,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:54:06,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:54:06,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:54:06,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:54:06,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:54:06,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:54:06,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:54:06,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:54:06,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:54:06,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:54:06,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:54:06,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:54:06,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:54:06,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:54:06,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:54:06,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:54:06,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:54:06,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 18:54:06,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:54:06,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:54:06,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:54:06,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:54:06,424 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:54:06,425 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:54:06,425 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:54:06,425 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:54:06,425 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:54:06,426 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:54:06,426 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:54:06,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:54:06,427 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 18:54:06,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:54:06,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:54:06,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 18:54:06,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:54:06,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:54:06,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:54:06,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:54:06,431 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 18:54:06,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:54:06,431 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:54:06,433 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:54:06,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:54:06,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:54:06,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:54:06,434 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:54:06,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:54:06,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:54:06,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:54:06,435 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:54:06,437 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:54:06,437 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a93221bc263791497331acd2a7a0150037c621aa [2020-10-19 18:54:06,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:54:06,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:54:06,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:54:06,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:54:06,769 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:54:06,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2020-10-19 18:54:06,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a7c717f/b71ee79175b54f659477d0db484d6bc3/FLAG15dad4c5a [2020-10-19 18:54:07,301 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:54:07,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2020-10-19 18:54:07,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a7c717f/b71ee79175b54f659477d0db484d6bc3/FLAG15dad4c5a [2020-10-19 18:54:07,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a7c717f/b71ee79175b54f659477d0db484d6bc3 [2020-10-19 18:54:07,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:54:07,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:54:07,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:07,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:54:07,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:54:07,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:07,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf65361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07, skipping insertion in model container [2020-10-19 18:54:07,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:07,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:54:07,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:54:07,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:07,937 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:54:07,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:54:07,978 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:54:07,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07 WrapperNode [2020-10-19 18:54:07,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:54:07,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:07,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:54:07,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:54:07,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:54:08,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:54:08,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:54:08,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:54:08,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... [2020-10-19 18:54:08,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:54:08,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:54:08,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:54:08,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:54:08,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:54:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:54:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:54:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 18:54:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:54:08,513 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:54:08,514 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-19 18:54:08,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:08 BoogieIcfgContainer [2020-10-19 18:54:08,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:54:08,516 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:54:08,517 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:54:08,519 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:54:08,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:08,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:54:07" (1/3) ... [2020-10-19 18:54:08,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b4e479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:08, skipping insertion in model container [2020-10-19 18:54:08,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:08,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:54:07" (2/3) ... [2020-10-19 18:54:08,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b4e479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:54:08, skipping insertion in model container [2020-10-19 18:54:08,522 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:54:08,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:08" (3/3) ... [2020-10-19 18:54:08,524 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2020-10-19 18:54:08,568 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:54:08,569 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:54:08,569 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:54:08,569 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:54:08,569 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:54:08,569 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:54:08,569 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:54:08,570 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:54:08,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-10-19 18:54:08,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-19 18:54:08,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:08,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:08,617 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:08,618 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:08,618 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:54:08,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-10-19 18:54:08,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-19 18:54:08,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:08,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:08,624 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:08,624 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:08,630 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 31#L169-1true [2020-10-19 18:54:08,631 INFO L796 eck$LassoCheckResult]: Loop: 31#L169-1true assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 43#L46true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12#L73true assume 0 != main_~p1~0;main_~lk1~0 := 1; 9#L73-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 41#L77-1true assume !(0 != main_~p3~0); 27#L81-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 33#L85-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 20#L89-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 8#L93-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 38#L97-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 45#L101-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 32#L105-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 17#L109-1true assume !(0 != main_~p11~0); 5#L113-1true assume !(0 != main_~p1~0); 39#L119-1true assume !(0 != main_~p2~0); 6#L124-1true assume !(0 != main_~p3~0); 15#L129-1true assume !(0 != main_~p4~0); 25#L134-1true assume !(0 != main_~p5~0); 35#L139-1true assume !(0 != main_~p6~0); 4#L144-1true assume !(0 != main_~p7~0); 34#L149-1true assume !(0 != main_~p8~0); 44#L154-1true assume !(0 != main_~p9~0); 11#L159-1true assume !(0 != main_~p10~0); 24#L164-1true assume !(0 != main_~p11~0); 31#L169-1true [2020-10-19 18:54:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:54:08,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:08,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019611886] [2020-10-19 18:54:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:08,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:08,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:08,789 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2020-10-19 18:54:08,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:08,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814226131] [2020-10-19 18:54:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:08,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814226131] [2020-10-19 18:54:08,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:08,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:08,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373990204] [2020-10-19 18:54:08,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:08,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:08,902 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-10-19 18:54:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:08,947 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2020-10-19 18:54:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:08,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2020-10-19 18:54:08,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-19 18:54:08,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2020-10-19 18:54:08,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-10-19 18:54:08,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-19 18:54:08,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2020-10-19 18:54:08,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:08,966 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-19 18:54:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2020-10-19 18:54:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-19 18:54:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-19 18:54:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2020-10-19 18:54:09,001 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-19 18:54:09,001 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-19 18:54:09,001 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:54:09,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2020-10-19 18:54:09,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-19 18:54:09,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,005 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,005 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,005 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 153#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 154#L169-1 [2020-10-19 18:54:09,006 INFO L796 eck$LassoCheckResult]: Loop: 154#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 185#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 184#L73 assume !(0 != main_~p1~0); 183#L73-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 174#L77-1 assume !(0 != main_~p3~0); 163#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 164#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 159#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 143#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 144#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 178#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 177#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 176#L109-1 assume !(0 != main_~p11~0); 175#L113-1 assume !(0 != main_~p1~0); 173#L119-1 assume !(0 != main_~p2~0); 138#L124-1 assume !(0 != main_~p3~0); 139#L129-1 assume !(0 != main_~p4~0); 148#L134-1 assume !(0 != main_~p5~0); 158#L139-1 assume !(0 != main_~p6~0); 133#L144-1 assume !(0 != main_~p7~0); 135#L149-1 assume !(0 != main_~p8~0); 191#L154-1 assume !(0 != main_~p9~0); 189#L159-1 assume !(0 != main_~p10~0); 187#L164-1 assume !(0 != main_~p11~0); 154#L169-1 [2020-10-19 18:54:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 18:54:09,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002700042] [2020-10-19 18:54:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2020-10-19 18:54:09,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392448232] [2020-10-19 18:54:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392448232] [2020-10-19 18:54:09,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297140257] [2020-10-19 18:54:09,078 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,080 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-10-19 18:54:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,117 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-10-19 18:54:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2020-10-19 18:54:09,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-10-19 18:54:09,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2020-10-19 18:54:09,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2020-10-19 18:54:09,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2020-10-19 18:54:09,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2020-10-19 18:54:09,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,127 INFO L691 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-19 18:54:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2020-10-19 18:54:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-19 18:54:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-19 18:54:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2020-10-19 18:54:09,140 INFO L714 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-19 18:54:09,140 INFO L594 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-19 18:54:09,141 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:54:09,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2020-10-19 18:54:09,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-10-19 18:54:09,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,145 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,145 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,145 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 369#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 370#L169-1 [2020-10-19 18:54:09,146 INFO L796 eck$LassoCheckResult]: Loop: 370#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 400#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 397#L73 assume !(0 != main_~p1~0); 398#L73-2 assume !(0 != main_~p2~0); 451#L77-1 assume !(0 != main_~p3~0); 450#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 449#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 448#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 447#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 446#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 445#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 444#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 443#L109-1 assume !(0 != main_~p11~0); 441#L113-1 assume !(0 != main_~p1~0); 439#L119-1 assume !(0 != main_~p2~0); 437#L124-1 assume !(0 != main_~p3~0); 433#L129-1 assume !(0 != main_~p4~0); 429#L134-1 assume !(0 != main_~p5~0); 425#L139-1 assume !(0 != main_~p6~0); 421#L144-1 assume !(0 != main_~p7~0); 417#L149-1 assume !(0 != main_~p8~0); 413#L154-1 assume !(0 != main_~p9~0); 409#L159-1 assume !(0 != main_~p10~0); 405#L164-1 assume !(0 != main_~p11~0); 370#L169-1 [2020-10-19 18:54:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-19 18:54:09,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916553088] [2020-10-19 18:54:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2020-10-19 18:54:09,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924882657] [2020-10-19 18:54:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924882657] [2020-10-19 18:54:09,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158976783] [2020-10-19 18:54:09,219 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,220 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-10-19 18:54:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,250 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2020-10-19 18:54:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2020-10-19 18:54:09,255 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-10-19 18:54:09,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2020-10-19 18:54:09,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2020-10-19 18:54:09,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2020-10-19 18:54:09,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2020-10-19 18:54:09,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,262 INFO L691 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-19 18:54:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2020-10-19 18:54:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-10-19 18:54:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-19 18:54:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2020-10-19 18:54:09,279 INFO L714 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-19 18:54:09,279 INFO L594 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-19 18:54:09,280 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:54:09,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2020-10-19 18:54:09,282 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-10-19 18:54:09,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,283 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,283 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,284 INFO L794 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 782#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 783#L169-1 [2020-10-19 18:54:09,284 INFO L796 eck$LassoCheckResult]: Loop: 783#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 814#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 809#L73 assume !(0 != main_~p1~0); 804#L73-2 assume !(0 != main_~p2~0); 806#L77-1 assume !(0 != main_~p3~0); 911#L81-1 assume !(0 != main_~p4~0); 907#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 903#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 899#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 895#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 891#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 887#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 883#L109-1 assume !(0 != main_~p11~0); 878#L113-1 assume !(0 != main_~p1~0); 874#L119-1 assume !(0 != main_~p2~0); 871#L124-1 assume !(0 != main_~p3~0); 867#L129-1 assume !(0 != main_~p4~0); 868#L134-1 assume !(0 != main_~p5~0); 844#L139-1 assume !(0 != main_~p6~0); 843#L144-1 assume !(0 != main_~p7~0); 832#L149-1 assume !(0 != main_~p8~0); 827#L154-1 assume !(0 != main_~p9~0); 822#L159-1 assume !(0 != main_~p10~0); 818#L164-1 assume !(0 != main_~p11~0); 783#L169-1 [2020-10-19 18:54:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-19 18:54:09,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623722689] [2020-10-19 18:54:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,309 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,314 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2020-10-19 18:54:09,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112662350] [2020-10-19 18:54:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112662350] [2020-10-19 18:54:09,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367730592] [2020-10-19 18:54:09,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,345 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand 3 states. [2020-10-19 18:54:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,365 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2020-10-19 18:54:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2020-10-19 18:54:09,372 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-10-19 18:54:09,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2020-10-19 18:54:09,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2020-10-19 18:54:09,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2020-10-19 18:54:09,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2020-10-19 18:54:09,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,382 INFO L691 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-19 18:54:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2020-10-19 18:54:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-19 18:54:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-19 18:54:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2020-10-19 18:54:09,408 INFO L714 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-19 18:54:09,408 INFO L594 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-19 18:54:09,408 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:54:09,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2020-10-19 18:54:09,413 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-10-19 18:54:09,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,414 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,414 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,415 INFO L794 eck$LassoCheckResult]: Stem: 1616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1589#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 1590#L169-1 [2020-10-19 18:54:09,415 INFO L796 eck$LassoCheckResult]: Loop: 1590#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 1761#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1757#L73 assume !(0 != main_~p1~0); 1754#L73-2 assume !(0 != main_~p2~0); 1755#L77-1 assume !(0 != main_~p3~0); 1741#L81-1 assume !(0 != main_~p4~0); 1743#L85-1 assume !(0 != main_~p5~0); 1728#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1729#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1716#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1717#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1704#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1705#L109-1 assume !(0 != main_~p11~0); 1689#L113-1 assume !(0 != main_~p1~0); 1691#L119-1 assume !(0 != main_~p2~0); 1793#L124-1 assume !(0 != main_~p3~0); 1790#L129-1 assume !(0 != main_~p4~0); 1788#L134-1 assume !(0 != main_~p5~0); 1785#L139-1 assume !(0 != main_~p6~0); 1781#L144-1 assume !(0 != main_~p7~0); 1777#L149-1 assume !(0 != main_~p8~0); 1773#L154-1 assume !(0 != main_~p9~0); 1769#L159-1 assume !(0 != main_~p10~0); 1765#L164-1 assume !(0 != main_~p11~0); 1590#L169-1 [2020-10-19 18:54:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-19 18:54:09,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327672033] [2020-10-19 18:54:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2020-10-19 18:54:09,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923512270] [2020-10-19 18:54:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923512270] [2020-10-19 18:54:09,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733063416] [2020-10-19 18:54:09,476 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,477 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand 3 states. [2020-10-19 18:54:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,503 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2020-10-19 18:54:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2020-10-19 18:54:09,514 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-10-19 18:54:09,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2020-10-19 18:54:09,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2020-10-19 18:54:09,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2020-10-19 18:54:09,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2020-10-19 18:54:09,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,526 INFO L691 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-19 18:54:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2020-10-19 18:54:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2020-10-19 18:54:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2020-10-19 18:54:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2020-10-19 18:54:09,552 INFO L714 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-19 18:54:09,553 INFO L594 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-19 18:54:09,553 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:54:09,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2020-10-19 18:54:09,560 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-10-19 18:54:09,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,561 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,561 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,562 INFO L794 eck$LassoCheckResult]: Stem: 3189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3166#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 3167#L169-1 [2020-10-19 18:54:09,562 INFO L796 eck$LassoCheckResult]: Loop: 3167#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 3287#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 3280#L73 assume !(0 != main_~p1~0); 3281#L73-2 assume !(0 != main_~p2~0); 3268#L77-1 assume !(0 != main_~p3~0); 3269#L81-1 assume !(0 != main_~p4~0); 3398#L85-1 assume !(0 != main_~p5~0); 3391#L89-1 assume !(0 != main_~p6~0); 3387#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3383#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3379#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3375#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3371#L109-1 assume !(0 != main_~p11~0); 3362#L113-1 assume !(0 != main_~p1~0); 3361#L119-1 assume !(0 != main_~p2~0); 3359#L124-1 assume !(0 != main_~p3~0); 3356#L129-1 assume !(0 != main_~p4~0); 3349#L134-1 assume !(0 != main_~p5~0); 3344#L139-1 assume !(0 != main_~p6~0); 3318#L144-1 assume !(0 != main_~p7~0); 3317#L149-1 assume !(0 != main_~p8~0); 3312#L154-1 assume !(0 != main_~p9~0); 3310#L159-1 assume !(0 != main_~p10~0); 3296#L164-1 assume !(0 != main_~p11~0); 3167#L169-1 [2020-10-19 18:54:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-19 18:54:09,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574959815] [2020-10-19 18:54:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2020-10-19 18:54:09,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571574089] [2020-10-19 18:54:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571574089] [2020-10-19 18:54:09,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747670738] [2020-10-19 18:54:09,614 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,615 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand 3 states. [2020-10-19 18:54:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,641 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2020-10-19 18:54:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2020-10-19 18:54:09,666 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-10-19 18:54:09,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2020-10-19 18:54:09,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2020-10-19 18:54:09,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2020-10-19 18:54:09,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2020-10-19 18:54:09,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,689 INFO L691 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-19 18:54:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2020-10-19 18:54:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2020-10-19 18:54:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-10-19 18:54:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2020-10-19 18:54:09,740 INFO L714 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-19 18:54:09,740 INFO L594 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-19 18:54:09,740 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:54:09,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2020-10-19 18:54:09,754 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-10-19 18:54:09,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:09,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:09,755 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:09,756 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:09,756 INFO L794 eck$LassoCheckResult]: Stem: 6288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6264#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 6265#L169-1 [2020-10-19 18:54:09,756 INFO L796 eck$LassoCheckResult]: Loop: 6265#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 6475#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 6472#L73 assume !(0 != main_~p1~0); 6473#L73-2 assume !(0 != main_~p2~0); 6597#L77-1 assume !(0 != main_~p3~0); 6593#L81-1 assume !(0 != main_~p4~0); 6590#L85-1 assume !(0 != main_~p5~0); 6588#L89-1 assume !(0 != main_~p6~0); 6585#L93-1 assume !(0 != main_~p7~0); 6583#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6580#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6577#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6574#L109-1 assume !(0 != main_~p11~0); 6571#L113-1 assume !(0 != main_~p1~0); 6568#L119-1 assume !(0 != main_~p2~0); 6565#L124-1 assume !(0 != main_~p3~0); 6563#L129-1 assume !(0 != main_~p4~0); 6557#L134-1 assume !(0 != main_~p5~0); 6554#L139-1 assume !(0 != main_~p6~0); 6552#L144-1 assume !(0 != main_~p7~0); 6551#L149-1 assume !(0 != main_~p8~0); 6549#L154-1 assume !(0 != main_~p9~0); 6547#L159-1 assume !(0 != main_~p10~0); 6545#L164-1 assume !(0 != main_~p11~0); 6265#L169-1 [2020-10-19 18:54:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-19 18:54:09,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774709043] [2020-10-19 18:54:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:09,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:09,783 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2020-10-19 18:54:09,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:09,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843043131] [2020-10-19 18:54:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:09,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843043131] [2020-10-19 18:54:09,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:09,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:09,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229339508] [2020-10-19 18:54:09,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:09,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:09,812 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2020-10-19 18:54:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:09,848 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2020-10-19 18:54:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:09,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2020-10-19 18:54:09,885 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-10-19 18:54:09,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2020-10-19 18:54:09,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2020-10-19 18:54:09,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2020-10-19 18:54:09,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2020-10-19 18:54:09,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:09,925 INFO L691 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-19 18:54:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2020-10-19 18:54:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2020-10-19 18:54:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2020-10-19 18:54:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2020-10-19 18:54:10,015 INFO L714 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-19 18:54:10,015 INFO L594 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-19 18:54:10,015 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:54:10,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2020-10-19 18:54:10,039 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-10-19 18:54:10,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:10,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:10,040 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:10,041 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:10,041 INFO L794 eck$LassoCheckResult]: Stem: 12376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12354#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 12355#L169-1 [2020-10-19 18:54:10,041 INFO L796 eck$LassoCheckResult]: Loop: 12355#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 12825#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12799#L73 assume !(0 != main_~p1~0); 12795#L73-2 assume !(0 != main_~p2~0); 12785#L77-1 assume !(0 != main_~p3~0); 12783#L81-1 assume !(0 != main_~p4~0); 12780#L85-1 assume !(0 != main_~p5~0); 12776#L89-1 assume !(0 != main_~p6~0); 12765#L93-1 assume !(0 != main_~p7~0); 12759#L97-1 assume !(0 != main_~p8~0); 12760#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12875#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12873#L109-1 assume !(0 != main_~p11~0); 12871#L113-1 assume !(0 != main_~p1~0); 12872#L119-1 assume !(0 != main_~p2~0); 12896#L124-1 assume !(0 != main_~p3~0); 12891#L129-1 assume !(0 != main_~p4~0); 12886#L134-1 assume !(0 != main_~p5~0); 12887#L139-1 assume !(0 != main_~p6~0); 12677#L144-1 assume !(0 != main_~p7~0); 12679#L149-1 assume !(0 != main_~p8~0); 12704#L154-1 assume !(0 != main_~p9~0); 12829#L159-1 assume !(0 != main_~p10~0); 12827#L164-1 assume !(0 != main_~p11~0); 12355#L169-1 [2020-10-19 18:54:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-19 18:54:10,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022266419] [2020-10-19 18:54:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,061 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2020-10-19 18:54:10,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949434066] [2020-10-19 18:54:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:10,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949434066] [2020-10-19 18:54:10,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:10,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:10,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649232945] [2020-10-19 18:54:10,091 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:10,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:10,092 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2020-10-19 18:54:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:10,143 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2020-10-19 18:54:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:10,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2020-10-19 18:54:10,198 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-10-19 18:54:10,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2020-10-19 18:54:10,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2020-10-19 18:54:10,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2020-10-19 18:54:10,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2020-10-19 18:54:10,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:10,284 INFO L691 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-19 18:54:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2020-10-19 18:54:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2020-10-19 18:54:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7938 states. [2020-10-19 18:54:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2020-10-19 18:54:10,448 INFO L714 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-19 18:54:10,448 INFO L594 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-19 18:54:10,448 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:54:10,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2020-10-19 18:54:10,485 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-10-19 18:54:10,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:10,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:10,487 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:10,487 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:10,487 INFO L794 eck$LassoCheckResult]: Stem: 24361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 24332#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 24333#L169-1 [2020-10-19 18:54:10,488 INFO L796 eck$LassoCheckResult]: Loop: 24333#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 24485#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 24481#L73 assume !(0 != main_~p1~0); 24478#L73-2 assume !(0 != main_~p2~0); 24475#L77-1 assume !(0 != main_~p3~0); 24468#L81-1 assume !(0 != main_~p4~0); 24466#L85-1 assume !(0 != main_~p5~0); 24464#L89-1 assume !(0 != main_~p6~0); 24465#L93-1 assume !(0 != main_~p7~0); 24536#L97-1 assume !(0 != main_~p8~0); 24532#L101-1 assume !(0 != main_~p9~0); 24529#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24527#L109-1 assume !(0 != main_~p11~0); 24524#L113-1 assume !(0 != main_~p1~0); 24520#L119-1 assume !(0 != main_~p2~0); 24517#L124-1 assume !(0 != main_~p3~0); 24512#L129-1 assume !(0 != main_~p4~0); 24508#L134-1 assume !(0 != main_~p5~0); 24470#L139-1 assume !(0 != main_~p6~0); 24471#L144-1 assume !(0 != main_~p7~0); 24500#L149-1 assume !(0 != main_~p8~0); 24496#L154-1 assume !(0 != main_~p9~0); 24493#L159-1 assume !(0 != main_~p10~0); 24490#L164-1 assume !(0 != main_~p11~0); 24333#L169-1 [2020-10-19 18:54:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-19 18:54:10,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374074693] [2020-10-19 18:54:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:10,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:10,506 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2020-10-19 18:54:10,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:10,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088927643] [2020-10-19 18:54:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:54:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:54:10,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088927643] [2020-10-19 18:54:10,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:54:10,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:54:10,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145675878] [2020-10-19 18:54:10,537 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:54:10,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:54:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 18:54:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 18:54:10,540 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2020-10-19 18:54:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:54:10,609 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2020-10-19 18:54:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 18:54:10,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2020-10-19 18:54:10,787 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-10-19 18:54:10,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2020-10-19 18:54:10,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2020-10-19 18:54:10,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2020-10-19 18:54:10,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2020-10-19 18:54:10,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:54:10,910 INFO L691 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-19 18:54:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2020-10-19 18:54:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2020-10-19 18:54:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15618 states. [2020-10-19 18:54:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2020-10-19 18:54:11,207 INFO L714 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-19 18:54:11,207 INFO L594 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-19 18:54:11,208 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:54:11,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2020-10-19 18:54:11,286 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-10-19 18:54:11,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:54:11,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:54:11,293 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:54:11,293 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:54:11,294 INFO L794 eck$LassoCheckResult]: Stem: 47921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 47892#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;havoc main_~cond~0; 47893#L169-1 [2020-10-19 18:54:11,295 INFO L796 eck$LassoCheckResult]: Loop: 47893#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 48256#L46 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 48253#L73 assume !(0 != main_~p1~0); 48249#L73-2 assume !(0 != main_~p2~0); 48246#L77-1 assume !(0 != main_~p3~0); 48242#L81-1 assume !(0 != main_~p4~0); 48238#L85-1 assume !(0 != main_~p5~0); 48236#L89-1 assume !(0 != main_~p6~0); 48234#L93-1 assume !(0 != main_~p7~0); 48231#L97-1 assume !(0 != main_~p8~0); 48228#L101-1 assume !(0 != main_~p9~0); 48222#L105-1 assume !(0 != main_~p10~0); 48223#L109-1 assume !(0 != main_~p11~0); 48301#L113-1 assume !(0 != main_~p1~0); 48297#L119-1 assume !(0 != main_~p2~0); 48294#L124-1 assume !(0 != main_~p3~0); 48290#L129-1 assume !(0 != main_~p4~0); 48203#L134-1 assume !(0 != main_~p5~0); 48194#L139-1 assume !(0 != main_~p6~0); 48131#L144-1 assume !(0 != main_~p7~0); 48133#L149-1 assume !(0 != main_~p8~0); 48120#L154-1 assume !(0 != main_~p9~0); 48121#L159-1 assume !(0 != main_~p10~0); 48261#L164-1 assume !(0 != main_~p11~0); 47893#L169-1 [2020-10-19 18:54:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-19 18:54:11,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645839270] [2020-10-19 18:54:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2020-10-19 18:54:11,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630696966] [2020-10-19 18:54:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,391 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:54:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2020-10-19 18:54:11,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:54:11,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998817099] [2020-10-19 18:54:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:54:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:54:11,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:54:11,444 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:54:11,562 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-19 18:54:11,905 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-10-19 18:54:12,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:54:12 BoogieIcfgContainer [2020-10-19 18:54:12,064 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:54:12,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:54:12,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:54:12,065 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:54:12,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:54:08" (3/4) ... [2020-10-19 18:54:12,069 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 18:54:12,135 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 18:54:12,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:54:12,137 INFO L168 Benchmark]: Toolchain (without parser) took 4467.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 954.6 MB in the beginning and 971.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,137 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:54:12,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.17 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 938.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,139 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,140 INFO L168 Benchmark]: RCFGBuilder took 415.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,141 INFO L168 Benchmark]: BuchiAutomizer took 3548.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 63.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,141 INFO L168 Benchmark]: Witness Printer took 70.14 ms. Allocated memory is still 1.3 GB. Free memory was 980.8 MB in the beginning and 971.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2020-10-19 18:54:12,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.17 ms. Allocated memory is still 1.0 GB. Free memory was 954.6 MB in the beginning and 938.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 415.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3548.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 63.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. * Witness Printer took 70.14 ms. Allocated memory is still 1.3 GB. Free memory was 980.8 MB in the beginning and 971.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 15618 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 796 SDtfs, 411 SDslu, 491 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=4, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df6a112=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ef01f62=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e0d80fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11eb7c19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29ada107=0, p11=0, lk10=0, lk11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7948052c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a0a33fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e166bae=11, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1718a05f=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2520d820=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fe17329=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b00424b=0, NULL=0, NULL=0, NULL=0, NULL=3, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...