./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.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.24-0ed9222-m [2019-01-14 02:55:04,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:55:04,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:55:04,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:55:04,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:55:04,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:55:04,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:55:04,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:55:04,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:55:04,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:55:04,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:55:04,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:55:04,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:55:04,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:55:04,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:55:04,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:55:04,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:55:04,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:55:04,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:55:04,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:55:04,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:55:04,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:55:04,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:55:04,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:55:04,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:55:04,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:55:04,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:55:04,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:55:04,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:55:04,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:55:04,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:55:04,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:55:04,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:55:04,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:55:04,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:55:04,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:55:04,381 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:55:04,398 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:55:04,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:55:04,400 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:55:04,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:55:04,400 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:55:04,401 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:55:04,401 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:55:04,401 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:55:04,401 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:55:04,401 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:55:04,401 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:55:04,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:55:04,402 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:55:04,402 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:55:04,402 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:55:04,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:55:04,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:55:04,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:55:04,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:55:04,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:55:04,405 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:55:04,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:55:04,405 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:55:04,406 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:55:04,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:55:04,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:55:04,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:55:04,406 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:55:04,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:55:04,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:55:04,408 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:55:04,409 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:55:04,409 INFO L133 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-01-14 02:55:04,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:55:04,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:55:04,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:55:04,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:55:04,470 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:55:04,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:04,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a2e1ff/4bd7f5a621bb4f0dac998492483412a6/FLAGe4bfb2ffe [2019-01-14 02:55:04,944 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:55:04,945 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:04,953 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a2e1ff/4bd7f5a621bb4f0dac998492483412a6/FLAGe4bfb2ffe [2019-01-14 02:55:05,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a2e1ff/4bd7f5a621bb4f0dac998492483412a6 [2019-01-14 02:55:05,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:55:05,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:55:05,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:05,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:55:05,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:55:05,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05, skipping insertion in model container [2019-01-14 02:55:05,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:55:05,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:55:05,642 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:05,655 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:55:05,689 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:05,708 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:55:05,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05 WrapperNode [2019-01-14 02:55:05,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:05,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:05,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:55:05,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:55:05,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:05,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:55:05,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:55:05,758 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:55:05,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (1/1) ... [2019-01-14 02:55:05,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:55:05,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:55:05,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:55:05,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:55:05,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (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-01-14 02:55:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:55:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:55:06,453 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:55:06,454 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:55:06,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:06 BoogieIcfgContainer [2019-01-14 02:55:06,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:55:06,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:55:06,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:55:06,460 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:55:06,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:06,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:55:05" (1/3) ... [2019-01-14 02:55:06,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@183b7f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:06, skipping insertion in model container [2019-01-14 02:55:06,462 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:06,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:05" (2/3) ... [2019-01-14 02:55:06,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@183b7f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:06, skipping insertion in model container [2019-01-14 02:55:06,463 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:06,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:06" (3/3) ... [2019-01-14 02:55:06,465 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:06,526 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:55:06,527 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:55:06,527 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:55:06,527 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:55:06,528 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:55:06,528 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:55:06,528 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:55:06,528 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:55:06,528 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:55:06,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-01-14 02:55:06,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-01-14 02:55:06,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:06,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:06,580 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:06,580 INFO L868 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-01-14 02:55:06,581 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:55:06,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2019-01-14 02:55:06,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-01-14 02:55:06,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:06,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:06,585 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:06,585 INFO L868 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-01-14 02:55:06,594 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-01-14 02:55:06,595 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-01-14 02:55:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:06,603 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:55:06,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:06,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2019-01-14 02:55:06,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:06,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:06,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:06,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:06,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:06,790 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:06,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:06,810 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-01-14 02:55:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:06,900 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2019-01-14 02:55:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:06,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 117 transitions. [2019-01-14 02:55:06,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-01-14 02:55:06,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 58 states and 92 transitions. [2019-01-14 02:55:06,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-01-14 02:55:06,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-14 02:55:06,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2019-01-14 02:55:06,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:06,924 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-01-14 02:55:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2019-01-14 02:55:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-14 02:55:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 02:55:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2019-01-14 02:55:06,958 INFO L729 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-01-14 02:55:06,958 INFO L609 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2019-01-14 02:55:06,959 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:55:06,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2019-01-14 02:55:06,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-01-14 02:55:06,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:06,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:06,962 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:06,962 INFO L868 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-01-14 02:55:06,962 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-01-14 02:55:06,962 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-01-14 02:55:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:06,963 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:55:06,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:06,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:06,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2019-01-14 02:55:06,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:07,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:07,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:07,042 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:07,043 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-01-14 02:55:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:07,144 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2019-01-14 02:55:07,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:07,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2019-01-14 02:55:07,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-01-14 02:55:07,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2019-01-14 02:55:07,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2019-01-14 02:55:07,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2019-01-14 02:55:07,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2019-01-14 02:55:07,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:07,157 INFO L706 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-01-14 02:55:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2019-01-14 02:55:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-14 02:55:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 02:55:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2019-01-14 02:55:07,170 INFO L729 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-01-14 02:55:07,170 INFO L609 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2019-01-14 02:55:07,170 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:55:07,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2019-01-14 02:55:07,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2019-01-14 02:55:07,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:07,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:07,173 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:07,173 INFO L868 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-01-14 02:55:07,173 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-01-14 02:55:07,174 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-01-14 02:55:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:55:07,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2019-01-14 02:55:07,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:07,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:07,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:07,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:07,244 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:07,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:07,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:07,245 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand 3 states. [2019-01-14 02:55:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:07,316 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2019-01-14 02:55:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:07,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2019-01-14 02:55:07,325 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-01-14 02:55:07,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2019-01-14 02:55:07,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2019-01-14 02:55:07,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2019-01-14 02:55:07,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2019-01-14 02:55:07,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:07,336 INFO L706 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-01-14 02:55:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2019-01-14 02:55:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-01-14 02:55:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-14 02:55:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2019-01-14 02:55:07,360 INFO L729 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-01-14 02:55:07,360 INFO L609 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2019-01-14 02:55:07,361 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:55:07,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2019-01-14 02:55:07,364 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2019-01-14 02:55:07,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:07,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:07,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:07,366 INFO L868 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-01-14 02:55:07,366 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-01-14 02:55:07,366 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-01-14 02:55:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:55:07,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2019-01-14 02:55:07,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:07,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:07,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:07,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:07,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:07,419 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand 3 states. [2019-01-14 02:55:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:07,515 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-01-14 02:55:07,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:07,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2019-01-14 02:55:07,521 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-01-14 02:55:07,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2019-01-14 02:55:07,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2019-01-14 02:55:07,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2019-01-14 02:55:07,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2019-01-14 02:55:07,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:07,529 INFO L706 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-01-14 02:55:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2019-01-14 02:55:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-01-14 02:55:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-14 02:55:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2019-01-14 02:55:07,553 INFO L729 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-01-14 02:55:07,553 INFO L609 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2019-01-14 02:55:07,553 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:55:07,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2019-01-14 02:55:07,559 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2019-01-14 02:55:07,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:07,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:07,563 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:07,564 INFO L868 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-01-14 02:55:07,564 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-01-14 02:55:07,564 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-01-14 02:55:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,564 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:55:07,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2019-01-14 02:55:07,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:07,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:07,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:07,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:07,638 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:07,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:07,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:07,639 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand 3 states. [2019-01-14 02:55:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:07,757 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2019-01-14 02:55:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:07,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2019-01-14 02:55:07,779 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-01-14 02:55:07,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2019-01-14 02:55:07,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2019-01-14 02:55:07,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2019-01-14 02:55:07,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2019-01-14 02:55:07,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:07,791 INFO L706 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-01-14 02:55:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2019-01-14 02:55:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2019-01-14 02:55:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-01-14 02:55:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2019-01-14 02:55:07,819 INFO L729 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-01-14 02:55:07,819 INFO L609 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2019-01-14 02:55:07,819 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:55:07,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2019-01-14 02:55:07,827 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2019-01-14 02:55:07,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:07,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:07,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:07,828 INFO L868 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-01-14 02:55:07,828 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-01-14 02:55:07,828 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-01-14 02:55:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:55:07,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2019-01-14 02:55:07,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:07,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:07,889 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:07,889 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand 3 states. [2019-01-14 02:55:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:07,952 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2019-01-14 02:55:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:07,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2019-01-14 02:55:07,978 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-01-14 02:55:07,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-01-14 02:55:07,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2019-01-14 02:55:07,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2019-01-14 02:55:07,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2019-01-14 02:55:08,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:08,001 INFO L706 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-01-14 02:55:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2019-01-14 02:55:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-01-14 02:55:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-01-14 02:55:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2019-01-14 02:55:08,048 INFO L729 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-01-14 02:55:08,048 INFO L609 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2019-01-14 02:55:08,048 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:55:08,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2019-01-14 02:55:08,062 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2019-01-14 02:55:08,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:08,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:08,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:08,063 INFO L868 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-01-14 02:55:08,063 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-01-14 02:55:08,065 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-01-14 02:55:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:55:08,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:08,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2019-01-14 02:55:08,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:08,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:08,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:08,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:08,133 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:08,134 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand 3 states. [2019-01-14 02:55:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:08,248 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2019-01-14 02:55:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:08,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2019-01-14 02:55:08,292 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-01-14 02:55:08,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-01-14 02:55:08,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2019-01-14 02:55:08,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2019-01-14 02:55:08,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2019-01-14 02:55:08,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:08,343 INFO L706 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-01-14 02:55:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2019-01-14 02:55:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2019-01-14 02:55:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2019-01-14 02:55:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2019-01-14 02:55:08,453 INFO L729 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-01-14 02:55:08,453 INFO L609 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2019-01-14 02:55:08,454 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:55:08,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2019-01-14 02:55:08,486 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2019-01-14 02:55:08,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:08,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:08,487 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:08,487 INFO L868 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-01-14 02:55:08,487 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-01-14 02:55:08,489 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-01-14 02:55:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-14 02:55:08,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2019-01-14 02:55:08,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:08,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:08,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:55:08,597 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:08,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:08,599 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2019-01-14 02:55:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:08,693 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2019-01-14 02:55:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:08,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2019-01-14 02:55:08,739 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-01-14 02:55:08,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-01-14 02:55:08,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2019-01-14 02:55:08,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2019-01-14 02:55:08,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2019-01-14 02:55:08,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:08,817 INFO L706 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-01-14 02:55:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2019-01-14 02:55:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2019-01-14 02:55:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-01-14 02:55:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2019-01-14 02:55:08,975 INFO L729 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-01-14 02:55:08,975 INFO L609 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2019-01-14 02:55:08,975 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:55:08,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2019-01-14 02:55:09,002 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2019-01-14 02:55:09,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:09,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:09,003 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:09,003 INFO L868 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-01-14 02:55:09,003 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-01-14 02:55:09,004 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-01-14 02:55:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-14 02:55:09,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2019-01-14 02:55:09,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:09,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1231517452, now seen corresponding path program 1 times [2019-01-14 02:55:09,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:09,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:09,246 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 02:55:09,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:55:09 BoogieIcfgContainer [2019-01-14 02:55:09,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:55:09,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:55:09,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:55:09,413 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:55:09,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:06" (3/4) ... [2019-01-14 02:55:09,417 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:55:09,501 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:55:09,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:55:09,502 INFO L168 Benchmark]: Toolchain (without parser) took 4165.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.3 MB in the beginning and 848.7 MB in the end (delta: 94.6 MB). Peak memory consumption was 223.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:09,503 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:09,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:09,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.00 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:09,506 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:09,506 INFO L168 Benchmark]: RCFGBuilder took 656.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:09,507 INFO L168 Benchmark]: BuchiAutomizer took 2956.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.7 MB in the end (delta: 242.3 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:09,510 INFO L168 Benchmark]: Witness Printer took 88.16 ms. Allocated memory is still 1.2 GB. Free memory is still 848.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:09,518 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.00 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 656.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2956.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.7 MB in the end (delta: 242.3 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. * Witness Printer took 88.16 ms. Allocated memory is still 1.2 GB. Free memory is still 848.7 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.8s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.5s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.4s 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.5s 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@6eee4c9a=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b2e3ff8=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d048873=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58affd6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@502cbb24=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f7d203e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@490d8451=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50bb1608=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52c7af30=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a6b9db5=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...