./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_11_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_11_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 56f043bec3037ec37b4a132611abd4a337934428 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11:55,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:11:55,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:11:55,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:11:55,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:11:55,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:11:55,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:11:55,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:11:55,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:11:55,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:11:55,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:11:55,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:11:55,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:11:55,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:11:55,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:11:55,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:11:55,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:11:55,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:11:55,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:11:55,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:11:55,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:11:55,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:11:55,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:11:55,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:11:55,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:11:55,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:11:55,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:11:55,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:11:55,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:11:55,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:11:55,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:11:55,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:11:55,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:11:55,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:11:55,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:11:55,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:11:55,489 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:11:55,512 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:11:55,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:11:55,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:11:55,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:11:55,514 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:11:55,514 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:11:55,515 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:11:55,515 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:11:55,515 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:11:55,515 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:11:55,515 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:11:55,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:11:55,516 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:11:55,516 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:11:55,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:11:55,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:11:55,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:11:55,517 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:11:55,518 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:11:55,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:11:55,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:11:55,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:11:55,518 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:11:55,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:11:55,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:11:55,519 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:11:55,520 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:11:55,520 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-01-01 22:11:55,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:11:55,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:11:55,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:11:55,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:11:55,590 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:11:55,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:11:55,661 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078f78343/5e0fb5ffb5c34f35848e79a7dafe779f/FLAG4971c0a4a [2019-01-01 22:11:56,095 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:11:56,096 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:11:56,104 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078f78343/5e0fb5ffb5c34f35848e79a7dafe779f/FLAG4971c0a4a [2019-01-01 22:11:56,461 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078f78343/5e0fb5ffb5c34f35848e79a7dafe779f [2019-01-01 22:11:56,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:11:56,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:11:56,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:11:56,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:11:56,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:11:56,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4dae6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56, skipping insertion in model container [2019-01-01 22:11:56,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:11:56,511 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:11:56,757 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:11:56,764 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:11:56,796 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:11:56,812 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:11:56,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56 WrapperNode [2019-01-01 22:11:56,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:11:56,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:11:56,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:11:56,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:11:56,823 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:11:56" (1/1) ... [2019-01-01 22:11:56,829 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:11:56" (1/1) ... [2019-01-01 22:11:56,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:11:56,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:11:56,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:11:56,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:11:56,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (1/1) ... [2019-01-01 22:11:56,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:11:56,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:11:56,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:11:56,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:11:56,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (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:11:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:11:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:11:57,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:11:57,582 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:11:57,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:11:57 BoogieIcfgContainer [2019-01-01 22:11:57,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:11:57,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:11:57,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:11:57,587 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:11:57,588 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:11:57,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:11:56" (1/3) ... [2019-01-01 22:11:57,590 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a4a6ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:11:57, skipping insertion in model container [2019-01-01 22:11:57,590 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:11:57,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:11:56" (2/3) ... [2019-01-01 22:11:57,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a4a6ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:11:57, skipping insertion in model container [2019-01-01 22:11:57,591 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:11:57,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:11:57" (3/3) ... [2019-01-01 22:11:57,593 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-01 22:11:57,647 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:11:57,648 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:11:57,648 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:11:57,648 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:11:57,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:11:57,650 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:11:57,650 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:11:57,650 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:11:57,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:11:57,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2019-01-01 22:11:57,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-01 22:11:57,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:57,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:57,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:57,713 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] [2019-01-01 22:11:57,713 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:11:57,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2019-01-01 22:11:57,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-01-01 22:11:57,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:57,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:57,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:57,720 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] [2019-01-01 22:11:57,730 INFO L794 eck$LassoCheckResult]: Stem: 36#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_~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_~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;havoc main_~cond~0; 29#L167-1true [2019-01-01 22:11:57,732 INFO L796 eck$LassoCheckResult]: Loop: 29#L167-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 38#L44true 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; 7#L71true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L71-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 35#L75-1true assume !(0 != main_~p3~0); 43#L79-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L83-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 16#L87-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 3#L91-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L95-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 40#L99-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 30#L103-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 14#L107-1true assume !(0 != main_~p11~0); 23#L111-1true assume !(0 != main_~p1~0); 12#L117-1true assume !(0 != main_~p2~0); 24#L122-1true assume !(0 != main_~p3~0); 33#L127-1true assume !(0 != main_~p4~0); 41#L132-1true assume !(0 != main_~p5~0); 9#L137-1true assume !(0 != main_~p6~0); 21#L142-1true assume !(0 != main_~p7~0); 32#L147-1true assume !(0 != main_~p8~0); 39#L152-1true assume !(0 != main_~p9~0); 6#L157-1true assume !(0 != main_~p10~0); 18#L162-1true assume !(0 != main_~p11~0); 29#L167-1true [2019-01-01 22:11:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:11:57,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:57,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:57,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -504227868, now seen corresponding path program 1 times [2019-01-01 22:11:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:57,959 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:11:57,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:57,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:57,969 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:57,990 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-01-01 22:11:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:58,058 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2019-01-01 22:11:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:58,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 141 transitions. [2019-01-01 22:11:58,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 22:11:58,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 70 states and 112 transitions. [2019-01-01 22:11:58,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-01-01 22:11:58,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2019-01-01 22:11:58,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 112 transitions. [2019-01-01 22:11:58,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:58,078 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-01-01 22:11:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 112 transitions. [2019-01-01 22:11:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-01 22:11:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 22:11:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 112 transitions. [2019-01-01 22:11:58,120 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-01-01 22:11:58,120 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 112 transitions. [2019-01-01 22:11:58,120 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:11:58,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 112 transitions. [2019-01-01 22:11:58,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 22:11:58,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:58,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:58,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:58,124 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] [2019-01-01 22:11:58,124 INFO L794 eck$LassoCheckResult]: Stem: 171#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_~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_~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;havoc main_~cond~0; 172#L167-1 [2019-01-01 22:11:58,124 INFO L796 eck$LassoCheckResult]: Loop: 172#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 181#L44 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; 180#L71 assume !(0 != main_~p1~0); 132#L71-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 133#L75-1 assume !(0 != main_~p3~0); 170#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 167#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 156#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 130#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 131#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 173#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 174#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 153#L107-1 assume !(0 != main_~p11~0); 154#L111-1 assume !(0 != main_~p1~0); 148#L117-1 assume !(0 != main_~p2~0); 149#L122-1 assume !(0 != main_~p3~0); 160#L127-1 assume !(0 != main_~p4~0); 135#L132-1 assume !(0 != main_~p5~0); 141#L137-1 assume !(0 != main_~p6~0); 142#L142-1 assume !(0 != main_~p7~0); 152#L147-1 assume !(0 != main_~p8~0); 163#L152-1 assume !(0 != main_~p9~0); 169#L157-1 assume !(0 != main_~p10~0); 183#L162-1 assume !(0 != main_~p11~0); 172#L167-1 [2019-01-01 22:11:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 22:11:58,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash -285373150, now seen corresponding path program 1 times [2019-01-01 22:11:58,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:58,256 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:11:58,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:58,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:58,257 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:58,259 INFO L87 Difference]: Start difference. First operand 70 states and 112 transitions. cyclomatic complexity: 44 Second operand 3 states. [2019-01-01 22:11:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:58,389 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2019-01-01 22:11:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:58,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 217 transitions. [2019-01-01 22:11:58,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2019-01-01 22:11:58,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 217 transitions. [2019-01-01 22:11:58,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-01 22:11:58,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-01-01 22:11:58,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 217 transitions. [2019-01-01 22:11:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:58,410 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-01-01 22:11:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 217 transitions. [2019-01-01 22:11:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-01 22:11:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-01 22:11:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2019-01-01 22:11:58,429 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-01-01 22:11:58,429 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 217 transitions. [2019-01-01 22:11:58,430 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:11:58,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 217 transitions. [2019-01-01 22:11:58,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2019-01-01 22:11:58,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:58,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:58,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:58,438 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] [2019-01-01 22:11:58,438 INFO L794 eck$LassoCheckResult]: Stem: 383#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_~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_~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;havoc main_~cond~0; 384#L167-1 [2019-01-01 22:11:58,438 INFO L796 eck$LassoCheckResult]: Loop: 384#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 392#L44 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; 389#L71 assume !(0 != main_~p1~0); 390#L71-2 assume !(0 != main_~p2~0); 449#L75-1 assume !(0 != main_~p3~0); 447#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 445#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 443#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 441#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 439#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 437#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 435#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 434#L107-1 assume !(0 != main_~p11~0); 433#L111-1 assume !(0 != main_~p1~0); 430#L117-1 assume !(0 != main_~p2~0); 426#L122-1 assume !(0 != main_~p3~0); 423#L127-1 assume !(0 != main_~p4~0); 419#L132-1 assume !(0 != main_~p5~0); 415#L137-1 assume !(0 != main_~p6~0); 411#L142-1 assume !(0 != main_~p7~0); 407#L147-1 assume !(0 != main_~p8~0); 403#L152-1 assume !(0 != main_~p9~0); 399#L157-1 assume !(0 != main_~p10~0); 397#L162-1 assume !(0 != main_~p11~0); 384#L167-1 [2019-01-01 22:11:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 22:11:58,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:58,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 137328676, now seen corresponding path program 1 times [2019-01-01 22:11:58,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:58,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:58,532 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:11:58,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:58,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:58,533 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:58,534 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-01-01 22:11:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:58,633 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2019-01-01 22:11:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:58,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 421 transitions. [2019-01-01 22:11:58,638 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2019-01-01 22:11:58,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 269 states and 421 transitions. [2019-01-01 22:11:58,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 [2019-01-01 22:11:58,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2019-01-01 22:11:58,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 421 transitions. [2019-01-01 22:11:58,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:58,645 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-01-01 22:11:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 421 transitions. [2019-01-01 22:11:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-01-01 22:11:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-01 22:11:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 421 transitions. [2019-01-01 22:11:58,667 INFO L728 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-01-01 22:11:58,667 INFO L608 BuchiCegarLoop]: Abstraction has 269 states and 421 transitions. [2019-01-01 22:11:58,667 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:11:58,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 421 transitions. [2019-01-01 22:11:58,670 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2019-01-01 22:11:58,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:58,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:58,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:58,671 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] [2019-01-01 22:11:58,671 INFO L794 eck$LassoCheckResult]: Stem: 802#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_~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_~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;havoc main_~cond~0; 803#L167-1 [2019-01-01 22:11:58,672 INFO L796 eck$LassoCheckResult]: Loop: 803#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 817#L44 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; 818#L71 assume !(0 != main_~p1~0); 898#L71-2 assume !(0 != main_~p2~0); 896#L75-1 assume !(0 != main_~p3~0); 894#L79-1 assume !(0 != main_~p4~0); 892#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 890#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 888#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 886#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 884#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 882#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 880#L107-1 assume !(0 != main_~p11~0); 876#L111-1 assume !(0 != main_~p1~0); 872#L117-1 assume !(0 != main_~p2~0); 868#L122-1 assume !(0 != main_~p3~0); 866#L127-1 assume !(0 != main_~p4~0); 860#L132-1 assume !(0 != main_~p5~0); 859#L137-1 assume !(0 != main_~p6~0); 848#L142-1 assume !(0 != main_~p7~0); 847#L147-1 assume !(0 != main_~p8~0); 836#L152-1 assume !(0 != main_~p9~0); 835#L157-1 assume !(0 != main_~p10~0); 827#L162-1 assume !(0 != main_~p11~0); 803#L167-1 [2019-01-01 22:11:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 22:11:58,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:58,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1551615066, now seen corresponding path program 1 times [2019-01-01 22:11:58,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:58,727 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:11:58,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:58,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:58,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:58,729 INFO L87 Difference]: Start difference. First operand 269 states and 421 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-01-01 22:11:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:58,829 INFO L93 Difference]: Finished difference Result 529 states and 817 transitions. [2019-01-01 22:11:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:58,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 817 transitions. [2019-01-01 22:11:58,835 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2019-01-01 22:11:58,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 529 states and 817 transitions. [2019-01-01 22:11:58,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2019-01-01 22:11:58,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 529 [2019-01-01 22:11:58,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 817 transitions. [2019-01-01 22:11:58,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:58,850 INFO L705 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-01-01 22:11:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 817 transitions. [2019-01-01 22:11:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-01-01 22:11:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-01-01 22:11:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 817 transitions. [2019-01-01 22:11:58,877 INFO L728 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-01-01 22:11:58,877 INFO L608 BuchiCegarLoop]: Abstraction has 529 states and 817 transitions. [2019-01-01 22:11:58,878 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:11:58,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 817 transitions. [2019-01-01 22:11:58,882 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2019-01-01 22:11:58,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:58,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:58,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:58,883 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] [2019-01-01 22:11:58,883 INFO L794 eck$LassoCheckResult]: Stem: 1603#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_~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_~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;havoc main_~cond~0; 1604#L167-1 [2019-01-01 22:11:58,884 INFO L796 eck$LassoCheckResult]: Loop: 1604#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1704#L44 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; 1700#L71 assume !(0 != main_~p1~0); 1696#L71-2 assume !(0 != main_~p2~0); 1694#L75-1 assume !(0 != main_~p3~0); 1692#L79-1 assume !(0 != main_~p4~0); 1688#L83-1 assume !(0 != main_~p5~0); 1686#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1684#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1682#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1680#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1678#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1676#L107-1 assume !(0 != main_~p11~0); 1672#L111-1 assume !(0 != main_~p1~0); 1668#L117-1 assume !(0 != main_~p2~0); 1664#L122-1 assume !(0 != main_~p3~0); 1661#L127-1 assume !(0 != main_~p4~0); 1662#L132-1 assume !(0 != main_~p5~0); 1728#L137-1 assume !(0 != main_~p6~0); 1724#L142-1 assume !(0 != main_~p7~0); 1720#L147-1 assume !(0 != main_~p8~0); 1716#L152-1 assume !(0 != main_~p9~0); 1712#L157-1 assume !(0 != main_~p10~0); 1708#L162-1 assume !(0 != main_~p11~0); 1604#L167-1 [2019-01-01 22:11:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-01 22:11:58,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:58,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash 749207524, now seen corresponding path program 1 times [2019-01-01 22:11:58,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:58,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:58,936 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:11:58,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:58,937 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:58,939 INFO L87 Difference]: Start difference. First operand 529 states and 817 transitions. cyclomatic complexity: 304 Second operand 3 states. [2019-01-01 22:11:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:59,010 INFO L93 Difference]: Finished difference Result 1041 states and 1585 transitions. [2019-01-01 22:11:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:59,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1585 transitions. [2019-01-01 22:11:59,027 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2019-01-01 22:11:59,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1585 transitions. [2019-01-01 22:11:59,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2019-01-01 22:11:59,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1041 [2019-01-01 22:11:59,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1585 transitions. [2019-01-01 22:11:59,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:59,040 INFO L705 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-01-01 22:11:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1585 transitions. [2019-01-01 22:11:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-01-01 22:11:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-01-01 22:11:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1585 transitions. [2019-01-01 22:11:59,069 INFO L728 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-01-01 22:11:59,070 INFO L608 BuchiCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-01-01 22:11:59,070 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:11:59,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1041 states and 1585 transitions. [2019-01-01 22:11:59,079 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2019-01-01 22:11:59,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:59,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:59,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:59,080 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] [2019-01-01 22:11:59,080 INFO L794 eck$LassoCheckResult]: Stem: 3181#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_~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_~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;havoc main_~cond~0; 3182#L167-1 [2019-01-01 22:11:59,083 INFO L796 eck$LassoCheckResult]: Loop: 3182#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 3284#L44 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; 3280#L71 assume !(0 != main_~p1~0); 3276#L71-2 assume !(0 != main_~p2~0); 3274#L75-1 assume !(0 != main_~p3~0); 3272#L79-1 assume !(0 != main_~p4~0); 3268#L83-1 assume !(0 != main_~p5~0); 3264#L87-1 assume !(0 != main_~p6~0); 3262#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3260#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3258#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3256#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3254#L107-1 assume !(0 != main_~p11~0); 3250#L111-1 assume !(0 != main_~p1~0); 3246#L117-1 assume !(0 != main_~p2~0); 3242#L122-1 assume !(0 != main_~p3~0); 3239#L127-1 assume !(0 != main_~p4~0); 3240#L132-1 assume !(0 != main_~p5~0); 3307#L137-1 assume !(0 != main_~p6~0); 3304#L142-1 assume !(0 != main_~p7~0); 3300#L147-1 assume !(0 != main_~p8~0); 3296#L152-1 assume !(0 != main_~p9~0); 3292#L157-1 assume !(0 != main_~p10~0); 3288#L162-1 assume !(0 != main_~p11~0); 3182#L167-1 [2019-01-01 22:11:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-01 22:11:59,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -839140378, now seen corresponding path program 1 times [2019-01-01 22:11:59,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:59,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:11:59,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:59,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:59,155 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:59,156 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. cyclomatic complexity: 576 Second operand 3 states. [2019-01-01 22:11:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:59,238 INFO L93 Difference]: Finished difference Result 2049 states and 3073 transitions. [2019-01-01 22:11:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:59,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2049 states and 3073 transitions. [2019-01-01 22:11:59,263 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2019-01-01 22:11:59,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2049 states to 2049 states and 3073 transitions. [2019-01-01 22:11:59,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2049 [2019-01-01 22:11:59,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2049 [2019-01-01 22:11:59,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2049 states and 3073 transitions. [2019-01-01 22:11:59,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:59,289 INFO L705 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-01-01 22:11:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states and 3073 transitions. [2019-01-01 22:11:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-01-01 22:11:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-01-01 22:11:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3073 transitions. [2019-01-01 22:11:59,339 INFO L728 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-01-01 22:11:59,339 INFO L608 BuchiCegarLoop]: Abstraction has 2049 states and 3073 transitions. [2019-01-01 22:11:59,339 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:11:59,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2049 states and 3073 transitions. [2019-01-01 22:11:59,354 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2019-01-01 22:11:59,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:59,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:59,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:59,356 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] [2019-01-01 22:11:59,356 INFO L794 eck$LassoCheckResult]: Stem: 6279#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_~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_~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;havoc main_~cond~0; 6280#L167-1 [2019-01-01 22:11:59,356 INFO L796 eck$LassoCheckResult]: Loop: 6280#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 6452#L44 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; 6449#L71 assume !(0 != main_~p1~0); 6450#L71-2 assume !(0 != main_~p2~0); 6431#L75-1 assume !(0 != main_~p3~0); 6432#L79-1 assume !(0 != main_~p4~0); 6417#L83-1 assume !(0 != main_~p5~0); 6418#L87-1 assume !(0 != main_~p6~0); 6395#L91-1 assume !(0 != main_~p7~0); 6397#L95-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6381#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6382#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6366#L107-1 assume !(0 != main_~p11~0); 6367#L111-1 assume !(0 != main_~p1~0); 6485#L117-1 assume !(0 != main_~p2~0); 6483#L122-1 assume !(0 != main_~p3~0); 6481#L127-1 assume !(0 != main_~p4~0); 6479#L132-1 assume !(0 != main_~p5~0); 6477#L137-1 assume !(0 != main_~p6~0); 6473#L142-1 assume !(0 != main_~p7~0); 6470#L147-1 assume !(0 != main_~p8~0); 6464#L152-1 assume !(0 != main_~p9~0); 6460#L157-1 assume !(0 != main_~p10~0); 6456#L162-1 assume !(0 != main_~p11~0); 6280#L167-1 [2019-01-01 22:11:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-01 22:11:59,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:59,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1860208732, now seen corresponding path program 1 times [2019-01-01 22:11:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:59,434 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:11:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:59,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:59,435 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:59,435 INFO L87 Difference]: Start difference. First operand 2049 states and 3073 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2019-01-01 22:11:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:59,558 INFO L93 Difference]: Finished difference Result 4033 states and 5953 transitions. [2019-01-01 22:11:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:59,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4033 states and 5953 transitions. [2019-01-01 22:11:59,596 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2019-01-01 22:11:59,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4033 states to 4033 states and 5953 transitions. [2019-01-01 22:11:59,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4033 [2019-01-01 22:11:59,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4033 [2019-01-01 22:11:59,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4033 states and 5953 transitions. [2019-01-01 22:11:59,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:11:59,641 INFO L705 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-01-01 22:11:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states and 5953 transitions. [2019-01-01 22:11:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4033. [2019-01-01 22:11:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2019-01-01 22:11:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5953 transitions. [2019-01-01 22:11:59,736 INFO L728 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-01-01 22:11:59,736 INFO L608 BuchiCegarLoop]: Abstraction has 4033 states and 5953 transitions. [2019-01-01 22:11:59,737 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:11:59,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4033 states and 5953 transitions. [2019-01-01 22:11:59,765 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2019-01-01 22:11:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:11:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:11:59,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:11:59,767 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] [2019-01-01 22:11:59,767 INFO L794 eck$LassoCheckResult]: Stem: 12362#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_~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_~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;havoc main_~cond~0; 12363#L167-1 [2019-01-01 22:11:59,767 INFO L796 eck$LassoCheckResult]: Loop: 12363#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 12540#L44 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; 12537#L71 assume !(0 != main_~p1~0); 12538#L71-2 assume !(0 != main_~p2~0); 12517#L75-1 assume !(0 != main_~p3~0); 12518#L79-1 assume !(0 != main_~p4~0); 12501#L83-1 assume !(0 != main_~p5~0); 12503#L87-1 assume !(0 != main_~p6~0); 12477#L91-1 assume !(0 != main_~p7~0); 12479#L95-1 assume !(0 != main_~p8~0); 12457#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12458#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12441#L107-1 assume !(0 != main_~p11~0); 12442#L111-1 assume !(0 != main_~p1~0); 12573#L117-1 assume !(0 != main_~p2~0); 12571#L122-1 assume !(0 != main_~p3~0); 12569#L127-1 assume !(0 != main_~p4~0); 12567#L132-1 assume !(0 != main_~p5~0); 12563#L137-1 assume !(0 != main_~p6~0); 12559#L142-1 assume !(0 != main_~p7~0); 12555#L147-1 assume !(0 != main_~p8~0); 12552#L152-1 assume !(0 != main_~p9~0); 12548#L157-1 assume !(0 != main_~p10~0); 12544#L162-1 assume !(0 != main_~p11~0); 12363#L167-1 [2019-01-01 22:11:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-01 22:11:59,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:11:59,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:11:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:11:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1154894886, now seen corresponding path program 1 times [2019-01-01 22:11:59,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:11:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:11:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:11:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:11:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:11:59,856 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:11:59,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:11:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:11:59,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:11:59,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:11:59,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:11:59,858 INFO L87 Difference]: Start difference. First operand 4033 states and 5953 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2019-01-01 22:11:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:11:59,995 INFO L93 Difference]: Finished difference Result 7937 states and 11521 transitions. [2019-01-01 22:11:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:11:59,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7937 states and 11521 transitions. [2019-01-01 22:12:00,067 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2019-01-01 22:12:00,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7937 states to 7937 states and 11521 transitions. [2019-01-01 22:12:00,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7937 [2019-01-01 22:12:00,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7937 [2019-01-01 22:12:00,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7937 states and 11521 transitions. [2019-01-01 22:12:00,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:00,156 INFO L705 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-01-01 22:12:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7937 states and 11521 transitions. [2019-01-01 22:12:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7937 to 7937. [2019-01-01 22:12:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-01-01 22:12:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 11521 transitions. [2019-01-01 22:12:00,343 INFO L728 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-01-01 22:12:00,343 INFO L608 BuchiCegarLoop]: Abstraction has 7937 states and 11521 transitions. [2019-01-01 22:12:00,343 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:12:00,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7937 states and 11521 transitions. [2019-01-01 22:12:00,379 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2019-01-01 22:12:00,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:00,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:00,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:00,380 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] [2019-01-01 22:12:00,380 INFO L794 eck$LassoCheckResult]: Stem: 24344#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_~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_~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;havoc main_~cond~0; 24345#L167-1 [2019-01-01 22:12:00,383 INFO L796 eck$LassoCheckResult]: Loop: 24345#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 24451#L44 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; 24447#L71 assume !(0 != main_~p1~0); 24443#L71-2 assume !(0 != main_~p2~0); 24441#L75-1 assume !(0 != main_~p3~0); 24439#L79-1 assume !(0 != main_~p4~0); 24435#L83-1 assume !(0 != main_~p5~0); 24431#L87-1 assume !(0 != main_~p6~0); 24427#L91-1 assume !(0 != main_~p7~0); 24423#L95-1 assume !(0 != main_~p8~0); 24419#L99-1 assume !(0 != main_~p9~0); 24417#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24415#L107-1 assume !(0 != main_~p11~0); 24411#L111-1 assume !(0 != main_~p1~0); 24407#L117-1 assume !(0 != main_~p2~0); 24403#L122-1 assume !(0 != main_~p3~0); 24400#L127-1 assume !(0 != main_~p4~0); 24401#L132-1 assume !(0 != main_~p5~0); 24474#L137-1 assume !(0 != main_~p6~0); 24470#L142-1 assume !(0 != main_~p7~0); 24466#L147-1 assume !(0 != main_~p8~0); 24462#L152-1 assume !(0 != main_~p9~0); 24459#L157-1 assume !(0 != main_~p10~0); 24455#L162-1 assume !(0 != main_~p11~0); 24345#L167-1 [2019-01-01 22:12:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-01 22:12:00,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:00,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 143777636, now seen corresponding path program 1 times [2019-01-01 22:12:00,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:00,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:00,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:12:00,478 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:00,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:12:00,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:12:00,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:12:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:12:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:12:00,480 INFO L87 Difference]: Start difference. First operand 7937 states and 11521 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2019-01-01 22:12:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:12:00,632 INFO L93 Difference]: Finished difference Result 15617 states and 22273 transitions. [2019-01-01 22:12:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:12:00,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15617 states and 22273 transitions. [2019-01-01 22:12:00,805 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2019-01-01 22:12:00,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15617 states to 15617 states and 22273 transitions. [2019-01-01 22:12:00,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15617 [2019-01-01 22:12:00,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15617 [2019-01-01 22:12:00,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 22273 transitions. [2019-01-01 22:12:00,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:12:00,931 INFO L705 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-01-01 22:12:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 22273 transitions. [2019-01-01 22:12:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 15617. [2019-01-01 22:12:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2019-01-01 22:12:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 22273 transitions. [2019-01-01 22:12:01,172 INFO L728 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-01-01 22:12:01,172 INFO L608 BuchiCegarLoop]: Abstraction has 15617 states and 22273 transitions. [2019-01-01 22:12:01,172 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:12:01,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15617 states and 22273 transitions. [2019-01-01 22:12:01,228 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2019-01-01 22:12:01,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:12:01,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:12:01,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:12:01,229 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] [2019-01-01 22:12:01,230 INFO L794 eck$LassoCheckResult]: Stem: 47901#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_~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_~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;havoc main_~cond~0; 47902#L167-1 [2019-01-01 22:12:01,230 INFO L796 eck$LassoCheckResult]: Loop: 47902#L167-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 48083#L44 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; 48080#L71 assume !(0 != main_~p1~0); 48081#L71-2 assume !(0 != main_~p2~0); 48064#L75-1 assume !(0 != main_~p3~0); 48065#L79-1 assume !(0 != main_~p4~0); 48044#L83-1 assume !(0 != main_~p5~0); 48046#L87-1 assume !(0 != main_~p6~0); 48020#L91-1 assume !(0 != main_~p7~0); 48022#L95-1 assume !(0 != main_~p8~0); 47996#L99-1 assume !(0 != main_~p9~0); 47998#L103-1 assume !(0 != main_~p10~0); 47976#L107-1 assume !(0 != main_~p11~0); 47977#L111-1 assume !(0 != main_~p1~0); 48119#L117-1 assume !(0 != main_~p2~0); 48116#L122-1 assume !(0 != main_~p3~0); 48114#L127-1 assume !(0 != main_~p4~0); 48110#L132-1 assume !(0 != main_~p5~0); 48106#L137-1 assume !(0 != main_~p6~0); 48102#L142-1 assume !(0 != main_~p7~0); 48098#L147-1 assume !(0 != main_~p8~0); 48094#L152-1 assume !(0 != main_~p9~0); 48090#L157-1 assume !(0 != main_~p10~0); 48087#L162-1 assume !(0 != main_~p11~0); 47902#L167-1 [2019-01-01 22:12:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-01 22:12:01,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:01,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash -443028378, now seen corresponding path program 1 times [2019-01-01 22:12:01,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:01,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:12:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:12:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -412008571, now seen corresponding path program 1 times [2019-01-01 22:12:01,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:12:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:12:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:12:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:12:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:12:01,758 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 22:12:01,959 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 22:12:02,278 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 22:12:02,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:12:02 BoogieIcfgContainer [2019-01-01 22:12:02,360 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:12:02,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:12:02,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:12:02,360 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:12:02,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:11:57" (3/4) ... [2019-01-01 22:12:02,366 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:12:02,448 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:12:02,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:12:02,449 INFO L168 Benchmark]: Toolchain (without parser) took 5984.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.9 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -95.8 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:02,455 INFO L168 Benchmark]: CDTParser took 0.16 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:02,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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:02,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.46 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 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:02,457 INFO L168 Benchmark]: Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:12:02,457 INFO L168 Benchmark]: RCFGBuilder took 699.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:02,463 INFO L168 Benchmark]: BuchiAutomizer took 4776.47 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:12:02,465 INFO L168 Benchmark]: Witness Printer took 88.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:12:02,471 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 39.46 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 699.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4776.47 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. * Witness Printer took 88.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15617 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.7s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 15617 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 787 SDtfs, 411 SDslu, 482 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 42]: 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@5f73e165=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c73bbf6=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4149f8b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@770db869=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b771a9f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a2ffa54=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@439fc301=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a174cbd=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45a7c748=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7283d2ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d64ba9a=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@512af288=0, lk11=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: 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; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...