./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_7_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_7_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 ccd6d122756047ddb1225c106ac06a6748e14c22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:59,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:54:59,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:54:59,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:54:59,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:54:59,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:54:59,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:54:59,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:54:59,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:54:59,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:54:59,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:54:59,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:54:59,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:54:59,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:54:59,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:54:59,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:54:59,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:54:59,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:54:59,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:54:59,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:54:59,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:54:59,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:54:59,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:54:59,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:54:59,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:54:59,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:54:59,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:54:59,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:54:59,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:54:59,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:54:59,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:54:59,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:54:59,379 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:54:59,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:54:59,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:54:59,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:54:59,383 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:54:59,409 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:54:59,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:54:59,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:54:59,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:54:59,412 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:54:59,412 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:54:59,412 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:54:59,413 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:54:59,413 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:54:59,413 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:54:59,413 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:54:59,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:54:59,413 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:54:59,414 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:54:59,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:54:59,415 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:54:59,416 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:54:59,417 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:54:59,417 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:54:59,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:54:59,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:54:59,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:54:59,418 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:54:59,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:54:59,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:54:59,418 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:54:59,420 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:54:59,420 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-01-14 02:54:59,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:54:59,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:54:59,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:54:59,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:54:59,500 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:54:59,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:59,574 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ddab941/5ab3f1f2653a472b95d4e7767461e37c/FLAGea3a291a2 [2019-01-14 02:55:00,026 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:55:00,027 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:00,034 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ddab941/5ab3f1f2653a472b95d4e7767461e37c/FLAGea3a291a2 [2019-01-14 02:55:00,386 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ddab941/5ab3f1f2653a472b95d4e7767461e37c [2019-01-14 02:55:00,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:55:00,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:55:00,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:00,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:55:00,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:55:00,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104d3319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00, skipping insertion in model container [2019-01-14 02:55:00,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:55:00,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:55:00,694 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:00,699 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:55:00,723 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:00,738 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:55:00,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00 WrapperNode [2019-01-14 02:55:00,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:00,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:00,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:55:00,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:55:00,752 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:00" (1/1) ... [2019-01-14 02:55:00,758 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:00" (1/1) ... [2019-01-14 02:55:00,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:00,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:55:00,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:55:00,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:55:00,794 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:00" (1/1) ... [2019-01-14 02:55:00,795 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:00" (1/1) ... [2019-01-14 02:55:00,796 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:00" (1/1) ... [2019-01-14 02:55:00,800 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:00" (1/1) ... [2019-01-14 02:55:00,804 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:00" (1/1) ... [2019-01-14 02:55:00,815 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:00" (1/1) ... [2019-01-14 02:55:00,817 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:00" (1/1) ... [2019-01-14 02:55:00,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:55:00,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:55:00,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:55:00,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:55:00,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (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:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:55:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:55:01,407 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:55:01,408 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:55:01,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:01 BoogieIcfgContainer [2019-01-14 02:55:01,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:55:01,410 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:55:01,411 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:55:01,415 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:55:01,416 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:55:00" (1/3) ... [2019-01-14 02:55:01,417 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e07670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:01, skipping insertion in model container [2019-01-14 02:55:01,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (2/3) ... [2019-01-14 02:55:01,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e07670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:01, skipping insertion in model container [2019-01-14 02:55:01,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:01" (3/3) ... [2019-01-14 02:55:01,422 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:01,480 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:55:01,481 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:55:01,481 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:55:01,481 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:55:01,482 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:55:01,482 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:55:01,482 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:55:01,482 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:55:01,482 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:55:01,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-01-14 02:55:01,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 02:55:01,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,531 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,532 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,532 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:55:01,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2019-01-14 02:55:01,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-14 02:55:01,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,536 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,536 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,544 INFO L794 eck$LassoCheckResult]: Stem: 28#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_~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_~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;havoc main_~cond~0; 18#L111-1true [2019-01-14 02:55:01,545 INFO L796 eck$LassoCheckResult]: Loop: 18#L111-1true assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 11#L32true 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; 8#L51true assume 0 != main_~p1~0;main_~lk1~0 := 1; 6#L51-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 29#L55-1true assume !(0 != main_~p3~0); 20#L59-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 24#L63-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 15#L67-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 4#L71-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L75-1true assume !(0 != main_~p1~0); 21#L81-1true assume !(0 != main_~p2~0); 27#L86-1true assume !(0 != main_~p3~0); 3#L91-1true assume !(0 != main_~p4~0); 10#L96-1true assume !(0 != main_~p5~0); 31#L101-1true assume !(0 != main_~p6~0); 9#L106-1true assume !(0 != main_~p7~0); 18#L111-1true [2019-01-14 02:55:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:55:01,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1253571452, now seen corresponding path program 1 times [2019-01-14 02:55:01,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:01,739 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:01,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:01,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:01,745 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:01,760 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-01-14 02:55:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:01,807 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2019-01-14 02:55:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:01,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 93 transitions. [2019-01-14 02:55:01,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 02:55:01,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 46 states and 72 transitions. [2019-01-14 02:55:01,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-14 02:55:01,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-14 02:55:01,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 72 transitions. [2019-01-14 02:55:01,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:01,826 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-01-14 02:55:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 72 transitions. [2019-01-14 02:55:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-14 02:55:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:55:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2019-01-14 02:55:01,862 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-01-14 02:55:01,862 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2019-01-14 02:55:01,863 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:55:01,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 72 transitions. [2019-01-14 02:55:01,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 02:55:01,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,867 INFO L794 eck$LassoCheckResult]: Stem: 119#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_~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_~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;havoc main_~cond~0; 120#L111-1 [2019-01-14 02:55:01,867 INFO L796 eck$LassoCheckResult]: Loop: 120#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 128#L32 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; 127#L51 assume !(0 != main_~p1~0); 108#L51-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 109#L55-1 assume !(0 != main_~p3~0); 97#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 98#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 122#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 106#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 107#L75-1 assume !(0 != main_~p1~0); 123#L81-1 assume !(0 != main_~p2~0); 138#L86-1 assume !(0 != main_~p3~0); 136#L91-1 assume !(0 != main_~p4~0); 134#L96-1 assume !(0 != main_~p5~0); 132#L101-1 assume !(0 != main_~p6~0); 130#L106-1 assume !(0 != main_~p7~0); 120#L111-1 [2019-01-14 02:55:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:55:01,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2030278594, now seen corresponding path program 1 times [2019-01-14 02:55:01,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:01,931 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:01,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:01,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:01,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:01,932 INFO L87 Difference]: Start difference. First operand 46 states and 72 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-01-14 02:55:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:01,998 INFO L93 Difference]: Finished difference Result 89 states and 137 transitions. [2019-01-14 02:55:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:01,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 137 transitions. [2019-01-14 02:55:02,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2019-01-14 02:55:02,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 137 transitions. [2019-01-14 02:55:02,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-01-14 02:55:02,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-01-14 02:55:02,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 137 transitions. [2019-01-14 02:55:02,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,007 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-01-14 02:55:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 137 transitions. [2019-01-14 02:55:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-14 02:55:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 02:55:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2019-01-14 02:55:02,019 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-01-14 02:55:02,019 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2019-01-14 02:55:02,020 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:55:02,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 137 transitions. [2019-01-14 02:55:02,022 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2019-01-14 02:55:02,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,024 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,024 INFO L794 eck$LassoCheckResult]: Stem: 258#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_~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_~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;havoc main_~cond~0; 243#L111-1 [2019-01-14 02:55:02,024 INFO L796 eck$LassoCheckResult]: Loop: 243#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 259#L32 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; 260#L51 assume !(0 != main_~p1~0); 264#L51-2 assume !(0 != main_~p2~0); 262#L55-1 assume !(0 != main_~p3~0); 235#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 236#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 254#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 302#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 301#L75-1 assume !(0 != main_~p1~0); 299#L81-1 assume !(0 != main_~p2~0); 298#L86-1 assume !(0 != main_~p3~0); 237#L91-1 assume !(0 != main_~p4~0); 238#L96-1 assume !(0 != main_~p5~0); 247#L101-1 assume !(0 != main_~p6~0); 255#L106-1 assume !(0 != main_~p7~0); 243#L111-1 [2019-01-14 02:55:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:55:02,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1443472580, now seen corresponding path program 1 times [2019-01-14 02:55:02,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,080 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:02,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,081 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,082 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-01-14 02:55:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,114 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2019-01-14 02:55:02,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 261 transitions. [2019-01-14 02:55:02,119 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2019-01-14 02:55:02,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 261 transitions. [2019-01-14 02:55:02,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-01-14 02:55:02,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-01-14 02:55:02,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 261 transitions. [2019-01-14 02:55:02,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,124 INFO L706 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-01-14 02:55:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 261 transitions. [2019-01-14 02:55:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-14 02:55:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-14 02:55:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2019-01-14 02:55:02,141 INFO L729 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-01-14 02:55:02,141 INFO L609 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-01-14 02:55:02,141 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:55:02,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 261 transitions. [2019-01-14 02:55:02,143 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2019-01-14 02:55:02,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,144 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,144 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,145 INFO L794 eck$LassoCheckResult]: Stem: 525#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_~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_~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;havoc main_~cond~0; 526#L111-1 [2019-01-14 02:55:02,145 INFO L796 eck$LassoCheckResult]: Loop: 526#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 586#L32 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; 540#L51 assume !(0 != main_~p1~0); 541#L51-2 assume !(0 != main_~p2~0); 619#L55-1 assume !(0 != main_~p3~0); 618#L59-1 assume !(0 != main_~p4~0); 576#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 577#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 570#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 571#L75-1 assume !(0 != main_~p1~0); 606#L81-1 assume !(0 != main_~p2~0); 603#L86-1 assume !(0 != main_~p3~0); 598#L91-1 assume !(0 != main_~p4~0); 596#L96-1 assume !(0 != main_~p5~0); 593#L101-1 assume !(0 != main_~p6~0); 588#L106-1 assume !(0 != main_~p7~0); 526#L111-1 [2019-01-14 02:55:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:55:02,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2144537158, now seen corresponding path program 1 times [2019-01-14 02:55:02,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,183 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:02,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,185 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. cyclomatic complexity: 96 Second operand 3 states. [2019-01-14 02:55:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,234 INFO L93 Difference]: Finished difference Result 337 states and 497 transitions. [2019-01-14 02:55:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 497 transitions. [2019-01-14 02:55:02,241 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2019-01-14 02:55:02,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 497 transitions. [2019-01-14 02:55:02,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2019-01-14 02:55:02,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2019-01-14 02:55:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 497 transitions. [2019-01-14 02:55:02,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,253 INFO L706 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-01-14 02:55:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 497 transitions. [2019-01-14 02:55:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-01-14 02:55:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-14 02:55:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 497 transitions. [2019-01-14 02:55:02,295 INFO L729 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-01-14 02:55:02,295 INFO L609 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2019-01-14 02:55:02,295 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:55:02,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 337 states and 497 transitions. [2019-01-14 02:55:02,299 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2019-01-14 02:55:02,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,300 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,300 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,300 INFO L794 eck$LassoCheckResult]: Stem: 1044#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_~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_~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;havoc main_~cond~0; 1045#L111-1 [2019-01-14 02:55:02,301 INFO L796 eck$LassoCheckResult]: Loop: 1045#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 1190#L32 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; 1197#L51 assume !(0 != main_~p1~0); 1195#L51-2 assume !(0 != main_~p2~0); 1133#L55-1 assume !(0 != main_~p3~0); 1134#L59-1 assume !(0 != main_~p4~0); 1119#L63-1 assume !(0 != main_~p5~0); 1121#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1105#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1106#L75-1 assume !(0 != main_~p1~0); 1187#L81-1 assume !(0 != main_~p2~0); 1189#L86-1 assume !(0 != main_~p3~0); 1210#L91-1 assume !(0 != main_~p4~0); 1209#L96-1 assume !(0 != main_~p5~0); 1208#L101-1 assume !(0 != main_~p6~0); 1203#L106-1 assume !(0 != main_~p7~0); 1045#L111-1 [2019-01-14 02:55:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:55:02,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1751510148, now seen corresponding path program 1 times [2019-01-14 02:55:02,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,368 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:02,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,370 INFO L87 Difference]: Start difference. First operand 337 states and 497 transitions. cyclomatic complexity: 176 Second operand 3 states. [2019-01-14 02:55:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,445 INFO L93 Difference]: Finished difference Result 657 states and 945 transitions. [2019-01-14 02:55:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 945 transitions. [2019-01-14 02:55:02,458 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2019-01-14 02:55:02,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 657 states and 945 transitions. [2019-01-14 02:55:02,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2019-01-14 02:55:02,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 657 [2019-01-14 02:55:02,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 657 states and 945 transitions. [2019-01-14 02:55:02,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,469 INFO L706 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-01-14 02:55:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states and 945 transitions. [2019-01-14 02:55:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-01-14 02:55:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-01-14 02:55:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 945 transitions. [2019-01-14 02:55:02,498 INFO L729 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-01-14 02:55:02,499 INFO L609 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2019-01-14 02:55:02,499 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:55:02,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 945 transitions. [2019-01-14 02:55:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2019-01-14 02:55:02,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,506 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,507 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,507 INFO L794 eck$LassoCheckResult]: Stem: 2042#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_~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_~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;havoc main_~cond~0; 2043#L111-1 [2019-01-14 02:55:02,507 INFO L796 eck$LassoCheckResult]: Loop: 2043#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 2126#L32 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; 2122#L51 assume !(0 != main_~p1~0); 2118#L51-2 assume !(0 != main_~p2~0); 2116#L55-1 assume !(0 != main_~p3~0); 2114#L59-1 assume !(0 != main_~p4~0); 2110#L63-1 assume !(0 != main_~p5~0); 2106#L67-1 assume !(0 != main_~p6~0); 2104#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2100#L75-1 assume !(0 != main_~p1~0); 2096#L81-1 assume !(0 != main_~p2~0); 2093#L86-1 assume !(0 != main_~p3~0); 2089#L91-1 assume !(0 != main_~p4~0); 2090#L96-1 assume !(0 != main_~p5~0); 2133#L101-1 assume !(0 != main_~p6~0); 2130#L106-1 assume !(0 != main_~p7~0); 2043#L111-1 [2019-01-14 02:55:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:55:02,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1863398778, now seen corresponding path program 1 times [2019-01-14 02:55:02,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,582 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:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:55:02,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,584 INFO L87 Difference]: Start difference. First operand 657 states and 945 transitions. cyclomatic complexity: 320 Second operand 3 states. [2019-01-14 02:55:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,695 INFO L93 Difference]: Finished difference Result 1281 states and 1793 transitions. [2019-01-14 02:55:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1281 states and 1793 transitions. [2019-01-14 02:55:02,709 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2019-01-14 02:55:02,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1281 states to 1281 states and 1793 transitions. [2019-01-14 02:55:02,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1281 [2019-01-14 02:55:02,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2019-01-14 02:55:02,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 1793 transitions. [2019-01-14 02:55:02,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,725 INFO L706 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-01-14 02:55:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 1793 transitions. [2019-01-14 02:55:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1281. [2019-01-14 02:55:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-01-14 02:55:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1793 transitions. [2019-01-14 02:55:02,755 INFO L729 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-01-14 02:55:02,755 INFO L609 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2019-01-14 02:55:02,755 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:55:02,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1281 states and 1793 transitions. [2019-01-14 02:55:02,766 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2019-01-14 02:55:02,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,767 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,767 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,767 INFO L794 eck$LassoCheckResult]: Stem: 3988#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_~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_~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;havoc main_~cond~0; 3989#L111-1 [2019-01-14 02:55:02,767 INFO L796 eck$LassoCheckResult]: Loop: 3989#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 4197#L32 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; 4193#L51 assume !(0 != main_~p1~0); 4190#L51-2 assume !(0 != main_~p2~0); 4187#L55-1 assume !(0 != main_~p3~0); 4185#L59-1 assume !(0 != main_~p4~0); 4183#L63-1 assume !(0 != main_~p5~0); 4177#L67-1 assume !(0 != main_~p6~0); 4178#L71-1 assume !(0 != main_~p7~0); 4212#L75-1 assume !(0 != main_~p1~0); 4363#L81-1 assume !(0 != main_~p2~0); 4360#L86-1 assume !(0 != main_~p3~0); 4137#L91-1 assume !(0 != main_~p4~0); 4138#L96-1 assume !(0 != main_~p5~0); 4103#L101-1 assume !(0 != main_~p6~0); 4104#L106-1 assume !(0 != main_~p7~0); 3989#L111-1 [2019-01-14 02:55:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,768 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:55:02,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1622221892, now seen corresponding path program 1 times [2019-01-14 02:55:02,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 625149539, now seen corresponding path program 1 times [2019-01-14 02:55:02,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,119 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 02:55:03,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:55:03 BoogieIcfgContainer [2019-01-14 02:55:03,152 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:55:03,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:55:03,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:55:03,153 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:55:03,154 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:01" (3/4) ... [2019-01-14 02:55:03,157 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:55:03,208 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:55:03,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:55:03,209 INFO L168 Benchmark]: Toolchain (without parser) took 2818.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -73.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,210 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:03,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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:03,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.66 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:03,212 INFO L168 Benchmark]: Boogie Preprocessor took 36.89 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 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:03,212 INFO L168 Benchmark]: RCFGBuilder took 589.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,213 INFO L168 Benchmark]: BuchiAutomizer took 1742.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:03,214 INFO L168 Benchmark]: Witness Printer took 55.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:03,218 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 41.66 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.89 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 589.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1742.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. * Witness Printer took 55.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1281 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 179 SDslu, 202 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 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: 30]: 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@74e88b68=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5de9a738=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b1945df=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ea0a5a9=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@642820b2=0, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c2f5725=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f23bde=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f16ba9d=0, cond=1, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: 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; [L28] int cond; Loop: [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...