./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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_9.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 5107685577f81a5867811396b2c0a05eb5630c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f470102 [2019-11-28 20:39:27,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:39:27,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:39:27,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:39:27,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:39:27,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:39:27,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:39:27,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:39:27,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:39:27,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:39:27,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:39:27,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:39:27,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:39:27,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:39:27,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:39:27,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:39:27,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:39:27,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:39:27,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:39:27,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:39:27,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:39:27,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:39:27,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:39:27,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:39:27,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:39:27,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:39:27,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:39:27,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:39:27,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:39:27,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:39:27,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:39:27,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:39:27,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:39:27,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:39:27,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:39:27,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:39:27,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:39:27,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:39:27,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:39:27,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:39:27,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:39:27,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:39:27,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:39:27,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:39:27,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:39:27,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:39:27,704 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:39:27,704 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:39:27,704 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:39:27,705 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:39:27,705 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:39:27,705 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:39:27,706 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:39:27,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:39:27,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:39:27,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:39:27,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:39:27,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:39:27,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:39:27,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:39:27,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:39:27,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:39:27,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:39:27,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:39:27,709 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:39:27,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:39:27,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:39:27,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:39:27,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:39:27,710 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:39:27,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:39:27,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:39:27,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:39:27,712 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:39:27,713 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:39:27,713 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-28 20:39:28,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:39:28,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:39:28,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:39:28,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:39:28,042 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:39:28,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 20:39:28,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df176cd4/0f05f570b70b4f7fa546ce213986dd4e/FLAGca9744ec3 [2019-11-28 20:39:28,576 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:39:28,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 20:39:28,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df176cd4/0f05f570b70b4f7fa546ce213986dd4e/FLAGca9744ec3 [2019-11-28 20:39:28,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df176cd4/0f05f570b70b4f7fa546ce213986dd4e [2019-11-28 20:39:28,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:39:28,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:39:28,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:28,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:39:28,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:39:28,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:28" (1/1) ... [2019-11-28 20:39:28,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e68f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:28, skipping insertion in model container [2019-11-28 20:39:28,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:28" (1/1) ... [2019-11-28 20:39:28,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:39:29,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:39:29,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:29,205 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:39:29,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:29,324 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:39:29,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29 WrapperNode [2019-11-28 20:39:29,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:29,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:29,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:39:29,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:39:29,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:29,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:39:29,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:39:29,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:39:29,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (1/1) ... [2019-11-28 20:39:29,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:39:29,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:39:29,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:39:29,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:39:29,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (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 [2019-11-28 20:39:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:39:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:39:29,705 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:39:29,706 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:39:29,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:29 BoogieIcfgContainer [2019-11-28 20:39:29,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:39:29,709 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:39:29,709 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:39:29,712 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:39:29,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:29,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:39:28" (1/3) ... [2019-11-28 20:39:29,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff35d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:29, skipping insertion in model container [2019-11-28 20:39:29,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:29,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:29" (2/3) ... [2019-11-28 20:39:29,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff35d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:29, skipping insertion in model container [2019-11-28 20:39:29,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:29,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:29" (3/3) ... [2019-11-28 20:39:29,718 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2019-11-28 20:39:29,802 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:39:29,802 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:39:29,804 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:39:29,804 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:39:29,805 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:39:29,805 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:39:29,805 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:39:29,805 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:39:29,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-11-28 20:39:29,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-28 20:39:29,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:29,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:29,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:29,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:29,851 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:39:29,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-11-28 20:39:29,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-28 20:39:29,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:29,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:29,855 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:29,856 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:29,862 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 31#L139-1true [2019-11-28 20:39:29,863 INFO L796 eck$LassoCheckResult]: Loop: 31#L139-1true assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L38true 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; 27#L61true assume 0 != main_~p1~0;main_~lk1~0 := 1; 24#L61-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 11#L65-1true assume !(0 != main_~p3~0); 20#L69-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L73-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 34#L77-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 23#L81-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 30#L85-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L89-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L93-1true assume !(0 != main_~p1~0); 35#L99-1true assume !(0 != main_~p2~0); 6#L104-1true assume !(0 != main_~p3~0); 14#L109-1true assume !(0 != main_~p4~0); 26#L114-1true assume !(0 != main_~p5~0); 33#L119-1true assume !(0 != main_~p6~0); 3#L124-1true assume !(0 != main_~p7~0); 12#L129-1true assume !(0 != main_~p8~0); 22#L134-1true assume !(0 != main_~p9~0); 31#L139-1true [2019-11-28 20:39:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:39:29,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:29,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009082317] [2019-11-28 20:39:29,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:29,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2019-11-28 20:39:29,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:29,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784544258] [2019-11-28 20:39:29,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784544258] [2019-11-28 20:39:30,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509474888] [2019-11-28 20:39:30,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,109 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-28 20:39:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,176 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2019-11-28 20:39:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 117 transitions. [2019-11-28 20:39:30,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-28 20:39:30,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 58 states and 92 transitions. [2019-11-28 20:39:30,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-28 20:39:30,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-11-28 20:39:30,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2019-11-28 20:39:30,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,194 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-28 20:39:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2019-11-28 20:39:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-28 20:39:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 20:39:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2019-11-28 20:39:30,244 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-28 20:39:30,244 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-11-28 20:39:30,244 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:39:30,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2019-11-28 20:39:30,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-28 20:39:30,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,255 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 144#L139-1 [2019-11-28 20:39:30,255 INFO L796 eck$LassoCheckResult]: Loop: 144#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 155#L38 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; 154#L61 assume !(0 != main_~p1~0); 139#L61-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 128#L65-1 assume !(0 != main_~p3~0); 129#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 124#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 125#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 149#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 148#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 147#L93-1 assume !(0 != main_~p1~0); 146#L99-1 assume !(0 != main_~p2~0); 119#L104-1 assume !(0 != main_~p3~0); 120#L109-1 assume !(0 != main_~p4~0); 127#L114-1 assume !(0 != main_~p5~0); 135#L119-1 assume !(0 != main_~p6~0); 112#L124-1 assume !(0 != main_~p7~0); 113#L129-1 assume !(0 != main_~p8~0); 157#L134-1 assume !(0 != main_~p9~0); 144#L139-1 [2019-11-28 20:39:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:39:30,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129978801] [2019-11-28 20:39:30,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2019-11-28 20:39:30,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886179752] [2019-11-28 20:39:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886179752] [2019-11-28 20:39:30,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126007530] [2019-11-28 20:39:30,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,345 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-28 20:39:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,377 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2019-11-28 20:39:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2019-11-28 20:39:30,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-11-28 20:39:30,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2019-11-28 20:39:30,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2019-11-28 20:39:30,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-11-28 20:39:30,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2019-11-28 20:39:30,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,385 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-28 20:39:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2019-11-28 20:39:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 20:39:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 20:39:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2019-11-28 20:39:30,396 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-28 20:39:30,396 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-11-28 20:39:30,396 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:39:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2019-11-28 20:39:30,399 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-11-28 20:39:30,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,399 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,400 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 324#L139-1 [2019-11-28 20:39:30,400 INFO L796 eck$LassoCheckResult]: Loop: 324#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 292#L38 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; 293#L61 assume !(0 != main_~p1~0); 359#L61-2 assume !(0 != main_~p2~0); 358#L65-1 assume !(0 != main_~p3~0); 357#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 356#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 355#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 354#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 353#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 352#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 350#L93-1 assume !(0 != main_~p1~0); 349#L99-1 assume !(0 != main_~p2~0); 347#L104-1 assume !(0 != main_~p3~0); 346#L109-1 assume !(0 != main_~p4~0); 341#L114-1 assume !(0 != main_~p5~0); 339#L119-1 assume !(0 != main_~p6~0); 338#L124-1 assume !(0 != main_~p7~0); 333#L129-1 assume !(0 != main_~p8~0); 331#L134-1 assume !(0 != main_~p9~0); 324#L139-1 [2019-11-28 20:39:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:39:30,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522211582] [2019-11-28 20:39:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2019-11-28 20:39:30,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466609922] [2019-11-28 20:39:30,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466609922] [2019-11-28 20:39:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303371425] [2019-11-28 20:39:30,460 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,461 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand 3 states. [2019-11-28 20:39:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,500 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2019-11-28 20:39:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2019-11-28 20:39:30,510 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-11-28 20:39:30,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2019-11-28 20:39:30,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-11-28 20:39:30,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-11-28 20:39:30,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2019-11-28 20:39:30,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,521 INFO L688 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-28 20:39:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2019-11-28 20:39:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-28 20:39:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 20:39:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2019-11-28 20:39:30,540 INFO L711 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-28 20:39:30,540 INFO L591 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-11-28 20:39:30,540 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:39:30,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2019-11-28 20:39:30,542 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-11-28 20:39:30,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,544 INFO L794 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 664#L139-1 [2019-11-28 20:39:30,544 INFO L796 eck$LassoCheckResult]: Loop: 664#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 724#L38 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; 714#L61 assume !(0 != main_~p1~0); 716#L61-2 assume !(0 != main_~p2~0); 707#L65-1 assume !(0 != main_~p3~0); 708#L69-1 assume !(0 != main_~p4~0); 770#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 769#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 768#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 767#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 766#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 765#L93-1 assume !(0 != main_~p1~0); 762#L99-1 assume !(0 != main_~p2~0); 760#L104-1 assume !(0 != main_~p3~0); 756#L109-1 assume !(0 != main_~p4~0); 757#L114-1 assume !(0 != main_~p5~0); 752#L119-1 assume !(0 != main_~p6~0); 751#L124-1 assume !(0 != main_~p7~0); 746#L129-1 assume !(0 != main_~p8~0); 745#L134-1 assume !(0 != main_~p9~0); 664#L139-1 [2019-11-28 20:39:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:39:30,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783608708] [2019-11-28 20:39:30,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2019-11-28 20:39:30,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956905852] [2019-11-28 20:39:30,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956905852] [2019-11-28 20:39:30,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767870946] [2019-11-28 20:39:30,606 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,607 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand 3 states. [2019-11-28 20:39:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,624 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-11-28 20:39:30,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2019-11-28 20:39:30,628 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-11-28 20:39:30,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2019-11-28 20:39:30,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2019-11-28 20:39:30,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2019-11-28 20:39:30,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2019-11-28 20:39:30,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,636 INFO L688 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-28 20:39:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2019-11-28 20:39:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-28 20:39:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 20:39:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2019-11-28 20:39:30,663 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-28 20:39:30,666 INFO L591 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-11-28 20:39:30,666 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:39:30,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2019-11-28 20:39:30,669 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-11-28 20:39:30,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,672 INFO L794 eck$LassoCheckResult]: Stem: 1324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 1325#L139-1 [2019-11-28 20:39:30,672 INFO L796 eck$LassoCheckResult]: Loop: 1325#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 1372#L38 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; 1370#L61 assume !(0 != main_~p1~0); 1366#L61-2 assume !(0 != main_~p2~0); 1364#L65-1 assume !(0 != main_~p3~0); 1360#L69-1 assume !(0 != main_~p4~0); 1356#L73-1 assume !(0 != main_~p5~0); 1354#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1352#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1350#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1348#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1346#L93-1 assume !(0 != main_~p1~0); 1340#L99-1 assume !(0 != main_~p2~0); 1342#L104-1 assume !(0 != main_~p3~0); 1397#L109-1 assume !(0 != main_~p4~0); 1393#L114-1 assume !(0 != main_~p5~0); 1390#L119-1 assume !(0 != main_~p6~0); 1385#L124-1 assume !(0 != main_~p7~0); 1382#L129-1 assume !(0 != main_~p8~0); 1376#L134-1 assume !(0 != main_~p9~0); 1325#L139-1 [2019-11-28 20:39:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 20:39:30,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265337880] [2019-11-28 20:39:30,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2019-11-28 20:39:30,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-28 20:39:30,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936842191] [2019-11-28 20:39:30,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513750128] [2019-11-28 20:39:30,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,731 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand 3 states. [2019-11-28 20:39:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,756 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2019-11-28 20:39:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2019-11-28 20:39:30,767 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-11-28 20:39:30,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2019-11-28 20:39:30,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2019-11-28 20:39:30,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2019-11-28 20:39:30,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2019-11-28 20:39:30,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,777 INFO L688 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-28 20:39:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2019-11-28 20:39:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2019-11-28 20:39:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-28 20:39:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2019-11-28 20:39:30,799 INFO L711 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-28 20:39:30,799 INFO L591 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-11-28 20:39:30,799 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:39:30,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2019-11-28 20:39:30,806 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-11-28 20:39:30,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,807 INFO L794 eck$LassoCheckResult]: Stem: 2614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 2615#L139-1 [2019-11-28 20:39:30,807 INFO L796 eck$LassoCheckResult]: Loop: 2615#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 2769#L38 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; 2767#L61 assume !(0 != main_~p1~0); 2764#L61-2 assume !(0 != main_~p2~0); 2765#L65-1 assume !(0 != main_~p3~0); 2746#L69-1 assume !(0 != main_~p4~0); 2748#L73-1 assume !(0 != main_~p5~0); 2732#L77-1 assume !(0 != main_~p6~0); 2734#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2718#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2719#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2700#L93-1 assume !(0 != main_~p1~0); 2702#L99-1 assume !(0 != main_~p2~0); 2791#L104-1 assume !(0 != main_~p3~0); 2788#L109-1 assume !(0 != main_~p4~0); 2786#L114-1 assume !(0 != main_~p5~0); 2784#L119-1 assume !(0 != main_~p6~0); 2780#L124-1 assume !(0 != main_~p7~0); 2777#L129-1 assume !(0 != main_~p8~0); 2773#L134-1 assume !(0 != main_~p9~0); 2615#L139-1 [2019-11-28 20:39:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 20:39:30,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762349003] [2019-11-28 20:39:30,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:30,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2019-11-28 20:39:30,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464162796] [2019-11-28 20:39:30,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:30,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464162796] [2019-11-28 20:39:30,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:30,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:30,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237230089] [2019-11-28 20:39:30,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:30,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:30,857 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand 3 states. [2019-11-28 20:39:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:30,886 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2019-11-28 20:39:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:30,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2019-11-28 20:39:30,918 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-11-28 20:39:30,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-11-28 20:39:30,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2019-11-28 20:39:30,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2019-11-28 20:39:30,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2019-11-28 20:39:30,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:30,939 INFO L688 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-28 20:39:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2019-11-28 20:39:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-11-28 20:39:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-11-28 20:39:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-11-28 20:39:30,978 INFO L711 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-28 20:39:30,978 INFO L591 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-11-28 20:39:30,978 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:39:30,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2019-11-28 20:39:30,990 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-11-28 20:39:30,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:30,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:30,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:30,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:30,992 INFO L794 eck$LassoCheckResult]: Stem: 5134#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 5135#L139-1 [2019-11-28 20:39:30,993 INFO L796 eck$LassoCheckResult]: Loop: 5135#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 5321#L38 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; 5319#L61 assume !(0 != main_~p1~0); 5317#L61-2 assume !(0 != main_~p2~0); 5316#L65-1 assume !(0 != main_~p3~0); 5313#L69-1 assume !(0 != main_~p4~0); 5309#L73-1 assume !(0 != main_~p5~0); 5305#L77-1 assume !(0 != main_~p6~0); 5306#L81-1 assume !(0 != main_~p7~0); 5284#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5285#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5270#L93-1 assume !(0 != main_~p1~0); 5271#L99-1 assume !(0 != main_~p2~0); 5245#L104-1 assume !(0 != main_~p3~0); 5244#L109-1 assume !(0 != main_~p4~0); 5225#L114-1 assume !(0 != main_~p5~0); 5227#L119-1 assume !(0 != main_~p6~0); 5326#L124-1 assume !(0 != main_~p7~0); 5325#L129-1 assume !(0 != main_~p8~0); 5323#L134-1 assume !(0 != main_~p9~0); 5135#L139-1 [2019-11-28 20:39:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 20:39:30,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:30,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141679250] [2019-11-28 20:39:30,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2019-11-28 20:39:31,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159533019] [2019-11-28 20:39:31,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:31,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159533019] [2019-11-28 20:39:31,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:31,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:31,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143778560] [2019-11-28 20:39:31,060 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:31,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:31,061 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand 3 states. [2019-11-28 20:39:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:31,091 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2019-11-28 20:39:31,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:31,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2019-11-28 20:39:31,122 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-11-28 20:39:31,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-11-28 20:39:31,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2019-11-28 20:39:31,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2019-11-28 20:39:31,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2019-11-28 20:39:31,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:31,153 INFO L688 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-28 20:39:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2019-11-28 20:39:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2019-11-28 20:39:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2019-11-28 20:39:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-11-28 20:39:31,225 INFO L711 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-28 20:39:31,225 INFO L591 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-11-28 20:39:31,226 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:39:31,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2019-11-28 20:39:31,244 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-11-28 20:39:31,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:31,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:31,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:31,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:31,246 INFO L794 eck$LassoCheckResult]: Stem: 10069#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 10070#L139-1 [2019-11-28 20:39:31,246 INFO L796 eck$LassoCheckResult]: Loop: 10070#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 10336#L38 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; 10334#L61 assume !(0 != main_~p1~0); 10332#L61-2 assume !(0 != main_~p2~0); 10329#L65-1 assume !(0 != main_~p3~0); 10326#L69-1 assume !(0 != main_~p4~0); 10322#L73-1 assume !(0 != main_~p5~0); 10318#L77-1 assume !(0 != main_~p6~0); 10319#L81-1 assume !(0 != main_~p7~0); 10299#L85-1 assume !(0 != main_~p8~0); 10301#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10284#L93-1 assume !(0 != main_~p1~0); 10286#L99-1 assume !(0 != main_~p2~0); 10242#L104-1 assume !(0 != main_~p3~0); 10241#L109-1 assume !(0 != main_~p4~0); 10225#L114-1 assume !(0 != main_~p5~0); 10227#L119-1 assume !(0 != main_~p6~0); 10342#L124-1 assume !(0 != main_~p7~0); 10340#L129-1 assume !(0 != main_~p8~0); 10339#L134-1 assume !(0 != main_~p9~0); 10070#L139-1 [2019-11-28 20:39:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 20:39:31,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233397442] [2019-11-28 20:39:31,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2019-11-28 20:39:31,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553418456] [2019-11-28 20:39:31,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:31,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553418456] [2019-11-28 20:39:31,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:31,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:31,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500685249] [2019-11-28 20:39:31,279 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:31,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:31,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:31,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:31,280 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2019-11-28 20:39:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:31,323 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2019-11-28 20:39:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:31,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2019-11-28 20:39:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-11-28 20:39:31,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-11-28 20:39:31,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2019-11-28 20:39:31,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2019-11-28 20:39:31,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2019-11-28 20:39:31,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:31,434 INFO L688 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-28 20:39:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2019-11-28 20:39:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2019-11-28 20:39:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-11-28 20:39:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-11-28 20:39:31,581 INFO L711 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-28 20:39:31,581 INFO L591 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-11-28 20:39:31,581 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:39:31,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2019-11-28 20:39:31,616 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-11-28 20:39:31,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:31,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:31,618 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:31,618 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:31,618 INFO L794 eck$LassoCheckResult]: Stem: 19746#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;havoc main_~cond~0; 19747#L139-1 [2019-11-28 20:39:31,618 INFO L796 eck$LassoCheckResult]: Loop: 19747#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 20162#L38 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; 20160#L61 assume !(0 != main_~p1~0); 20158#L61-2 assume !(0 != main_~p2~0); 20157#L65-1 assume !(0 != main_~p3~0); 20029#L69-1 assume !(0 != main_~p4~0); 20031#L73-1 assume !(0 != main_~p5~0); 20146#L77-1 assume !(0 != main_~p6~0); 20142#L81-1 assume !(0 != main_~p7~0); 20138#L85-1 assume !(0 != main_~p8~0); 20090#L89-1 assume !(0 != main_~p9~0); 20092#L93-1 assume !(0 != main_~p1~0); 20079#L99-1 assume !(0 != main_~p2~0); 20081#L104-1 assume !(0 != main_~p3~0); 20073#L109-1 assume !(0 != main_~p4~0); 20074#L114-1 assume !(0 != main_~p5~0); 20068#L119-1 assume !(0 != main_~p6~0); 20069#L124-1 assume !(0 != main_~p7~0); 20175#L129-1 assume !(0 != main_~p8~0); 20089#L134-1 assume !(0 != main_~p9~0); 19747#L139-1 [2019-11-28 20:39:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 20:39:31,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253296459] [2019-11-28 20:39:31,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,628 INFO L82 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2019-11-28 20:39:31,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61027962] [2019-11-28 20:39:31,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1231517452, now seen corresponding path program 1 times [2019-11-28 20:39:31,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:31,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144198062] [2019-11-28 20:39:31,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:31,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:31,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:39:31 BoogieIcfgContainer [2019-11-28 20:39:31,901 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:39:31,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:39:31,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:39:31,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:39:31,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:29" (3/4) ... [2019-11-28 20:39:31,908 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:39:31,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:39:32,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:39:32,002 INFO L168 Benchmark]: Toolchain (without parser) took 3041.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 957.7 MB in the beginning and 834.4 MB in the end (delta: 123.2 MB). Peak memory consumption was 242.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,003 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,004 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,005 INFO L168 Benchmark]: RCFGBuilder took 317.68 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,006 INFO L168 Benchmark]: BuchiAutomizer took 2192.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 834.4 MB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:32,007 INFO L168 Benchmark]: Witness Printer took 97.23 ms. Allocated memory is still 1.1 GB. Free memory is still 834.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:32,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.19 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.68 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2192.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 834.4 MB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. * Witness Printer took 97.23 ms. Allocated memory is still 1.1 GB. Free memory is still 834.4 MB. There was no memory consumed. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6401 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 6401 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 575 SDtfs, 301 SDslu, 348 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1692cdb=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7987955b=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f2aecb8=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60c74708=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@96e2f12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f472d8e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b4cdfbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41e504b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@613ae4bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28f982d1=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L34] int cond; Loop: [L36] COND TRUE 1 [L37] cond = __VERIFIER_nondet_int() [L38] COND FALSE !(cond == 0) [L41] lk1 = 0 [L43] lk2 = 0 [L45] lk3 = 0 [L47] lk4 = 0 [L49] lk5 = 0 [L51] lk6 = 0 [L53] lk7 = 0 [L55] lk8 = 0 [L57] lk9 = 0 [L61] COND FALSE !(p1 != 0) [L65] COND FALSE !(p2 != 0) [L69] COND FALSE !(p3 != 0) [L73] COND FALSE !(p4 != 0) [L77] COND FALSE !(p5 != 0) [L81] COND FALSE !(p6 != 0) [L85] COND FALSE !(p7 != 0) [L89] COND FALSE !(p8 != 0) [L93] COND FALSE !(p9 != 0) [L99] COND FALSE !(p1 != 0) [L104] COND FALSE !(p2 != 0) [L109] COND FALSE !(p3 != 0) [L114] COND FALSE !(p4 != 0) [L119] COND FALSE !(p5 != 0) [L124] COND FALSE !(p6 != 0) [L129] COND FALSE !(p7 != 0) [L134] COND FALSE !(p8 != 0) [L139] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...