./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_14_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_14_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 c5a3d22d49117f02662b197492bc1b16616a2878 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:11,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:12:11,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:12:11,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:12:11,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:12:11,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:12:11,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:12:11,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:12:11,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:12:11,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:12:11,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:12:11,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:12:11,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:12:11,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:12:11,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:12:11,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:12:11,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:12:11,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:12:11,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:12:11,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:12:11,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:12:11,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:12:11,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:12:11,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:12:11,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:12:11,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:12:11,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:12:11,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:12:11,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:12:11,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:12:11,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:12:11,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:12:11,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:12:11,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:12:11,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:12:11,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:12:11,624 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:11,642 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:12:11,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:12:11,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:12:11,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:12:11,648 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:12:11,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:12:11,648 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:12:11,649 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:12:11,649 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:12:11,649 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:12:11,649 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:12:11,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:12:11,651 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:12:11,651 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:12:11,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:12:11,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:12:11,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:12:11,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:12:11,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:12:11,655 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:12:11,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:12:11,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:12:11,656 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:12:11,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:12:11,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:12:11,657 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:12:11,658 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:12:11,659 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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2019-01-01 22:12:11,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:12:11,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:12:11,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:12:11,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:12:11,747 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:12:11,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:11,806 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e408ed1/1b163c8825224232a7f4db41862f21c9/FLAG3e10842bf [2019-01-01 22:12:12,277 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:12:12,278 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:12,287 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e408ed1/1b163c8825224232a7f4db41862f21c9/FLAG3e10842bf [2019-01-01 22:12:12,643 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e408ed1/1b163c8825224232a7f4db41862f21c9 [2019-01-01 22:12:12,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:12:12,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:12:12,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:12:12,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:12:12,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:12:12,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:12:12" (1/1) ... [2019-01-01 22:12:12,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256bc0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:12, skipping insertion in model container [2019-01-01 22:12:12,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:12:12" (1/1) ... [2019-01-01 22:12:12,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:12:12,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:12:12,998 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:12:13,005 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:12:13,061 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:12:13,084 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:12:13,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:13 WrapperNode [2019-01-01 22:12:13,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:12:13,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:12:13,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:12:13,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:12:13,093 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:13" (1/1) ... [2019-01-01 22:12:13,099 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:13" (1/1) ... [2019-01-01 22:12:13,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:12:13,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:12:13,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:12:13,129 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:12:13,139 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:13" (1/1) ... [2019-01-01 22:12:13,140 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:13" (1/1) ... [2019-01-01 22:12:13,141 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:13" (1/1) ... [2019-01-01 22:12:13,142 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:13" (1/1) ... [2019-01-01 22:12:13,217 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:13" (1/1) ... [2019-01-01 22:12:13,233 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:13" (1/1) ... [2019-01-01 22:12:13,237 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:13" (1/1) ... [2019-01-01 22:12:13,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:12:13,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:12:13,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:12:13,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:12:13,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:13" (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:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:12:13,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:12:13,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:12:13,923 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:12:13,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:12:13 BoogieIcfgContainer [2019-01-01 22:12:13,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:12:13,924 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:12:13,924 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:12:13,930 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:12:13,931 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:13,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:12:12" (1/3) ... [2019-01-01 22:12:13,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2b3473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:12:13, skipping insertion in model container [2019-01-01 22:12:13,933 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:13,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:12:13" (2/3) ... [2019-01-01 22:12:13,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2b3473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:12:13, skipping insertion in model container [2019-01-01 22:12:13,934 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:12:13,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:12:13" (3/3) ... [2019-01-01 22:12:13,937 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:12:14,001 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:12:14,002 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:12:14,002 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:12:14,002 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:12:14,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:12:14,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:12:14,003 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:12:14,003 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:12:14,003 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:12:14,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-01-01 22:12:14,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-01-01 22:12:14,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:14,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:14,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:14,065 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, 1, 1] [2019-01-01 22:12:14,065 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:12:14,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2019-01-01 22:12:14,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2019-01-01 22:12:14,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:14,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:14,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:14,071 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, 1, 1] [2019-01-01 22:12:14,079 INFO L794 eck$LassoCheckResult]: Stem: 20#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 16#L209-1true [2019-01-01 22:12:14,080 INFO L796 eck$LassoCheckResult]: Loop: 16#L209-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L53true 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;main_~lk14~0 := 0; 48#L86true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L86-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 51#L90-1true assume !(0 != main_~p3~0); 42#L94-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 10#L98-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 4#L102-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 7#L106-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 23#L110-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L114-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 34#L118-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 37#L122-1true assume !(0 != main_~p11~0); 31#L126-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 49#L130-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 39#L134-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 44#L138-1true assume !(0 != main_~p1~0); 26#L144-1true assume !(0 != main_~p2~0); 45#L149-1true assume !(0 != main_~p3~0); 25#L154-1true assume !(0 != main_~p4~0); 32#L159-1true assume !(0 != main_~p5~0); 14#L164-1true assume !(0 != main_~p6~0); 18#L169-1true assume !(0 != main_~p7~0); 50#L174-1true assume !(0 != main_~p8~0); 5#L179-1true assume !(0 != main_~p9~0); 35#L184-1true assume !(0 != main_~p10~0); 41#L189-1true assume !(0 != main_~p11~0); 22#L194-1true assume !(0 != main_~p12~0); 28#L199-1true assume !(0 != main_~p13~0); 9#L204-1true assume !(0 != main_~p14~0); 16#L209-1true [2019-01-01 22:12:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:12:14,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -78752615, now seen corresponding path program 1 times [2019-01-01 22:12:14,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:14,339 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:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:14,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:14,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:14,375 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-01-01 22:12:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:14,433 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2019-01-01 22:12:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:14,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 177 transitions. [2019-01-01 22:12:14,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-01 22:12:14,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 88 states and 142 transitions. [2019-01-01 22:12:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2019-01-01 22:12:14,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2019-01-01 22:12:14,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 142 transitions. [2019-01-01 22:12:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:14,452 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-01-01 22:12:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 142 transitions. [2019-01-01 22:12:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-01 22:12:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 22:12:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 142 transitions. [2019-01-01 22:12:14,496 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-01-01 22:12:14,496 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 142 transitions. [2019-01-01 22:12:14,496 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:12:14,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 142 transitions. [2019-01-01 22:12:14,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-01 22:12:14,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:14,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:14,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:14,500 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, 1, 1] [2019-01-01 22:12:14,501 INFO L794 eck$LassoCheckResult]: Stem: 205#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 206#L209-1 [2019-01-01 22:12:14,501 INFO L796 eck$LassoCheckResult]: Loop: 206#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 203#L53 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;main_~lk14~0 := 0; 204#L86 assume !(0 != main_~p1~0); 209#L86-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 244#L90-1 assume !(0 != main_~p3~0); 243#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 240#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 239#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 238#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 237#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 236#L122-1 assume !(0 != main_~p11~0); 235#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 234#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 233#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 232#L138-1 assume !(0 != main_~p1~0); 157#L144-1 assume !(0 != main_~p2~0); 159#L149-1 assume !(0 != main_~p3~0); 229#L154-1 assume !(0 != main_~p4~0); 227#L159-1 assume !(0 != main_~p5~0); 225#L164-1 assume !(0 != main_~p6~0); 200#L169-1 assume !(0 != main_~p7~0); 161#L174-1 assume !(0 != main_~p8~0); 171#L179-1 assume !(0 != main_~p9~0); 172#L184-1 assume !(0 != main_~p10~0); 177#L189-1 assume !(0 != main_~p11~0); 189#L194-1 assume !(0 != main_~p12~0); 212#L199-1 assume !(0 != main_~p13~0); 211#L204-1 assume !(0 != main_~p14~0); 206#L209-1 [2019-01-01 22:12:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 22:12:14,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:14,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -588225705, now seen corresponding path program 1 times [2019-01-01 22:12:14,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:14,605 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:14,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:14,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:14,606 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:14,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:14,607 INFO L87 Difference]: Start difference. First operand 88 states and 142 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-01-01 22:12:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:14,712 INFO L93 Difference]: Finished difference Result 173 states and 277 transitions. [2019-01-01 22:12:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:14,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 277 transitions. [2019-01-01 22:12:14,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-01-01 22:12:14,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 277 transitions. [2019-01-01 22:12:14,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2019-01-01 22:12:14,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2019-01-01 22:12:14,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 277 transitions. [2019-01-01 22:12:14,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:14,723 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-01-01 22:12:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 277 transitions. [2019-01-01 22:12:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-01 22:12:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-01 22:12:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2019-01-01 22:12:14,740 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-01-01 22:12:14,740 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 277 transitions. [2019-01-01 22:12:14,741 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:12:14,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 277 transitions. [2019-01-01 22:12:14,744 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2019-01-01 22:12:14,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:14,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:14,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:14,745 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, 1, 1] [2019-01-01 22:12:14,746 INFO L794 eck$LassoCheckResult]: Stem: 477#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 478#L209-1 [2019-01-01 22:12:14,746 INFO L796 eck$LassoCheckResult]: Loop: 478#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 493#L53 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;main_~lk14~0 := 0; 490#L86 assume !(0 != main_~p1~0); 491#L86-2 assume !(0 != main_~p2~0); 557#L90-1 assume !(0 != main_~p3~0); 556#L94-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 555#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 554#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 553#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 552#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 551#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 550#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 549#L122-1 assume !(0 != main_~p11~0); 548#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 547#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 546#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 545#L138-1 assume !(0 != main_~p1~0); 544#L144-1 assume !(0 != main_~p2~0); 542#L149-1 assume !(0 != main_~p3~0); 538#L154-1 assume !(0 != main_~p4~0); 534#L159-1 assume !(0 != main_~p5~0); 530#L164-1 assume !(0 != main_~p6~0); 526#L169-1 assume !(0 != main_~p7~0); 522#L174-1 assume !(0 != main_~p8~0); 518#L179-1 assume !(0 != main_~p9~0); 513#L184-1 assume !(0 != main_~p10~0); 510#L189-1 assume !(0 != main_~p11~0); 506#L194-1 assume !(0 != main_~p12~0); 501#L199-1 assume !(0 != main_~p13~0); 498#L204-1 assume !(0 != main_~p14~0); 478#L209-1 [2019-01-01 22:12:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 22:12:14,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1335002329, now seen corresponding path program 1 times [2019-01-01 22:12:14,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:14,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:14,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:14,854 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:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:14,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:14,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:14,857 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-01-01 22:12:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:14,951 INFO L93 Difference]: Finished difference Result 341 states and 541 transitions. [2019-01-01 22:12:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:14,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 541 transitions. [2019-01-01 22:12:14,960 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-01-01 22:12:14,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 541 transitions. [2019-01-01 22:12:14,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2019-01-01 22:12:14,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2019-01-01 22:12:14,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 541 transitions. [2019-01-01 22:12:14,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:14,980 INFO L705 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-01-01 22:12:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 541 transitions. [2019-01-01 22:12:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2019-01-01 22:12:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-01 22:12:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 541 transitions. [2019-01-01 22:12:15,025 INFO L728 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-01-01 22:12:15,025 INFO L608 BuchiCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-01-01 22:12:15,026 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:12:15,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 541 transitions. [2019-01-01 22:12:15,034 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2019-01-01 22:12:15,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:15,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:15,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:15,036 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, 1, 1] [2019-01-01 22:12:15,036 INFO L794 eck$LassoCheckResult]: Stem: 992#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 993#L209-1 [2019-01-01 22:12:15,036 INFO L796 eck$LassoCheckResult]: Loop: 993#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1040#L53 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;main_~lk14~0 := 0; 1037#L86 assume !(0 != main_~p1~0); 1033#L86-2 assume !(0 != main_~p2~0); 1030#L90-1 assume !(0 != main_~p3~0); 1027#L94-1 assume !(0 != main_~p4~0); 1028#L98-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1022#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1023#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1018#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1019#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1014#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1015#L122-1 assume !(0 != main_~p11~0); 1010#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1011#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1006#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1007#L138-1 assume !(0 != main_~p1~0); 1089#L144-1 assume !(0 != main_~p2~0); 1086#L149-1 assume !(0 != main_~p3~0); 1083#L154-1 assume !(0 != main_~p4~0); 1081#L159-1 assume !(0 != main_~p5~0); 1077#L164-1 assume !(0 != main_~p6~0); 1073#L169-1 assume !(0 != main_~p7~0); 1069#L174-1 assume !(0 != main_~p8~0); 1065#L179-1 assume !(0 != main_~p9~0); 1060#L184-1 assume !(0 != main_~p10~0); 1057#L189-1 assume !(0 != main_~p11~0); 1053#L194-1 assume !(0 != main_~p12~0); 1048#L199-1 assume !(0 != main_~p13~0); 1045#L204-1 assume !(0 != main_~p14~0); 993#L209-1 [2019-01-01 22:12:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 22:12:15,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1475550939, now seen corresponding path program 1 times [2019-01-01 22:12:15,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:15,149 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:15,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:15,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:15,150 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:15,152 INFO L87 Difference]: Start difference. First operand 341 states and 541 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-01-01 22:12:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:15,216 INFO L93 Difference]: Finished difference Result 673 states and 1057 transitions. [2019-01-01 22:12:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:15,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1057 transitions. [2019-01-01 22:12:15,225 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-01-01 22:12:15,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 1057 transitions. [2019-01-01 22:12:15,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2019-01-01 22:12:15,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2019-01-01 22:12:15,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 1057 transitions. [2019-01-01 22:12:15,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:15,236 INFO L705 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-01-01 22:12:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1057 transitions. [2019-01-01 22:12:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-01-01 22:12:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-01-01 22:12:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1057 transitions. [2019-01-01 22:12:15,262 INFO L728 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-01-01 22:12:15,262 INFO L608 BuchiCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-01-01 22:12:15,262 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:12:15,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 1057 transitions. [2019-01-01 22:12:15,268 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2019-01-01 22:12:15,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:15,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:15,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:15,269 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, 1, 1] [2019-01-01 22:12:15,271 INFO L794 eck$LassoCheckResult]: Stem: 2015#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 2016#L209-1 [2019-01-01 22:12:15,271 INFO L796 eck$LassoCheckResult]: Loop: 2016#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2081#L53 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;main_~lk14~0 := 0; 2079#L86 assume !(0 != main_~p1~0); 2075#L86-2 assume !(0 != main_~p2~0); 2073#L90-1 assume !(0 != main_~p3~0); 2069#L94-1 assume !(0 != main_~p4~0); 2065#L98-1 assume !(0 != main_~p5~0); 2063#L102-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2061#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2059#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2057#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2055#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2053#L122-1 assume !(0 != main_~p11~0); 2051#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2049#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2047#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2044#L138-1 assume !(0 != main_~p1~0); 2045#L144-1 assume !(0 != main_~p2~0); 2129#L149-1 assume !(0 != main_~p3~0); 2124#L154-1 assume !(0 != main_~p4~0); 2120#L159-1 assume !(0 != main_~p5~0); 2117#L164-1 assume !(0 != main_~p6~0); 2113#L169-1 assume !(0 != main_~p7~0); 2109#L174-1 assume !(0 != main_~p8~0); 2105#L179-1 assume !(0 != main_~p9~0); 2100#L184-1 assume !(0 != main_~p10~0); 2097#L189-1 assume !(0 != main_~p11~0); 2093#L194-1 assume !(0 != main_~p12~0); 2088#L199-1 assume !(0 != main_~p13~0); 2085#L204-1 assume !(0 != main_~p14~0); 2016#L209-1 [2019-01-01 22:12:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-01 22:12:15,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1341537433, now seen corresponding path program 1 times [2019-01-01 22:12:15,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:15,335 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:15,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:15,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:15,336 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:15,336 INFO L87 Difference]: Start difference. First operand 673 states and 1057 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-01-01 22:12:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:15,390 INFO L93 Difference]: Finished difference Result 1329 states and 2065 transitions. [2019-01-01 22:12:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:15,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 2065 transitions. [2019-01-01 22:12:15,412 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-01-01 22:12:15,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1329 states and 2065 transitions. [2019-01-01 22:12:15,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1329 [2019-01-01 22:12:15,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1329 [2019-01-01 22:12:15,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1329 states and 2065 transitions. [2019-01-01 22:12:15,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:15,430 INFO L705 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-01-01 22:12:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 2065 transitions. [2019-01-01 22:12:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2019-01-01 22:12:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-01-01 22:12:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2065 transitions. [2019-01-01 22:12:15,466 INFO L728 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-01-01 22:12:15,466 INFO L608 BuchiCegarLoop]: Abstraction has 1329 states and 2065 transitions. [2019-01-01 22:12:15,467 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:12:15,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 2065 transitions. [2019-01-01 22:12:15,478 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2019-01-01 22:12:15,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:15,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:15,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:15,479 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, 1, 1] [2019-01-01 22:12:15,481 INFO L794 eck$LassoCheckResult]: Stem: 4024#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 4025#L209-1 [2019-01-01 22:12:15,481 INFO L796 eck$LassoCheckResult]: Loop: 4025#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4116#L53 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;main_~lk14~0 := 0; 4112#L86 assume !(0 != main_~p1~0); 4105#L86-2 assume !(0 != main_~p2~0); 4100#L90-1 assume !(0 != main_~p3~0); 4093#L94-1 assume !(0 != main_~p4~0); 4085#L98-1 assume !(0 != main_~p5~0); 4079#L102-1 assume !(0 != main_~p6~0); 4074#L106-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4075#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4068#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4069#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4062#L122-1 assume !(0 != main_~p11~0); 4063#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4056#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4053#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4054#L138-1 assume !(0 != main_~p1~0); 4207#L144-1 assume !(0 != main_~p2~0); 4189#L149-1 assume !(0 != main_~p3~0); 4178#L154-1 assume !(0 != main_~p4~0); 4172#L159-1 assume !(0 != main_~p5~0); 4170#L164-1 assume !(0 != main_~p6~0); 4169#L169-1 assume !(0 != main_~p7~0); 4167#L174-1 assume !(0 != main_~p8~0); 4165#L179-1 assume !(0 != main_~p9~0); 4158#L184-1 assume !(0 != main_~p10~0); 4147#L189-1 assume !(0 != main_~p11~0); 4139#L194-1 assume !(0 != main_~p12~0); 4134#L199-1 assume !(0 != main_~p13~0); 4125#L204-1 assume !(0 != main_~p14~0); 4025#L209-1 [2019-01-01 22:12:15,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,481 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-01 22:12:15,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:15,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash -463900901, now seen corresponding path program 1 times [2019-01-01 22:12:15,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:15,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:15,591 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:15,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:15,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:15,592 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:15,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:15,594 INFO L87 Difference]: Start difference. First operand 1329 states and 2065 transitions. cyclomatic complexity: 768 Second operand 3 states. [2019-01-01 22:12:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:15,683 INFO L93 Difference]: Finished difference Result 2625 states and 4033 transitions. [2019-01-01 22:12:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:15,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2625 states and 4033 transitions. [2019-01-01 22:12:15,709 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-01-01 22:12:15,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2625 states to 2625 states and 4033 transitions. [2019-01-01 22:12:15,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2625 [2019-01-01 22:12:15,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2625 [2019-01-01 22:12:15,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2625 states and 4033 transitions. [2019-01-01 22:12:15,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:15,739 INFO L705 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-01-01 22:12:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states and 4033 transitions. [2019-01-01 22:12:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2019-01-01 22:12:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-01-01 22:12:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 4033 transitions. [2019-01-01 22:12:15,804 INFO L728 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-01-01 22:12:15,804 INFO L608 BuchiCegarLoop]: Abstraction has 2625 states and 4033 transitions. [2019-01-01 22:12:15,804 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:12:15,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2625 states and 4033 transitions. [2019-01-01 22:12:15,826 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2019-01-01 22:12:15,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:15,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:15,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:15,829 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, 1, 1] [2019-01-01 22:12:15,829 INFO L794 eck$LassoCheckResult]: Stem: 7984#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 7985#L209-1 [2019-01-01 22:12:15,829 INFO L796 eck$LassoCheckResult]: Loop: 7985#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 8074#L53 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;main_~lk14~0 := 0; 8071#L86 assume !(0 != main_~p1~0); 8067#L86-2 assume !(0 != main_~p2~0); 8064#L90-1 assume !(0 != main_~p3~0); 8061#L94-1 assume !(0 != main_~p4~0); 8057#L98-1 assume !(0 != main_~p5~0); 8041#L102-1 assume !(0 != main_~p6~0); 8042#L106-1 assume !(0 != main_~p7~0); 8268#L110-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8270#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8266#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8262#L122-1 assume !(0 != main_~p11~0); 8258#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8254#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8250#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8245#L138-1 assume !(0 != main_~p1~0); 8246#L144-1 assume !(0 != main_~p2~0); 8347#L149-1 assume !(0 != main_~p3~0); 8342#L154-1 assume !(0 != main_~p4~0); 8339#L159-1 assume !(0 != main_~p5~0); 8337#L164-1 assume !(0 != main_~p6~0); 8334#L169-1 assume !(0 != main_~p7~0); 8330#L174-1 assume !(0 != main_~p8~0); 8326#L179-1 assume !(0 != main_~p9~0); 8322#L184-1 assume !(0 != main_~p10~0); 8321#L189-1 assume !(0 != main_~p11~0); 8147#L194-1 assume !(0 != main_~p12~0); 8081#L199-1 assume !(0 != main_~p13~0); 8079#L204-1 assume !(0 != main_~p14~0); 7985#L209-1 [2019-01-01 22:12:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-01 22:12:15,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -245046183, now seen corresponding path program 1 times [2019-01-01 22:12:15,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:15,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:15,947 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:15,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:15,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:15,949 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:15,950 INFO L87 Difference]: Start difference. First operand 2625 states and 4033 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2019-01-01 22:12:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:16,047 INFO L93 Difference]: Finished difference Result 5185 states and 7873 transitions. [2019-01-01 22:12:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:16,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5185 states and 7873 transitions. [2019-01-01 22:12:16,093 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-01-01 22:12:16,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5185 states to 5185 states and 7873 transitions. [2019-01-01 22:12:16,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5185 [2019-01-01 22:12:16,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5185 [2019-01-01 22:12:16,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5185 states and 7873 transitions. [2019-01-01 22:12:16,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:16,153 INFO L705 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-01-01 22:12:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states and 7873 transitions. [2019-01-01 22:12:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185. [2019-01-01 22:12:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2019-01-01 22:12:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7873 transitions. [2019-01-01 22:12:16,282 INFO L728 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-01-01 22:12:16,282 INFO L608 BuchiCegarLoop]: Abstraction has 5185 states and 7873 transitions. [2019-01-01 22:12:16,283 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:12:16,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5185 states and 7873 transitions. [2019-01-01 22:12:16,310 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2019-01-01 22:12:16,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:16,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:16,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:16,311 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, 1, 1] [2019-01-01 22:12:16,311 INFO L794 eck$LassoCheckResult]: Stem: 15803#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 15804#L209-1 [2019-01-01 22:12:16,312 INFO L796 eck$LassoCheckResult]: Loop: 15804#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 15938#L53 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;main_~lk14~0 := 0; 15934#L86 assume !(0 != main_~p1~0); 15930#L86-2 assume !(0 != main_~p2~0); 15928#L90-1 assume !(0 != main_~p3~0); 15924#L94-1 assume !(0 != main_~p4~0); 15920#L98-1 assume !(0 != main_~p5~0); 15918#L102-1 assume !(0 != main_~p6~0); 15919#L106-1 assume !(0 != main_~p7~0); 16254#L110-1 assume !(0 != main_~p8~0); 16253#L114-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 16214#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16211#L122-1 assume !(0 != main_~p11~0); 16208#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16192#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16184#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16176#L138-1 assume !(0 != main_~p1~0); 16169#L144-1 assume !(0 != main_~p2~0); 16160#L149-1 assume !(0 != main_~p3~0); 16157#L154-1 assume !(0 != main_~p4~0); 16153#L159-1 assume !(0 != main_~p5~0); 16145#L164-1 assume !(0 != main_~p6~0); 16086#L169-1 assume !(0 != main_~p7~0); 16082#L174-1 assume !(0 != main_~p8~0); 16079#L179-1 assume !(0 != main_~p9~0); 16076#L184-1 assume !(0 != main_~p10~0); 16075#L189-1 assume !(0 != main_~p11~0); 16071#L194-1 assume !(0 != main_~p12~0); 16068#L199-1 assume !(0 != main_~p13~0); 15942#L204-1 assume !(0 != main_~p14~0); 15804#L209-1 [2019-01-01 22:12:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-01 22:12:16,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:16,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 177655643, now seen corresponding path program 1 times [2019-01-01 22:12:16,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:16,393 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:16,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:16,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:16,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:16,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:16,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:16,396 INFO L87 Difference]: Start difference. First operand 5185 states and 7873 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2019-01-01 22:12:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:16,475 INFO L93 Difference]: Finished difference Result 10241 states and 15361 transitions. [2019-01-01 22:12:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:16,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10241 states and 15361 transitions. [2019-01-01 22:12:16,534 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-01-01 22:12:16,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10241 states to 10241 states and 15361 transitions. [2019-01-01 22:12:16,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10241 [2019-01-01 22:12:16,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10241 [2019-01-01 22:12:16,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10241 states and 15361 transitions. [2019-01-01 22:12:16,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:16,641 INFO L705 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-01-01 22:12:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states and 15361 transitions. [2019-01-01 22:12:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10241. [2019-01-01 22:12:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2019-01-01 22:12:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 15361 transitions. [2019-01-01 22:12:16,956 INFO L728 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-01-01 22:12:16,957 INFO L608 BuchiCegarLoop]: Abstraction has 10241 states and 15361 transitions. [2019-01-01 22:12:16,957 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:12:16,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10241 states and 15361 transitions. [2019-01-01 22:12:16,987 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2019-01-01 22:12:16,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:16,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:16,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:16,988 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, 1, 1] [2019-01-01 22:12:16,988 INFO L794 eck$LassoCheckResult]: Stem: 31233#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 31234#L209-1 [2019-01-01 22:12:16,988 INFO L796 eck$LassoCheckResult]: Loop: 31234#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 31544#L53 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;main_~lk14~0 := 0; 31545#L86 assume !(0 != main_~p1~0); 31719#L86-2 assume !(0 != main_~p2~0); 31714#L90-1 assume !(0 != main_~p3~0); 31707#L94-1 assume !(0 != main_~p4~0); 31696#L98-1 assume !(0 != main_~p5~0); 31687#L102-1 assume !(0 != main_~p6~0); 31677#L106-1 assume !(0 != main_~p7~0); 31679#L110-1 assume !(0 != main_~p8~0); 31665#L114-1 assume !(0 != main_~p9~0); 31667#L118-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 31645#L122-1 assume !(0 != main_~p11~0); 31646#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31623#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31624#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31609#L138-1 assume !(0 != main_~p1~0); 31610#L144-1 assume !(0 != main_~p2~0); 31818#L149-1 assume !(0 != main_~p3~0); 31814#L154-1 assume !(0 != main_~p4~0); 31579#L159-1 assume !(0 != main_~p5~0); 31581#L164-1 assume !(0 != main_~p6~0); 31745#L169-1 assume !(0 != main_~p7~0); 31744#L174-1 assume !(0 != main_~p8~0); 31743#L179-1 assume !(0 != main_~p9~0); 31741#L184-1 assume !(0 != main_~p10~0); 31740#L189-1 assume !(0 != main_~p11~0); 31737#L194-1 assume !(0 != main_~p12~0); 31729#L199-1 assume !(0 != main_~p13~0); 31554#L204-1 assume !(0 != main_~p14~0); 31234#L209-1 [2019-01-01 22:12:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-01 22:12:16,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:16,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:16,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:16,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -639992807, now seen corresponding path program 1 times [2019-01-01 22:12:17,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:17,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:17,061 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:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:17,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:17,064 INFO L87 Difference]: Start difference. First operand 10241 states and 15361 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2019-01-01 22:12:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:17,185 INFO L93 Difference]: Finished difference Result 20225 states and 29953 transitions. [2019-01-01 22:12:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:17,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20225 states and 29953 transitions. [2019-01-01 22:12:17,275 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-01-01 22:12:17,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20225 states to 20225 states and 29953 transitions. [2019-01-01 22:12:17,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20225 [2019-01-01 22:12:17,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20225 [2019-01-01 22:12:17,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20225 states and 29953 transitions. [2019-01-01 22:12:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:17,409 INFO L705 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-01-01 22:12:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states and 29953 transitions. [2019-01-01 22:12:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 20225. [2019-01-01 22:12:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-01-01 22:12:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 29953 transitions. [2019-01-01 22:12:17,704 INFO L728 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-01-01 22:12:17,704 INFO L608 BuchiCegarLoop]: Abstraction has 20225 states and 29953 transitions. [2019-01-01 22:12:17,704 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:12:17,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20225 states and 29953 transitions. [2019-01-01 22:12:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2019-01-01 22:12:17,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:17,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:17,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:17,764 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, 1, 1] [2019-01-01 22:12:17,764 INFO L794 eck$LassoCheckResult]: Stem: 61703#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 61704#L209-1 [2019-01-01 22:12:17,767 INFO L796 eck$LassoCheckResult]: Loop: 61704#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 61843#L53 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;main_~lk14~0 := 0; 61839#L86 assume !(0 != main_~p1~0); 61832#L86-2 assume !(0 != main_~p2~0); 61827#L90-1 assume !(0 != main_~p3~0); 61820#L94-1 assume !(0 != main_~p4~0); 61812#L98-1 assume !(0 != main_~p5~0); 61804#L102-1 assume !(0 != main_~p6~0); 61796#L106-1 assume !(0 != main_~p7~0); 61788#L110-1 assume !(0 != main_~p8~0); 61780#L114-1 assume !(0 != main_~p9~0); 61774#L118-1 assume !(0 != main_~p10~0); 61768#L122-1 assume !(0 != main_~p11~0); 61769#L126-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 61760#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 61761#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 61933#L138-1 assume !(0 != main_~p1~0); 61925#L144-1 assume !(0 != main_~p2~0); 61918#L149-1 assume !(0 != main_~p3~0); 61909#L154-1 assume !(0 != main_~p4~0); 61901#L159-1 assume !(0 != main_~p5~0); 61896#L164-1 assume !(0 != main_~p6~0); 61890#L169-1 assume !(0 != main_~p7~0); 61884#L174-1 assume !(0 != main_~p8~0); 61879#L179-1 assume !(0 != main_~p9~0); 61877#L184-1 assume !(0 != main_~p10~0); 61868#L189-1 assume !(0 != main_~p11~0); 61860#L194-1 assume !(0 != main_~p12~0); 61855#L199-1 assume !(0 != main_~p13~0); 61852#L204-1 assume !(0 != main_~p14~0); 61704#L209-1 [2019-01-01 22:12:17,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-01 22:12:17,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:17,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1966030747, now seen corresponding path program 1 times [2019-01-01 22:12:17,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:17,845 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:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:17,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:17,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:17,848 INFO L87 Difference]: Start difference. First operand 20225 states and 29953 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2019-01-01 22:12:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:18,027 INFO L93 Difference]: Finished difference Result 39937 states and 58369 transitions. [2019-01-01 22:12:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:18,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39937 states and 58369 transitions. [2019-01-01 22:12:18,210 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-01-01 22:12:18,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39937 states to 39937 states and 58369 transitions. [2019-01-01 22:12:18,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39937 [2019-01-01 22:12:18,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39937 [2019-01-01 22:12:18,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39937 states and 58369 transitions. [2019-01-01 22:12:18,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:18,441 INFO L705 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-01-01 22:12:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39937 states and 58369 transitions. [2019-01-01 22:12:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39937. [2019-01-01 22:12:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39937 states. [2019-01-01 22:12:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39937 states to 39937 states and 58369 transitions. [2019-01-01 22:12:19,249 INFO L728 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-01-01 22:12:19,249 INFO L608 BuchiCegarLoop]: Abstraction has 39937 states and 58369 transitions. [2019-01-01 22:12:19,249 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:12:19,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39937 states and 58369 transitions. [2019-01-01 22:12:19,361 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2019-01-01 22:12:19,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:19,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:19,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:19,362 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, 1, 1] [2019-01-01 22:12:19,363 INFO L794 eck$LassoCheckResult]: Stem: 121875#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 121876#L209-1 [2019-01-01 22:12:19,364 INFO L796 eck$LassoCheckResult]: Loop: 121876#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 122049#L53 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;main_~lk14~0 := 0; 122046#L86 assume !(0 != main_~p1~0); 122043#L86-2 assume !(0 != main_~p2~0); 122041#L90-1 assume !(0 != main_~p3~0); 122037#L94-1 assume !(0 != main_~p4~0); 122033#L98-1 assume !(0 != main_~p5~0); 122029#L102-1 assume !(0 != main_~p6~0); 122025#L106-1 assume !(0 != main_~p7~0); 122021#L110-1 assume !(0 != main_~p8~0); 122017#L114-1 assume !(0 != main_~p9~0); 121959#L118-1 assume !(0 != main_~p10~0); 121948#L122-1 assume !(0 != main_~p11~0); 121949#L126-1 assume !(0 != main_~p12~0); 122163#L130-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 122160#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 122157#L138-1 assume !(0 != main_~p1~0); 122158#L144-1 assume !(0 != main_~p2~0); 122270#L149-1 assume !(0 != main_~p3~0); 122261#L154-1 assume !(0 != main_~p4~0); 122256#L159-1 assume !(0 != main_~p5~0); 122250#L164-1 assume !(0 != main_~p6~0); 122244#L169-1 assume !(0 != main_~p7~0); 122239#L174-1 assume !(0 != main_~p8~0); 122223#L179-1 assume !(0 != main_~p9~0); 122070#L184-1 assume !(0 != main_~p10~0); 122067#L189-1 assume !(0 != main_~p11~0); 122062#L194-1 assume !(0 != main_~p12~0); 122056#L199-1 assume !(0 != main_~p13~0); 122053#L204-1 assume !(0 != main_~p14~0); 121876#L209-1 [2019-01-01 22:12:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-01-01 22:12:19,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:19,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:19,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash 377682845, now seen corresponding path program 1 times [2019-01-01 22:12:19,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:19,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:19,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:19,441 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:19,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:19,441 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:19,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:19,443 INFO L87 Difference]: Start difference. First operand 39937 states and 58369 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2019-01-01 22:12:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:19,699 INFO L93 Difference]: Finished difference Result 78849 states and 113665 transitions. [2019-01-01 22:12:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:19,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78849 states and 113665 transitions. [2019-01-01 22:12:20,019 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2019-01-01 22:12:20,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78849 states to 78849 states and 113665 transitions. [2019-01-01 22:12:20,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78849 [2019-01-01 22:12:20,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78849 [2019-01-01 22:12:20,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78849 states and 113665 transitions. [2019-01-01 22:12:20,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:20,914 INFO L705 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-01-01 22:12:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78849 states and 113665 transitions. [2019-01-01 22:12:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78849 to 78849. [2019-01-01 22:12:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78849 states. [2019-01-01 22:12:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78849 states to 78849 states and 113665 transitions. [2019-01-01 22:12:21,681 INFO L728 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-01-01 22:12:21,681 INFO L608 BuchiCegarLoop]: Abstraction has 78849 states and 113665 transitions. [2019-01-01 22:12:21,681 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:12:21,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78849 states and 113665 transitions. [2019-01-01 22:12:22,305 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2019-01-01 22:12:22,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:22,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:22,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:22,307 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, 1, 1] [2019-01-01 22:12:22,308 INFO L794 eck$LassoCheckResult]: Stem: 240666#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 240667#L209-1 [2019-01-01 22:12:22,308 INFO L796 eck$LassoCheckResult]: Loop: 240667#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 240974#L53 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;main_~lk14~0 := 0; 240970#L86 assume !(0 != main_~p1~0); 240967#L86-2 assume !(0 != main_~p2~0); 240914#L90-1 assume !(0 != main_~p3~0); 240915#L94-1 assume !(0 != main_~p4~0); 240896#L98-1 assume !(0 != main_~p5~0); 240897#L102-1 assume !(0 != main_~p6~0); 240877#L106-1 assume !(0 != main_~p7~0); 240879#L110-1 assume !(0 != main_~p8~0); 240853#L114-1 assume !(0 != main_~p9~0); 240855#L118-1 assume !(0 != main_~p10~0); 240832#L122-1 assume !(0 != main_~p11~0); 240833#L126-1 assume !(0 != main_~p12~0); 240809#L130-1 assume !(0 != main_~p13~0); 240811#L134-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 240789#L138-1 assume !(0 != main_~p1~0); 240791#L144-1 assume !(0 != main_~p2~0); 241018#L149-1 assume !(0 != main_~p3~0); 241013#L154-1 assume !(0 != main_~p4~0); 241010#L159-1 assume !(0 != main_~p5~0); 241008#L164-1 assume !(0 != main_~p6~0); 241005#L169-1 assume !(0 != main_~p7~0); 241001#L174-1 assume !(0 != main_~p8~0); 240997#L179-1 assume !(0 != main_~p9~0); 240993#L184-1 assume !(0 != main_~p10~0); 240990#L189-1 assume !(0 != main_~p11~0); 240985#L194-1 assume !(0 != main_~p12~0); 240981#L199-1 assume !(0 != main_~p13~0); 240978#L204-1 assume !(0 != main_~p14~0); 240667#L209-1 [2019-01-01 22:12:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-01-01 22:12:22,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash -643385509, now seen corresponding path program 1 times [2019-01-01 22:12:22,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:22,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:22,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:22,387 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:22,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:22,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:12:22,388 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:22,389 INFO L87 Difference]: Start difference. First operand 78849 states and 113665 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2019-01-01 22:12:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:22,819 INFO L93 Difference]: Finished difference Result 155649 states and 221185 transitions. [2019-01-01 22:12:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:22,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155649 states and 221185 transitions. [2019-01-01 22:12:23,371 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2019-01-01 22:12:23,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155649 states to 155649 states and 221185 transitions. [2019-01-01 22:12:23,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155649 [2019-01-01 22:12:23,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155649 [2019-01-01 22:12:23,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155649 states and 221185 transitions. [2019-01-01 22:12:23,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:23,861 INFO L705 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-01-01 22:12:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155649 states and 221185 transitions. [2019-01-01 22:12:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155649 to 155649. [2019-01-01 22:12:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155649 states. [2019-01-01 22:12:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155649 states to 155649 states and 221185 transitions. [2019-01-01 22:12:26,331 INFO L728 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-01-01 22:12:26,331 INFO L608 BuchiCegarLoop]: Abstraction has 155649 states and 221185 transitions. [2019-01-01 22:12:26,331 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:12:26,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155649 states and 221185 transitions. [2019-01-01 22:12:26,674 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2019-01-01 22:12:26,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:26,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:26,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:26,676 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, 1, 1] [2019-01-01 22:12:26,676 INFO L794 eck$LassoCheckResult]: Stem: 475170#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_#t~nondet14, 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_~p14~0, main_~lk14~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;havoc main_~cond~0; 475171#L209-1 [2019-01-01 22:12:26,676 INFO L796 eck$LassoCheckResult]: Loop: 475171#L209-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 475767#L53 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;main_~lk14~0 := 0; 475763#L86 assume !(0 != main_~p1~0); 475759#L86-2 assume !(0 != main_~p2~0); 475756#L90-1 assume !(0 != main_~p3~0); 475754#L94-1 assume !(0 != main_~p4~0); 475752#L98-1 assume !(0 != main_~p5~0); 475749#L102-1 assume !(0 != main_~p6~0); 475742#L106-1 assume !(0 != main_~p7~0); 475743#L110-1 assume !(0 != main_~p8~0); 475747#L114-1 assume !(0 != main_~p9~0); 475745#L118-1 assume !(0 != main_~p10~0); 475744#L122-1 assume !(0 != main_~p11~0); 475700#L126-1 assume !(0 != main_~p12~0); 475696#L130-1 assume !(0 != main_~p13~0); 475692#L134-1 assume !(0 != main_~p14~0); 475689#L138-1 assume !(0 != main_~p1~0); 475679#L144-1 assume !(0 != main_~p2~0); 475681#L149-1 assume !(0 != main_~p3~0); 475803#L154-1 assume !(0 != main_~p4~0); 475801#L159-1 assume !(0 != main_~p5~0); 475797#L164-1 assume !(0 != main_~p6~0); 475794#L169-1 assume !(0 != main_~p7~0); 475790#L174-1 assume !(0 != main_~p8~0); 475786#L179-1 assume !(0 != main_~p9~0); 475783#L184-1 assume !(0 != main_~p10~0); 475781#L189-1 assume !(0 != main_~p11~0); 475777#L194-1 assume !(0 != main_~p12~0); 475774#L199-1 assume !(0 != main_~p13~0); 475771#L204-1 assume !(0 != main_~p14~0); 475171#L209-1 [2019-01-01 22:12:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 13 times [2019-01-01 22:12:26,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1923249187, now seen corresponding path program 1 times [2019-01-01 22:12:26,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:26,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash 361614268, now seen corresponding path program 1 times [2019-01-01 22:12:26,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:26,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:27,089 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 22:12:27,384 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 22:12:27,559 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 22:12:27,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:12:27 BoogieIcfgContainer [2019-01-01 22:12:27,616 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:12:27,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:12:27,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:12:27,618 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:12:27,619 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:13" (3/4) ... [2019-01-01 22:12:27,624 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:12:27,734 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:12:27,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:12:27,736 INFO L168 Benchmark]: Toolchain (without parser) took 15087.62 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 938.0 MB). Free memory was 943.3 MB in the beginning and 395.3 MB in the end (delta: 548.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-01 22:12:27,737 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:12:27,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.65 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:27,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.42 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:27,741 INFO L168 Benchmark]: Boogie Preprocessor took 110.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:27,742 INFO L168 Benchmark]: RCFGBuilder took 683.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:27,743 INFO L168 Benchmark]: BuchiAutomizer took 13691.91 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 798.5 MB). Free memory was 1.1 GB in the beginning and 395.3 MB in the end (delta: 701.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-01 22:12:27,745 INFO L168 Benchmark]: Witness Printer took 118.31 ms. Allocated memory is still 2.0 GB. Free memory is still 395.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:12:27,752 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.65 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 43.42 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 110.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 683.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13691.91 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 798.5 MB). Free memory was 1.1 GB in the beginning and 395.3 MB in the end (delta: 701.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 118.31 ms. Allocated memory is still 2.0 GB. Free memory is still 395.3 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 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155649 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.8s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 4.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.2s Buchi closure took 0.2s. Biggest automaton had 155649 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1312 SDtfs, 690 SDslu, 821 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 51]: 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@64d1c3b9=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b982c77=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49910188=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c78133d=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b8c8d51=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@571081c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3736a7b3=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d365c96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@782cd67a=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d974e85=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12edc566=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45015a9d=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37c734d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@761beee2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25564f56=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 51]: 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; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; Loop: [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 [L86] COND FALSE !(p1 != 0) [L90] COND FALSE !(p2 != 0) [L94] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L102] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L110] COND FALSE !(p7 != 0) [L114] COND FALSE !(p8 != 0) [L118] COND FALSE !(p9 != 0) [L122] COND FALSE !(p10 != 0) [L126] COND FALSE !(p11 != 0) [L130] COND FALSE !(p12 != 0) [L134] COND FALSE !(p13 != 0) [L138] COND FALSE !(p14 != 0) [L144] COND FALSE !(p1 != 0) [L149] COND FALSE !(p2 != 0) [L154] COND FALSE !(p3 != 0) [L159] COND FALSE !(p4 != 0) [L164] COND FALSE !(p5 != 0) [L169] COND FALSE !(p6 != 0) [L174] COND FALSE !(p7 != 0) [L179] COND FALSE !(p8 != 0) [L184] COND FALSE !(p9 != 0) [L189] COND FALSE !(p10 != 0) [L194] COND FALSE !(p11 != 0) [L199] COND FALSE !(p12 != 0) [L204] COND FALSE !(p13 != 0) [L209] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...