./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_13_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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 22:12:01,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:12:01,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:12:01,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:12:01,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:12:01,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:12:01,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:12:01,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:12:01,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:12:01,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:12:01,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:12:01,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:12:01,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:12:01,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:12:01,435 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:12:01,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:12:01,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:12:01,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:12:01,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:12:01,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:12:01,445 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:12:01,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:12:01,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:12:01,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:12:01,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:12:01,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:12:01,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:12:01,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:12:01,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:12:01,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:12:01,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:12:01,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:12:01,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:12:01,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:12:01,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:12:01,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:12:01,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:12:01,478 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:12:01,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:12:01,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:12:01,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:12:01,480 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:12:01,480 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:12:01,480 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:12:01,481 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:12:01,481 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:12:01,481 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:12:01,481 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:12:01,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:12:01,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:12:01,483 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:12:01,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:12:01,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:12:01,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:12:01,484 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:12:01,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:12:01,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:12:01,485 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:12:01,486 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:12:01,486 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-01-01 22:12:01,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:12:01,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:12:01,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:12:01,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:12:01,540 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:12:01,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:01,594 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5322be15/f679a8e61b3d48d2a603e23734873fc0/FLAG463f7e4df [2019-01-01 22:12:02,099 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:12:02,100 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:02,109 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5322be15/f679a8e61b3d48d2a603e23734873fc0/FLAG463f7e4df [2019-01-01 22:12:02,459 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5322be15/f679a8e61b3d48d2a603e23734873fc0 [2019-01-01 22:12:02,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:12:02,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:12:02,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:12:02,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:12:02,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:12:02,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179a4755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02, skipping insertion in model container [2019-01-01 22:12:02,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:12:02,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:12:02,772 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:12:02,778 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:12:02,813 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:12:02,834 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:12:02,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02 WrapperNode [2019-01-01 22:12:02,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:12:02,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:12:02,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:12:02,836 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:12:02,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:12:02,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:12:02,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:12:02,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:12:02,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (1/1) ... [2019-01-01 22:12:02,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:12:02,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:12:02,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:12:02,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:12:02,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (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-01 22:12:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:12:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:12:03,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:12:03,650 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:12:03,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:12:03 BoogieIcfgContainer [2019-01-01 22:12:03,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:12:03,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:12:03,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:12:03,657 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:12:03,658 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:03,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:12:02" (1/3) ... [2019-01-01 22:12:03,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e3805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:12:03, skipping insertion in model container [2019-01-01 22:12:03,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:03,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:02" (2/3) ... [2019-01-01 22:12:03,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e3805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:12:03, skipping insertion in model container [2019-01-01 22:12:03,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:03,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:12:03" (3/3) ... [2019-01-01 22:12:03,663 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:03,726 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:12:03,727 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:12:03,727 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:12:03,727 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:12:03,728 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:12:03,728 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:12:03,728 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:12:03,729 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:12:03,729 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:12:03,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-01-01 22:12:03,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-01-01 22:12:03,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:03,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:03,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:03,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:03,783 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:12:03,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-01-01 22:12:03,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-01-01 22:12:03,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:03,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:03,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:03,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:03,804 INFO L794 eck$LassoCheckResult]: Stem: 40#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 23#L195-1true [2019-01-01 22:12:03,806 INFO L796 eck$LassoCheckResult]: Loop: 23#L195-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 33#L50true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 30#L81true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L81-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 37#L85-1true assume !(0 != main_~p3~0); 24#L89-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L93-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 41#L97-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 47#L101-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 34#L105-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 20#L109-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L113-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 13#L117-1true assume !(0 != main_~p11~0); 44#L121-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 31#L125-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 16#L129-1true assume !(0 != main_~p1~0); 6#L135-1true assume !(0 != main_~p2~0); 17#L140-1true assume !(0 != main_~p3~0); 28#L145-1true assume !(0 != main_~p4~0); 38#L150-1true assume !(0 != main_~p5~0); 3#L155-1true assume !(0 != main_~p6~0); 14#L160-1true assume !(0 != main_~p7~0); 48#L165-1true assume !(0 != main_~p8~0); 12#L170-1true assume !(0 != main_~p9~0); 26#L175-1true assume !(0 != main_~p10~0); 36#L180-1true assume !(0 != main_~p11~0); 45#L185-1true assume !(0 != main_~p12~0); 10#L190-1true assume !(0 != main_~p13~0); 23#L195-1true [2019-01-01 22:12:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:12:03,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:03,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash -391818443, now seen corresponding path program 1 times [2019-01-01 22:12:03,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:04,047 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-01 22:12:04,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:04,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:04,055 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:04,076 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-01 22:12:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:04,188 INFO L93 Difference]: Finished difference Result 92 states and 165 transitions. [2019-01-01 22:12:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:04,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 165 transitions. [2019-01-01 22:12:04,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 22:12:04,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 82 states and 132 transitions. [2019-01-01 22:12:04,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2019-01-01 22:12:04,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2019-01-01 22:12:04,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 132 transitions. [2019-01-01 22:12:04,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:04,207 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-01-01 22:12:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 132 transitions. [2019-01-01 22:12:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-01 22:12:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-01 22:12:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2019-01-01 22:12:04,245 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-01-01 22:12:04,245 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-01-01 22:12:04,245 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:12:04,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 132 transitions. [2019-01-01 22:12:04,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 22:12:04,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:04,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:04,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:04,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:04,249 INFO L794 eck$LassoCheckResult]: Stem: 198#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 199#L195-1 [2019-01-01 22:12:04,250 INFO L796 eck$LassoCheckResult]: Loop: 199#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 191#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 192#L81 assume !(0 != main_~p1~0); 205#L81-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 229#L85-1 assume !(0 != main_~p3~0); 228#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 227#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 226#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 225#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 193#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 194#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 224#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 223#L117-1 assume !(0 != main_~p11~0); 202#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 203#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 222#L129-1 assume !(0 != main_~p1~0); 155#L135-1 assume !(0 != main_~p2~0); 156#L140-1 assume !(0 != main_~p3~0); 186#L145-1 assume !(0 != main_~p4~0); 179#L150-1 assume !(0 != main_~p5~0); 150#L155-1 assume !(0 != main_~p6~0); 152#L160-1 assume !(0 != main_~p7~0); 159#L165-1 assume !(0 != main_~p8~0); 176#L170-1 assume !(0 != main_~p9~0); 211#L175-1 assume !(0 != main_~p10~0); 196#L180-1 assume !(0 != main_~p11~0); 149#L185-1 assume !(0 != main_~p12~0); 207#L190-1 assume !(0 != main_~p13~0); 199#L195-1 [2019-01-01 22:12:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 22:12:04,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash -329778829, now seen corresponding path program 1 times [2019-01-01 22:12:04,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:04,350 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-01 22:12:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:04,351 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:04,352 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-01-01 22:12:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:04,444 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2019-01-01 22:12:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:04,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 257 transitions. [2019-01-01 22:12:04,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-01-01 22:12:04,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 161 states and 257 transitions. [2019-01-01 22:12:04,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2019-01-01 22:12:04,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2019-01-01 22:12:04,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 257 transitions. [2019-01-01 22:12:04,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:04,454 INFO L705 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-01-01 22:12:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 257 transitions. [2019-01-01 22:12:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-01 22:12:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-01 22:12:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 257 transitions. [2019-01-01 22:12:04,469 INFO L728 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-01-01 22:12:04,469 INFO L608 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-01-01 22:12:04,469 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:12:04,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 257 transitions. [2019-01-01 22:12:04,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-01-01 22:12:04,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:04,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:04,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:04,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:04,474 INFO L794 eck$LassoCheckResult]: Stem: 443#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 444#L195-1 [2019-01-01 22:12:04,474 INFO L796 eck$LassoCheckResult]: Loop: 444#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 456#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 453#L81 assume !(0 != main_~p1~0); 454#L81-2 assume !(0 != main_~p2~0); 517#L85-1 assume !(0 != main_~p3~0); 516#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 515#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 514#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 513#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 512#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 511#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 510#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 509#L117-1 assume !(0 != main_~p11~0); 508#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 507#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 505#L129-1 assume !(0 != main_~p1~0); 503#L135-1 assume !(0 != main_~p2~0); 501#L140-1 assume !(0 != main_~p3~0); 497#L145-1 assume !(0 != main_~p4~0); 493#L150-1 assume !(0 != main_~p5~0); 489#L155-1 assume !(0 != main_~p6~0); 485#L160-1 assume !(0 != main_~p7~0); 481#L165-1 assume !(0 != main_~p8~0); 477#L170-1 assume !(0 != main_~p9~0); 473#L175-1 assume !(0 != main_~p10~0); 469#L180-1 assume !(0 != main_~p11~0); 464#L185-1 assume !(0 != main_~p12~0); 461#L190-1 assume !(0 != main_~p13~0); 444#L195-1 [2019-01-01 22:12:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 22:12:04,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash -189230219, now seen corresponding path program 1 times [2019-01-01 22:12:04,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:04,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:04,555 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-01 22:12:04,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:04,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:04,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:04,557 INFO L87 Difference]: Start difference. First operand 161 states and 257 transitions. cyclomatic complexity: 100 Second operand 3 states. [2019-01-01 22:12:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:04,628 INFO L93 Difference]: Finished difference Result 317 states and 501 transitions. [2019-01-01 22:12:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:04,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 501 transitions. [2019-01-01 22:12:04,635 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-01-01 22:12:04,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 501 transitions. [2019-01-01 22:12:04,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2019-01-01 22:12:04,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2019-01-01 22:12:04,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 501 transitions. [2019-01-01 22:12:04,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:04,643 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-01-01 22:12:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 501 transitions. [2019-01-01 22:12:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-01-01 22:12:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-01 22:12:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2019-01-01 22:12:04,669 INFO L728 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-01-01 22:12:04,669 INFO L608 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-01-01 22:12:04,669 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:12:04,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 501 transitions. [2019-01-01 22:12:04,673 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-01-01 22:12:04,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:04,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:04,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:04,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:04,674 INFO L794 eck$LassoCheckResult]: Stem: 929#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 930#L195-1 [2019-01-01 22:12:04,675 INFO L796 eck$LassoCheckResult]: Loop: 930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 975#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 973#L81 assume !(0 != main_~p1~0); 969#L81-2 assume !(0 != main_~p2~0); 967#L85-1 assume !(0 != main_~p3~0); 964#L89-1 assume !(0 != main_~p4~0); 962#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 960#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 958#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 954#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 952#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 950#L117-1 assume !(0 != main_~p11~0); 948#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 946#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 943#L129-1 assume !(0 != main_~p1~0); 944#L135-1 assume !(0 != main_~p2~0); 1019#L140-1 assume !(0 != main_~p3~0); 1014#L145-1 assume !(0 != main_~p4~0); 1011#L150-1 assume !(0 != main_~p5~0); 1007#L155-1 assume !(0 != main_~p6~0); 1003#L160-1 assume !(0 != main_~p7~0); 999#L165-1 assume !(0 != main_~p8~0); 995#L170-1 assume !(0 != main_~p9~0); 991#L175-1 assume !(0 != main_~p10~0); 987#L180-1 assume !(0 != main_~p11~0); 982#L185-1 assume !(0 != main_~p12~0); 979#L190-1 assume !(0 != main_~p13~0); 930#L195-1 [2019-01-01 22:12:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 22:12:04,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1994668553, now seen corresponding path program 1 times [2019-01-01 22:12:04,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:04,770 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-01 22:12:04,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:04,771 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:04,772 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. cyclomatic complexity: 192 Second operand 3 states. [2019-01-01 22:12:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:04,876 INFO L93 Difference]: Finished difference Result 625 states and 977 transitions. [2019-01-01 22:12:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:04,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 625 states and 977 transitions. [2019-01-01 22:12:04,885 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-01-01 22:12:04,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 625 states to 625 states and 977 transitions. [2019-01-01 22:12:04,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2019-01-01 22:12:04,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 625 [2019-01-01 22:12:04,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 625 states and 977 transitions. [2019-01-01 22:12:04,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:04,900 INFO L705 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-01-01 22:12:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states and 977 transitions. [2019-01-01 22:12:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-01-01 22:12:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-01-01 22:12:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-01-01 22:12:04,953 INFO L728 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-01-01 22:12:04,956 INFO L608 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-01-01 22:12:04,956 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:12:04,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 625 states and 977 transitions. [2019-01-01 22:12:04,961 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-01-01 22:12:04,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:04,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:04,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:04,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:04,963 INFO L794 eck$LassoCheckResult]: Stem: 1873#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 1874#L195-1 [2019-01-01 22:12:04,964 INFO L796 eck$LassoCheckResult]: Loop: 1874#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 2094#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 2093#L81 assume !(0 != main_~p1~0); 2090#L81-2 assume !(0 != main_~p2~0); 2091#L85-1 assume !(0 != main_~p3~0); 2166#L89-1 assume !(0 != main_~p4~0); 2167#L93-1 assume !(0 != main_~p5~0); 2172#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2147#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2146#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2145#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2143#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2142#L117-1 assume !(0 != main_~p11~0); 2139#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2136#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2132#L129-1 assume !(0 != main_~p1~0); 2129#L135-1 assume !(0 != main_~p2~0); 2126#L140-1 assume !(0 != main_~p3~0); 2122#L145-1 assume !(0 != main_~p4~0); 2118#L150-1 assume !(0 != main_~p5~0); 2115#L155-1 assume !(0 != main_~p6~0); 2111#L160-1 assume !(0 != main_~p7~0); 2108#L165-1 assume !(0 != main_~p8~0); 2105#L170-1 assume !(0 != main_~p9~0); 2102#L175-1 assume !(0 != main_~p10~0); 2100#L180-1 assume !(0 != main_~p11~0); 2097#L185-1 assume !(0 != main_~p12~0); 2096#L190-1 assume !(0 != main_~p13~0); 1874#L195-1 [2019-01-01 22:12:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-01 22:12:04,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1775813835, now seen corresponding path program 1 times [2019-01-01 22:12:04,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:04,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:04,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:04,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:05,053 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-01 22:12:05,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:05,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:05,055 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:05,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:05,056 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. cyclomatic complexity: 368 Second operand 3 states. [2019-01-01 22:12:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:05,164 INFO L93 Difference]: Finished difference Result 1233 states and 1905 transitions. [2019-01-01 22:12:05,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:05,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1233 states and 1905 transitions. [2019-01-01 22:12:05,193 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-01-01 22:12:05,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-01-01 22:12:05,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1233 [2019-01-01 22:12:05,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1233 [2019-01-01 22:12:05,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1233 states and 1905 transitions. [2019-01-01 22:12:05,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:05,210 INFO L705 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-01-01 22:12:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states and 1905 transitions. [2019-01-01 22:12:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2019-01-01 22:12:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-01-01 22:12:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-01-01 22:12:05,244 INFO L728 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-01-01 22:12:05,244 INFO L608 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-01-01 22:12:05,244 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:12:05,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1233 states and 1905 transitions. [2019-01-01 22:12:05,254 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-01-01 22:12:05,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:05,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:05,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:05,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:05,256 INFO L794 eck$LassoCheckResult]: Stem: 3742#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 3743#L195-1 [2019-01-01 22:12:05,256 INFO L796 eck$LassoCheckResult]: Loop: 3743#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 3984#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3980#L81 assume !(0 != main_~p1~0); 3975#L81-2 assume !(0 != main_~p2~0); 3973#L85-1 assume !(0 != main_~p3~0); 3969#L89-1 assume !(0 != main_~p4~0); 3933#L93-1 assume !(0 != main_~p5~0); 3935#L97-1 assume !(0 != main_~p6~0); 3957#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3955#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3954#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3953#L117-1 assume !(0 != main_~p11~0); 3952#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3951#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3949#L129-1 assume !(0 != main_~p1~0); 3950#L135-1 assume !(0 != main_~p2~0); 4027#L140-1 assume !(0 != main_~p3~0); 4023#L145-1 assume !(0 != main_~p4~0); 4021#L150-1 assume !(0 != main_~p5~0); 4017#L155-1 assume !(0 != main_~p6~0); 4014#L160-1 assume !(0 != main_~p7~0); 4010#L165-1 assume !(0 != main_~p8~0); 4006#L170-1 assume !(0 != main_~p9~0); 4002#L175-1 assume !(0 != main_~p10~0); 4000#L180-1 assume !(0 != main_~p11~0); 3994#L185-1 assume !(0 != main_~p12~0); 3990#L190-1 assume !(0 != main_~p13~0); 3743#L195-1 [2019-01-01 22:12:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-01 22:12:05,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:05,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:05,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1353112009, now seen corresponding path program 1 times [2019-01-01 22:12:05,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:05,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:05,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:05,328 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-01 22:12:05,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:05,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:05,329 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:05,330 INFO L87 Difference]: Start difference. First operand 1233 states and 1905 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-01-01 22:12:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:05,431 INFO L93 Difference]: Finished difference Result 2433 states and 3713 transitions. [2019-01-01 22:12:05,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:05,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2433 states and 3713 transitions. [2019-01-01 22:12:05,458 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-01-01 22:12:05,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-01-01 22:12:05,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2433 [2019-01-01 22:12:05,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2433 [2019-01-01 22:12:05,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2433 states and 3713 transitions. [2019-01-01 22:12:05,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:05,486 INFO L705 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-01-01 22:12:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states and 3713 transitions. [2019-01-01 22:12:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-01-01 22:12:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-01-01 22:12:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-01-01 22:12:05,549 INFO L728 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-01-01 22:12:05,549 INFO L608 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-01-01 22:12:05,549 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:12:05,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2433 states and 3713 transitions. [2019-01-01 22:12:05,566 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-01-01 22:12:05,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:05,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:05,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:05,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:05,569 INFO L794 eck$LassoCheckResult]: Stem: 7415#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 7416#L195-1 [2019-01-01 22:12:05,569 INFO L796 eck$LassoCheckResult]: Loop: 7416#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 8061#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 8059#L81 assume !(0 != main_~p1~0); 8057#L81-2 assume !(0 != main_~p2~0); 8056#L85-1 assume !(0 != main_~p3~0); 8052#L89-1 assume !(0 != main_~p4~0); 8048#L93-1 assume !(0 != main_~p5~0); 8046#L97-1 assume !(0 != main_~p6~0); 7726#L101-1 assume !(0 != main_~p7~0); 7727#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8041#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8040#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8039#L117-1 assume !(0 != main_~p11~0); 8038#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8037#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8036#L129-1 assume !(0 != main_~p1~0); 7915#L135-1 assume !(0 != main_~p2~0); 7817#L140-1 assume !(0 != main_~p3~0); 7816#L145-1 assume !(0 != main_~p4~0); 7912#L150-1 assume !(0 != main_~p5~0); 7910#L155-1 assume !(0 != main_~p6~0); 7911#L160-1 assume !(0 != main_~p7~0); 8227#L165-1 assume !(0 != main_~p8~0); 8223#L170-1 assume !(0 != main_~p9~0); 8219#L175-1 assume !(0 != main_~p10~0); 8215#L180-1 assume !(0 != main_~p11~0); 8210#L185-1 assume !(0 != main_~p12~0); 8208#L190-1 assume !(0 != main_~p13~0); 7416#L195-1 [2019-01-01 22:12:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-01 22:12:05,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2124206837, now seen corresponding path program 1 times [2019-01-01 22:12:05,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:05,657 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-01 22:12:05,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:05,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:05,657 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:05,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:05,658 INFO L87 Difference]: Start difference. First operand 2433 states and 3713 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2019-01-01 22:12:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:05,779 INFO L93 Difference]: Finished difference Result 4801 states and 7233 transitions. [2019-01-01 22:12:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:05,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4801 states and 7233 transitions. [2019-01-01 22:12:05,827 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-01-01 22:12:05,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-01-01 22:12:05,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4801 [2019-01-01 22:12:05,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4801 [2019-01-01 22:12:05,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4801 states and 7233 transitions. [2019-01-01 22:12:05,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:05,883 INFO L705 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-01-01 22:12:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states and 7233 transitions. [2019-01-01 22:12:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4801. [2019-01-01 22:12:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-01-01 22:12:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-01-01 22:12:06,006 INFO L728 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-01-01 22:12:06,006 INFO L608 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-01-01 22:12:06,006 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:12:06,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4801 states and 7233 transitions. [2019-01-01 22:12:06,046 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-01-01 22:12:06,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:06,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:06,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:06,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:06,050 INFO L794 eck$LassoCheckResult]: Stem: 14653#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 14654#L195-1 [2019-01-01 22:12:06,050 INFO L796 eck$LassoCheckResult]: Loop: 14654#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 14943#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14940#L81 assume !(0 != main_~p1~0); 14936#L81-2 assume !(0 != main_~p2~0); 14933#L85-1 assume !(0 != main_~p3~0); 14930#L89-1 assume !(0 != main_~p4~0); 14931#L93-1 assume !(0 != main_~p5~0); 14868#L97-1 assume !(0 != main_~p6~0); 14869#L101-1 assume !(0 != main_~p7~0); 14851#L105-1 assume !(0 != main_~p8~0); 14853#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14836#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14837#L117-1 assume !(0 != main_~p11~0); 14822#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14823#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14804#L129-1 assume !(0 != main_~p1~0); 14806#L135-1 assume !(0 != main_~p2~0); 14787#L140-1 assume !(0 != main_~p3~0); 14786#L145-1 assume !(0 != main_~p4~0); 14973#L150-1 assume !(0 != main_~p5~0); 14970#L155-1 assume !(0 != main_~p6~0); 14968#L160-1 assume !(0 != main_~p7~0); 14966#L165-1 assume !(0 != main_~p8~0); 14964#L170-1 assume !(0 != main_~p9~0); 14960#L175-1 assume !(0 != main_~p10~0); 14956#L180-1 assume !(0 != main_~p11~0); 14951#L185-1 assume !(0 != main_~p12~0); 14948#L190-1 assume !(0 != main_~p13~0); 14654#L195-1 [2019-01-01 22:12:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-01 22:12:06,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:06,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:06,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:06,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash 435263095, now seen corresponding path program 1 times [2019-01-01 22:12:06,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:06,154 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-01 22:12:06,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:06,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:06,155 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:06,156 INFO L87 Difference]: Start difference. First operand 4801 states and 7233 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2019-01-01 22:12:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:06,292 INFO L93 Difference]: Finished difference Result 9473 states and 14081 transitions. [2019-01-01 22:12:06,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:06,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9473 states and 14081 transitions. [2019-01-01 22:12:06,365 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-01-01 22:12:06,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-01-01 22:12:06,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9473 [2019-01-01 22:12:06,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9473 [2019-01-01 22:12:06,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9473 states and 14081 transitions. [2019-01-01 22:12:06,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:06,480 INFO L705 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-01-01 22:12:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states and 14081 transitions. [2019-01-01 22:12:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 9473. [2019-01-01 22:12:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-01-01 22:12:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-01-01 22:12:06,706 INFO L728 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-01-01 22:12:06,706 INFO L608 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-01-01 22:12:06,706 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:12:06,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9473 states and 14081 transitions. [2019-01-01 22:12:06,754 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-01-01 22:12:06,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:06,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:06,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:06,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:06,758 INFO L794 eck$LassoCheckResult]: Stem: 28929#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 28930#L195-1 [2019-01-01 22:12:06,759 INFO L796 eck$LassoCheckResult]: Loop: 28930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 29188#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29184#L81 assume !(0 != main_~p1~0); 29181#L81-2 assume !(0 != main_~p2~0); 29129#L85-1 assume !(0 != main_~p3~0); 29122#L89-1 assume !(0 != main_~p4~0); 29120#L93-1 assume !(0 != main_~p5~0); 29118#L97-1 assume !(0 != main_~p6~0); 29115#L101-1 assume !(0 != main_~p7~0); 29111#L105-1 assume !(0 != main_~p8~0); 29107#L109-1 assume !(0 != main_~p9~0); 29108#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29245#L117-1 assume !(0 != main_~p11~0); 29244#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29243#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29241#L129-1 assume !(0 != main_~p1~0); 29239#L135-1 assume !(0 != main_~p2~0); 29238#L140-1 assume !(0 != main_~p3~0); 29235#L145-1 assume !(0 != main_~p4~0); 29233#L150-1 assume !(0 != main_~p5~0); 29232#L155-1 assume !(0 != main_~p6~0); 29230#L160-1 assume !(0 != main_~p7~0); 29228#L165-1 assume !(0 != main_~p8~0); 29229#L170-1 assume !(0 != main_~p9~0); 29267#L175-1 assume !(0 != main_~p10~0); 29265#L180-1 assume !(0 != main_~p11~0); 29256#L185-1 assume !(0 != main_~p12~0); 29193#L190-1 assume !(0 != main_~p13~0); 28930#L195-1 [2019-01-01 22:12:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-01 22:12:06,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1558881611, now seen corresponding path program 1 times [2019-01-01 22:12:06,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:06,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:06,913 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-01 22:12:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:06,913 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:06,914 INFO L87 Difference]: Start difference. First operand 9473 states and 14081 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2019-01-01 22:12:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:07,053 INFO L93 Difference]: Finished difference Result 18689 states and 27393 transitions. [2019-01-01 22:12:07,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:07,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18689 states and 27393 transitions. [2019-01-01 22:12:07,148 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-01-01 22:12:07,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-01-01 22:12:07,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18689 [2019-01-01 22:12:07,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18689 [2019-01-01 22:12:07,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18689 states and 27393 transitions. [2019-01-01 22:12:07,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:07,289 INFO L705 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-01-01 22:12:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states and 27393 transitions. [2019-01-01 22:12:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 18689. [2019-01-01 22:12:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18689 states. [2019-01-01 22:12:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-01-01 22:12:07,611 INFO L728 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-01-01 22:12:07,611 INFO L608 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-01-01 22:12:07,612 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:12:07,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18689 states and 27393 transitions. [2019-01-01 22:12:07,681 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-01-01 22:12:07,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:07,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:07,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:07,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:07,684 INFO L794 eck$LassoCheckResult]: Stem: 57102#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 57103#L195-1 [2019-01-01 22:12:07,685 INFO L796 eck$LassoCheckResult]: Loop: 57103#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 57672#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57668#L81 assume !(0 != main_~p1~0); 57664#L81-2 assume !(0 != main_~p2~0); 57662#L85-1 assume !(0 != main_~p3~0); 57660#L89-1 assume !(0 != main_~p4~0); 57655#L93-1 assume !(0 != main_~p5~0); 57651#L97-1 assume !(0 != main_~p6~0); 57644#L101-1 assume !(0 != main_~p7~0); 57636#L105-1 assume !(0 != main_~p8~0); 57629#L109-1 assume !(0 != main_~p9~0); 57624#L113-1 assume !(0 != main_~p10~0); 57625#L117-1 assume !(0 != main_~p11~0); 57621#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57617#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57612#L129-1 assume !(0 != main_~p1~0); 57606#L135-1 assume !(0 != main_~p2~0); 57586#L140-1 assume !(0 != main_~p3~0); 57585#L145-1 assume !(0 != main_~p4~0); 57587#L150-1 assume !(0 != main_~p5~0); 57588#L155-1 assume !(0 != main_~p6~0); 57540#L160-1 assume !(0 != main_~p7~0); 57542#L165-1 assume !(0 != main_~p8~0); 57492#L170-1 assume !(0 != main_~p9~0); 57494#L175-1 assume !(0 != main_~p10~0); 57684#L180-1 assume !(0 != main_~p11~0); 57679#L185-1 assume !(0 != main_~p12~0); 57676#L190-1 assume !(0 != main_~p13~0); 57103#L195-1 [2019-01-01 22:12:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-01 22:12:07,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:07,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:07,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:07,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1147737783, now seen corresponding path program 1 times [2019-01-01 22:12:07,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:07,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:07,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:07,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:07,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:07,778 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-01 22:12:07,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:07,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:07,779 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:07,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:07,780 INFO L87 Difference]: Start difference. First operand 18689 states and 27393 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2019-01-01 22:12:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:07,966 INFO L93 Difference]: Finished difference Result 36865 states and 53249 transitions. [2019-01-01 22:12:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:07,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36865 states and 53249 transitions. [2019-01-01 22:12:08,139 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-01-01 22:12:08,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-01-01 22:12:08,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36865 [2019-01-01 22:12:08,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36865 [2019-01-01 22:12:08,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36865 states and 53249 transitions. [2019-01-01 22:12:08,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:08,371 INFO L705 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-01-01 22:12:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36865 states and 53249 transitions. [2019-01-01 22:12:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36865 to 36865. [2019-01-01 22:12:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36865 states. [2019-01-01 22:12:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-01-01 22:12:09,160 INFO L728 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-01-01 22:12:09,160 INFO L608 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-01-01 22:12:09,160 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:12:09,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36865 states and 53249 transitions. [2019-01-01 22:12:09,269 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-01-01 22:12:09,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:09,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:09,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:09,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:09,270 INFO L794 eck$LassoCheckResult]: Stem: 112667#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 112668#L195-1 [2019-01-01 22:12:09,270 INFO L796 eck$LassoCheckResult]: Loop: 112668#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 113249#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113250#L81 assume !(0 != main_~p1~0); 113230#L81-2 assume !(0 != main_~p2~0); 113220#L85-1 assume !(0 != main_~p3~0); 113221#L89-1 assume !(0 != main_~p4~0); 113327#L93-1 assume !(0 != main_~p5~0); 113326#L97-1 assume !(0 != main_~p6~0); 113323#L101-1 assume !(0 != main_~p7~0); 113312#L105-1 assume !(0 != main_~p8~0); 113310#L109-1 assume !(0 != main_~p9~0); 113307#L113-1 assume !(0 != main_~p10~0); 113304#L117-1 assume !(0 != main_~p11~0); 113302#L121-1 assume !(0 != main_~p12~0); 113292#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113041#L129-1 assume !(0 != main_~p1~0); 113043#L135-1 assume !(0 != main_~p2~0); 113026#L140-1 assume !(0 != main_~p3~0); 113025#L145-1 assume !(0 != main_~p4~0); 113007#L150-1 assume !(0 != main_~p5~0); 113008#L155-1 assume !(0 != main_~p6~0); 112991#L160-1 assume !(0 != main_~p7~0); 112993#L165-1 assume !(0 != main_~p8~0); 112985#L170-1 assume !(0 != main_~p9~0); 112987#L175-1 assume !(0 != main_~p10~0); 112886#L180-1 assume !(0 != main_~p11~0); 112885#L185-1 assume !(0 != main_~p12~0); 113266#L190-1 assume !(0 != main_~p13~0); 112668#L195-1 [2019-01-01 22:12:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-01-01 22:12:09,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -132125895, now seen corresponding path program 1 times [2019-01-01 22:12:09,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:09,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:09,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:09,338 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-01 22:12:09,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:09,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:12:09,339 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:09,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:09,340 INFO L87 Difference]: Start difference. First operand 36865 states and 53249 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2019-01-01 22:12:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:09,607 INFO L93 Difference]: Finished difference Result 72705 states and 103425 transitions. [2019-01-01 22:12:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:09,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72705 states and 103425 transitions. [2019-01-01 22:12:09,942 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-01-01 22:12:10,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-01-01 22:12:10,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72705 [2019-01-01 22:12:10,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72705 [2019-01-01 22:12:10,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72705 states and 103425 transitions. [2019-01-01 22:12:10,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:10,347 INFO L705 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-01-01 22:12:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72705 states and 103425 transitions. [2019-01-01 22:12:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72705 to 72705. [2019-01-01 22:12:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72705 states. [2019-01-01 22:12:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-01-01 22:12:11,792 INFO L728 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-01-01 22:12:11,793 INFO L608 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-01-01 22:12:11,793 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:12:11,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72705 states and 103425 transitions. [2019-01-01 22:12:11,978 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-01-01 22:12:11,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:11,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:11,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:11,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:12:11,980 INFO L794 eck$LassoCheckResult]: Stem: 222242#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_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 222243#L195-1 [2019-01-01 22:12:11,980 INFO L796 eck$LassoCheckResult]: Loop: 222243#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 222479#L50 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222476#L81 assume !(0 != main_~p1~0); 222477#L81-2 assume !(0 != main_~p2~0); 222455#L85-1 assume !(0 != main_~p3~0); 222456#L89-1 assume !(0 != main_~p4~0); 222439#L93-1 assume !(0 != main_~p5~0); 222441#L97-1 assume !(0 != main_~p6~0); 222415#L101-1 assume !(0 != main_~p7~0); 222417#L105-1 assume !(0 != main_~p8~0); 222391#L109-1 assume !(0 != main_~p9~0); 222393#L113-1 assume !(0 != main_~p10~0); 222371#L117-1 assume !(0 != main_~p11~0); 222372#L121-1 assume !(0 != main_~p12~0); 222347#L125-1 assume !(0 != main_~p13~0); 222349#L129-1 assume !(0 != main_~p1~0); 222518#L135-1 assume !(0 != main_~p2~0); 222517#L140-1 assume !(0 != main_~p3~0); 222514#L145-1 assume !(0 != main_~p4~0); 222512#L150-1 assume !(0 != main_~p5~0); 222510#L155-1 assume !(0 != main_~p6~0); 222507#L160-1 assume !(0 != main_~p7~0); 222503#L165-1 assume !(0 != main_~p8~0); 222499#L170-1 assume !(0 != main_~p9~0); 222495#L175-1 assume !(0 != main_~p10~0); 222492#L180-1 assume !(0 != main_~p11~0); 222487#L185-1 assume !(0 != main_~p12~0); 222483#L190-1 assume !(0 != main_~p13~0); 222243#L195-1 [2019-01-01 22:12:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-01-01 22:12:11,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:11,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1143243145, now seen corresponding path program 1 times [2019-01-01 22:12:11,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:11,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:11,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1131927018, now seen corresponding path program 1 times [2019-01-01 22:12:12,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:12,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:12,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:12,262 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 22:12:12,763 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 22:12:12,960 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:12:13,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:12:13 BoogieIcfgContainer [2019-01-01 22:12:13,010 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:12:13,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:12:13,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:12:13,011 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:12:13,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:12:03" (3/4) ... [2019-01-01 22:12:13,016 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:12:13,103 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:12:13,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:12:13,104 INFO L168 Benchmark]: Toolchain (without parser) took 10640.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 943.3 MB in the beginning and 555.2 MB in the end (delta: 388.1 MB). Peak memory consumption was 690.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:13,105 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-01 22:12:13,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.71 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-01 22:12:13,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.79 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-01 22:12:13,107 INFO L168 Benchmark]: Boogie Preprocessor took 90.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:13,107 INFO L168 Benchmark]: RCFGBuilder took 663.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:13,110 INFO L168 Benchmark]: BuchiAutomizer took 9357.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 555.2 MB in the end (delta: 528.7 MB). Peak memory consumption was 715.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:13,111 INFO L168 Benchmark]: Witness Printer took 92.61 ms. Allocated memory is still 1.3 GB. Free memory is still 555.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:12:13,118 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 368.71 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 60.79 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. * Boogie Preprocessor took 90.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 663.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9357.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 555.2 MB in the end (delta: 528.7 MB). Peak memory consumption was 715.3 MB. Max. memory is 11.5 GB. * Witness Printer took 92.61 ms. Allocated memory is still 1.3 GB. Free memory is still 555.2 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72705 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.9s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.1s. Biggest automaton had 72705 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1122 SDtfs, 589 SDslu, 698 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 48]: 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, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@652338e9=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69609b75=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44a4c86d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@136ca95c=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41c9b0c8=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d72da3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2091bf13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@316a5709=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13f35582=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48d35485=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fcfdedc=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71a85f3c=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c3cd962=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb98528=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: 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; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L46] int cond; Loop: [L48] COND TRUE 1 [L49] cond = __VERIFIER_nondet_int() [L50] COND FALSE !(cond == 0) [L53] lk1 = 0 [L55] lk2 = 0 [L57] lk3 = 0 [L59] lk4 = 0 [L61] lk5 = 0 [L63] lk6 = 0 [L65] lk7 = 0 [L67] lk8 = 0 [L69] lk9 = 0 [L71] lk10 = 0 [L73] lk11 = 0 [L75] lk12 = 0 [L77] lk13 = 0 [L81] COND FALSE !(p1 != 0) [L85] COND FALSE !(p2 != 0) [L89] COND FALSE !(p3 != 0) [L93] COND FALSE !(p4 != 0) [L97] COND FALSE !(p5 != 0) [L101] COND FALSE !(p6 != 0) [L105] COND FALSE !(p7 != 0) [L109] COND FALSE !(p8 != 0) [L113] COND FALSE !(p9 != 0) [L117] COND FALSE !(p10 != 0) [L121] COND FALSE !(p11 != 0) [L125] COND FALSE !(p12 != 0) [L129] COND FALSE !(p13 != 0) [L135] COND FALSE !(p1 != 0) [L140] COND FALSE !(p2 != 0) [L145] COND FALSE !(p3 != 0) [L150] COND FALSE !(p4 != 0) [L155] COND FALSE !(p5 != 0) [L160] COND FALSE !(p6 != 0) [L165] COND FALSE !(p7 != 0) [L170] COND FALSE !(p8 != 0) [L175] COND FALSE !(p9 != 0) [L180] COND FALSE !(p10 != 0) [L185] COND FALSE !(p11 != 0) [L190] COND FALSE !(p12 != 0) [L195] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...