./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer --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 0f7b0b589689413087c164ce10eb80c902ee4046 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-1dbac8b [2018-11-10 07:40:34,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:40:34,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:40:34,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:40:34,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:40:34,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:40:34,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:40:34,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:40:34,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:40:34,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:40:34,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:40:34,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:40:34,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:40:34,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:40:34,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:40:34,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:40:34,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:40:34,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:40:34,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:40:34,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:40:34,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:40:34,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:40:34,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:40:34,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:40:34,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:40:34,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:40:34,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:40:34,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:40:34,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:40:34,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:40:34,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:40:34,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:40:34,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:40:34,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:40:34,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:40:34,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:40:34,124 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:40:34,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:40:34,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:40:34,136 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:40:34,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:40:34,136 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:40:34,136 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:40:34,136 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:40:34,136 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:40:34,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:40:34,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:40:34,138 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:40:34,139 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:40:34,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:40:34,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:40:34,139 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:40:34,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:40:34,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:40:34,139 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:40:34,140 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:40:34,140 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-10 07:40:34,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:40:34,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:40:34,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:40:34,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:40:34,177 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:40:34,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:40:34,222 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/data/f7c59fda9/804f672e652a491da6529e848c87f970/FLAG671779177 [2018-11-10 07:40:34,624 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:40:34,624 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:40:34,630 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/data/f7c59fda9/804f672e652a491da6529e848c87f970/FLAG671779177 [2018-11-10 07:40:34,641 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/data/f7c59fda9/804f672e652a491da6529e848c87f970 [2018-11-10 07:40:34,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:40:34,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:40:34,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:40:34,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:40:34,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:40:34,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34, skipping insertion in model container [2018-11-10 07:40:34,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:40:34,673 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:40:34,787 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:40:34,790 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:40:34,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:40:34,820 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:40:34,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34 WrapperNode [2018-11-10 07:40:34,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:40:34,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:40:34,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:40:34,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:40:34,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:40:34,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:40:34,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:40:34,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:40:34,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... [2018-11-10 07:40:34,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:40:34,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:40:34,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:40:34,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:40:34,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/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 [2018-11-10 07:40:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:40:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:40:35,147 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:40:35,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:40:35 BoogieIcfgContainer [2018-11-10 07:40:35,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:40:35,148 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:40:35,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:40:35,152 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:40:35,152 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:40:35,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:40:34" (1/3) ... [2018-11-10 07:40:35,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c9bea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:40:35, skipping insertion in model container [2018-11-10 07:40:35,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:40:35,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:34" (2/3) ... [2018-11-10 07:40:35,154 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c9bea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:40:35, skipping insertion in model container [2018-11-10 07:40:35,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:40:35,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:40:35" (3/3) ... [2018-11-10 07:40:35,155 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:40:35,193 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:40:35,194 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:40:35,194 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:40:35,194 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:40:35,194 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:40:35,194 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:40:35,194 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:40:35,194 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:40:35,194 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:40:35,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-10 07:40:35,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 07:40:35,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,224 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,224 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] [2018-11-10 07:40:35,224 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:40:35,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-10 07:40:35,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 07:40:35,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,226 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] [2018-11-10 07:40:35,231 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 18#L153-1true [2018-11-10 07:40:35,232 INFO L795 eck$LassoCheckResult]: Loop: 18#L153-1true assume true; 24#L39-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 28#L41true assume !(main_~cond~0 == 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; 39#L66true assume main_~p1~0 != 0;main_~lk1~0 := 1; 35#L66-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 23#L70-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 29#L74-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 16#L78-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 6#L82-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 33#L86-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 41#L90-1true assume !(main_~p8~0 != 0); 27#L94-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 12#L98-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 3#L102-1true assume !(main_~p1~0 != 0); 36#L108-1true assume !(main_~p2~0 != 0); 4#L113-1true assume !(main_~p3~0 != 0); 10#L118-1true assume !(main_~p4~0 != 0); 21#L123-1true assume !(main_~p5~0 != 0); 32#L128-1true assume !(main_~p6~0 != 0); 20#L133-1true assume !(main_~p7~0 != 0); 30#L138-1true assume !(main_~p8~0 != 0); 40#L143-1true assume !(main_~p9~0 != 0); 8#L148-1true assume !(main_~p10~0 != 0); 18#L153-1true [2018-11-10 07:40:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 07:40:35,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1961619935, now seen corresponding path program 1 times [2018-11-10 07:40:35,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,367 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,384 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-10 07:40:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,431 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-10 07:40:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 132 transitions. [2018-11-10 07:40:35,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-10 07:40:35,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 67 states and 105 transitions. [2018-11-10 07:40:35,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-11-10 07:40:35,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-10 07:40:35,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 105 transitions. [2018-11-10 07:40:35,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,443 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-10 07:40:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 105 transitions. [2018-11-10 07:40:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-10 07:40:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 07:40:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-11-10 07:40:35,471 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-10 07:40:35,471 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-11-10 07:40:35,471 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:40:35,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 105 transitions. [2018-11-10 07:40:35,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-10 07:40:35,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:40:35,474 INFO L793 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 141#L153-1 [2018-11-10 07:40:35,474 INFO L795 eck$LassoCheckResult]: Loop: 141#L153-1 assume true; 148#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 160#L41 assume !(main_~cond~0 == 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; 161#L66 assume !(main_~p1~0 != 0); 167#L66-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 152#L70-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 153#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 177#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 176#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 164#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 165#L90-1 assume !(main_~p8~0 != 0); 175#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 174#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 173#L102-1 assume !(main_~p1~0 != 0); 168#L108-1 assume !(main_~p2~0 != 0); 128#L113-1 assume !(main_~p3~0 != 0); 130#L118-1 assume !(main_~p4~0 != 0); 136#L123-1 assume !(main_~p5~0 != 0); 145#L128-1 assume !(main_~p6~0 != 0); 149#L133-1 assume !(main_~p7~0 != 0); 151#L138-1 assume !(main_~p8~0 != 0); 132#L143-1 assume !(main_~p9~0 != 0); 180#L148-1 assume !(main_~p10~0 != 0); 141#L153-1 [2018-11-10 07:40:35,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 07:40:35,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1515698911, now seen corresponding path program 1 times [2018-11-10 07:40:35,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:35,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,523 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,524 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. cyclomatic complexity: 40 Second operand 3 states. [2018-11-10 07:40:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,563 INFO L93 Difference]: Finished difference Result 130 states and 202 transitions. [2018-11-10 07:40:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 202 transitions. [2018-11-10 07:40:35,566 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-11-10 07:40:35,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 202 transitions. [2018-11-10 07:40:35,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 07:40:35,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 07:40:35,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 202 transitions. [2018-11-10 07:40:35,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,569 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 07:40:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 202 transitions. [2018-11-10 07:40:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 07:40:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 07:40:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2018-11-10 07:40:35,577 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 07:40:35,577 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 07:40:35,577 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:40:35,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 202 transitions. [2018-11-10 07:40:35,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-11-10 07:40:35,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,580 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] [2018-11-10 07:40:35,580 INFO L793 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 344#L153-1 [2018-11-10 07:40:35,580 INFO L795 eck$LassoCheckResult]: Loop: 344#L153-1 assume true; 392#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 390#L41 assume !(main_~cond~0 == 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; 386#L66 assume !(main_~p1~0 != 0); 387#L66-2 assume !(main_~p2~0 != 0); 355#L70-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 356#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 349#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 336#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 337#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 377#L90-1 assume !(main_~p8~0 != 0); 378#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 373#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 374#L102-1 assume !(main_~p1~0 != 0); 426#L108-1 assume !(main_~p2~0 != 0); 423#L113-1 assume !(main_~p3~0 != 0); 419#L118-1 assume !(main_~p4~0 != 0); 415#L123-1 assume !(main_~p5~0 != 0); 411#L128-1 assume !(main_~p6~0 != 0); 407#L133-1 assume !(main_~p7~0 != 0); 403#L138-1 assume !(main_~p8~0 != 0); 401#L143-1 assume !(main_~p9~0 != 0); 396#L148-1 assume !(main_~p10~0 != 0); 344#L153-1 [2018-11-10 07:40:35,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 07:40:35,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash -173244831, now seen corresponding path program 1 times [2018-11-10 07:40:35,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,619 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,620 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. cyclomatic complexity: 76 Second operand 3 states. [2018-11-10 07:40:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,640 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2018-11-10 07:40:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 390 transitions. [2018-11-10 07:40:35,643 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-11-10 07:40:35,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 390 transitions. [2018-11-10 07:40:35,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-10 07:40:35,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-11-10 07:40:35,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 390 transitions. [2018-11-10 07:40:35,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,648 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-10 07:40:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 390 transitions. [2018-11-10 07:40:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-10 07:40:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-10 07:40:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 390 transitions. [2018-11-10 07:40:35,665 INFO L728 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-10 07:40:35,665 INFO L608 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-11-10 07:40:35,665 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:40:35,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 390 transitions. [2018-11-10 07:40:35,668 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-11-10 07:40:35,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,669 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] [2018-11-10 07:40:35,669 INFO L793 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 733#L153-1 [2018-11-10 07:40:35,669 INFO L795 eck$LassoCheckResult]: Loop: 733#L153-1 assume true; 891#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 889#L41 assume !(main_~cond~0 == 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; 887#L66 assume !(main_~p1~0 != 0); 886#L66-2 assume !(main_~p2~0 != 0); 885#L70-1 assume !(main_~p3~0 != 0); 884#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 852#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 853#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 846#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 847#L90-1 assume !(main_~p8~0 != 0); 838#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 839#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 831#L102-1 assume !(main_~p1~0 != 0); 832#L108-1 assume !(main_~p2~0 != 0); 883#L113-1 assume !(main_~p3~0 != 0); 919#L118-1 assume !(main_~p4~0 != 0); 915#L123-1 assume !(main_~p5~0 != 0); 911#L128-1 assume !(main_~p6~0 != 0); 907#L133-1 assume !(main_~p7~0 != 0); 903#L138-1 assume !(main_~p8~0 != 0); 899#L143-1 assume !(main_~p9~0 != 0); 895#L148-1 assume !(main_~p10~0 != 0); 733#L153-1 [2018-11-10 07:40:35,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 07:40:35,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2127577759, now seen corresponding path program 1 times [2018-11-10 07:40:35,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,707 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,708 INFO L87 Difference]: Start difference. First operand 254 states and 390 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-11-10 07:40:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,723 INFO L93 Difference]: Finished difference Result 498 states and 754 transitions. [2018-11-10 07:40:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 754 transitions. [2018-11-10 07:40:35,727 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-11-10 07:40:35,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 754 transitions. [2018-11-10 07:40:35,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2018-11-10 07:40:35,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2018-11-10 07:40:35,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 754 transitions. [2018-11-10 07:40:35,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,733 INFO L705 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-10 07:40:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 754 transitions. [2018-11-10 07:40:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2018-11-10 07:40:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-11-10 07:40:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 754 transitions. [2018-11-10 07:40:35,747 INFO L728 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-10 07:40:35,747 INFO L608 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-11-10 07:40:35,747 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:40:35,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 754 transitions. [2018-11-10 07:40:35,750 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-11-10 07:40:35,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,751 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] [2018-11-10 07:40:35,752 INFO L793 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 1491#L153-1 [2018-11-10 07:40:35,752 INFO L795 eck$LassoCheckResult]: Loop: 1491#L153-1 assume true; 1567#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1563#L41 assume !(main_~cond~0 == 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; 1558#L66 assume !(main_~p1~0 != 0); 1552#L66-2 assume !(main_~p2~0 != 0); 1544#L70-1 assume !(main_~p3~0 != 0); 1546#L74-1 assume !(main_~p4~0 != 0); 1648#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1645#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1641#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1637#L90-1 assume !(main_~p8~0 != 0); 1633#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1630#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1626#L102-1 assume !(main_~p1~0 != 0); 1621#L108-1 assume !(main_~p2~0 != 0); 1617#L113-1 assume !(main_~p3~0 != 0); 1615#L118-1 assume !(main_~p4~0 != 0); 1614#L123-1 assume !(main_~p5~0 != 0); 1612#L128-1 assume !(main_~p6~0 != 0); 1610#L133-1 assume !(main_~p7~0 != 0); 1608#L138-1 assume !(main_~p8~0 != 0); 1606#L143-1 assume !(main_~p9~0 != 0); 1578#L148-1 assume !(main_~p10~0 != 0); 1491#L153-1 [2018-11-10 07:40:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 07:40:35,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash 539229857, now seen corresponding path program 1 times [2018-11-10 07:40:35,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,775 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,776 INFO L87 Difference]: Start difference. First operand 498 states and 754 transitions. cyclomatic complexity: 272 Second operand 3 states. [2018-11-10 07:40:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,804 INFO L93 Difference]: Finished difference Result 978 states and 1458 transitions. [2018-11-10 07:40:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 978 states and 1458 transitions. [2018-11-10 07:40:35,812 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-11-10 07:40:35,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 978 states to 978 states and 1458 transitions. [2018-11-10 07:40:35,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 978 [2018-11-10 07:40:35,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 978 [2018-11-10 07:40:35,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1458 transitions. [2018-11-10 07:40:35,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,821 INFO L705 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-10 07:40:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1458 transitions. [2018-11-10 07:40:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-11-10 07:40:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-11-10 07:40:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1458 transitions. [2018-11-10 07:40:35,840 INFO L728 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-10 07:40:35,840 INFO L608 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-11-10 07:40:35,840 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:40:35,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1458 transitions. [2018-11-10 07:40:35,843 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-11-10 07:40:35,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,844 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] [2018-11-10 07:40:35,844 INFO L793 eck$LassoCheckResult]: Stem: 3000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2972#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 2973#L153-1 [2018-11-10 07:40:35,844 INFO L795 eck$LassoCheckResult]: Loop: 2973#L153-1 assume true; 3184#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3182#L41 assume !(main_~cond~0 == 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; 3178#L66 assume !(main_~p1~0 != 0); 3174#L66-2 assume !(main_~p2~0 != 0); 3171#L70-1 assume !(main_~p3~0 != 0); 3172#L74-1 assume !(main_~p4~0 != 0); 3231#L78-1 assume !(main_~p5~0 != 0); 3229#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 3227#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 3225#L90-1 assume !(main_~p8~0 != 0); 3223#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 3221#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 3217#L102-1 assume !(main_~p1~0 != 0); 3214#L108-1 assume !(main_~p2~0 != 0); 3213#L113-1 assume !(main_~p3~0 != 0); 3211#L118-1 assume !(main_~p4~0 != 0); 3207#L123-1 assume !(main_~p5~0 != 0); 3204#L128-1 assume !(main_~p6~0 != 0); 3200#L133-1 assume !(main_~p7~0 != 0); 3196#L138-1 assume !(main_~p8~0 != 0); 3192#L143-1 assume !(main_~p9~0 != 0); 3188#L148-1 assume !(main_~p10~0 != 0); 2973#L153-1 [2018-11-10 07:40:35,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 07:40:35,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash -481838497, now seen corresponding path program 1 times [2018-11-10 07:40:35,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:35,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,865 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,865 INFO L87 Difference]: Start difference. First operand 978 states and 1458 transitions. cyclomatic complexity: 512 Second operand 3 states. [2018-11-10 07:40:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:35,884 INFO L93 Difference]: Finished difference Result 1922 states and 2818 transitions. [2018-11-10 07:40:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:35,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1922 states and 2818 transitions. [2018-11-10 07:40:35,900 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-11-10 07:40:35,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-11-10 07:40:35,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2018-11-10 07:40:35,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2018-11-10 07:40:35,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1922 states and 2818 transitions. [2018-11-10 07:40:35,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:35,914 INFO L705 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-10 07:40:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states and 2818 transitions. [2018-11-10 07:40:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2018-11-10 07:40:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-11-10 07:40:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-11-10 07:40:35,949 INFO L728 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-10 07:40:35,949 INFO L608 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-11-10 07:40:35,949 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:40:35,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1922 states and 2818 transitions. [2018-11-10 07:40:35,958 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-11-10 07:40:35,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:35,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:35,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:35,959 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] [2018-11-10 07:40:35,960 INFO L793 eck$LassoCheckResult]: Stem: 5909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 5879#L153-1 [2018-11-10 07:40:35,960 INFO L795 eck$LassoCheckResult]: Loop: 5879#L153-1 assume true; 6086#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 6084#L41 assume !(main_~cond~0 == 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; 6082#L66 assume !(main_~p1~0 != 0); 6033#L66-2 assume !(main_~p2~0 != 0); 6034#L70-1 assume !(main_~p3~0 != 0); 6015#L74-1 assume !(main_~p4~0 != 0); 6017#L78-1 assume !(main_~p5~0 != 0); 5994#L82-1 assume !(main_~p6~0 != 0); 5996#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 6143#L90-1 assume !(main_~p8~0 != 0); 6141#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 5963#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 5964#L102-1 assume !(main_~p1~0 != 0); 6117#L108-1 assume !(main_~p2~0 != 0); 6115#L113-1 assume !(main_~p3~0 != 0); 6113#L118-1 assume !(main_~p4~0 != 0); 6110#L123-1 assume !(main_~p5~0 != 0); 6106#L128-1 assume !(main_~p6~0 != 0); 6103#L133-1 assume !(main_~p7~0 != 0); 6099#L138-1 assume !(main_~p8~0 != 0); 6095#L143-1 assume !(main_~p9~0 != 0); 6091#L148-1 assume !(main_~p10~0 != 0); 5879#L153-1 [2018-11-10 07:40:35,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 07:40:35,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1761702175, now seen corresponding path program 1 times [2018-11-10 07:40:35,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:35,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:35,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:35,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:35,996 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:35,997 INFO L87 Difference]: Start difference. First operand 1922 states and 2818 transitions. cyclomatic complexity: 960 Second operand 3 states. [2018-11-10 07:40:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:36,026 INFO L93 Difference]: Finished difference Result 3778 states and 5442 transitions. [2018-11-10 07:40:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:36,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3778 states and 5442 transitions. [2018-11-10 07:40:36,048 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-11-10 07:40:36,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-11-10 07:40:36,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3778 [2018-11-10 07:40:36,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3778 [2018-11-10 07:40:36,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3778 states and 5442 transitions. [2018-11-10 07:40:36,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:36,074 INFO L705 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-10 07:40:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states and 5442 transitions. [2018-11-10 07:40:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3778. [2018-11-10 07:40:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3778 states. [2018-11-10 07:40:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-11-10 07:40:36,139 INFO L728 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-10 07:40:36,139 INFO L608 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-11-10 07:40:36,140 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:40:36,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3778 states and 5442 transitions. [2018-11-10 07:40:36,155 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-11-10 07:40:36,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:36,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:36,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:36,156 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] [2018-11-10 07:40:36,156 INFO L793 eck$LassoCheckResult]: Stem: 11615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 11585#L153-1 [2018-11-10 07:40:36,157 INFO L795 eck$LassoCheckResult]: Loop: 11585#L153-1 assume true; 11887#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11886#L41 assume !(main_~cond~0 == 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; 11884#L66 assume !(main_~p1~0 != 0); 11881#L66-2 assume !(main_~p2~0 != 0); 11877#L70-1 assume !(main_~p3~0 != 0); 11873#L74-1 assume !(main_~p4~0 != 0); 11870#L78-1 assume !(main_~p5~0 != 0); 11864#L82-1 assume !(main_~p6~0 != 0); 11866#L86-1 assume !(main_~p7~0 != 0); 11857#L90-1 assume !(main_~p8~0 != 0); 11858#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 11849#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 11850#L102-1 assume !(main_~p1~0 != 0); 11830#L108-1 assume !(main_~p2~0 != 0); 11831#L113-1 assume !(main_~p3~0 != 0); 11806#L118-1 assume !(main_~p4~0 != 0); 11808#L123-1 assume !(main_~p5~0 != 0); 11899#L128-1 assume !(main_~p6~0 != 0); 11896#L133-1 assume !(main_~p7~0 != 0); 11894#L138-1 assume !(main_~p8~0 != 0); 11892#L143-1 assume !(main_~p9~0 != 0); 11890#L148-1 assume !(main_~p10~0 != 0); 11585#L153-1 [2018-11-10 07:40:36,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 07:40:36,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1522147871, now seen corresponding path program 1 times [2018-11-10 07:40:36,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:36,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:36,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:40:36,177 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:36,177 INFO L87 Difference]: Start difference. First operand 3778 states and 5442 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2018-11-10 07:40:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:36,212 INFO L93 Difference]: Finished difference Result 7426 states and 10498 transitions. [2018-11-10 07:40:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:36,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7426 states and 10498 transitions. [2018-11-10 07:40:36,251 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-11-10 07:40:36,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-11-10 07:40:36,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7426 [2018-11-10 07:40:36,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7426 [2018-11-10 07:40:36,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7426 states and 10498 transitions. [2018-11-10 07:40:36,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:36,301 INFO L705 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-10 07:40:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states and 10498 transitions. [2018-11-10 07:40:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 7426. [2018-11-10 07:40:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2018-11-10 07:40:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-11-10 07:40:36,423 INFO L728 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-10 07:40:36,423 INFO L608 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-11-10 07:40:36,423 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:40:36,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7426 states and 10498 transitions. [2018-11-10 07:40:36,447 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-11-10 07:40:36,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:36,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:36,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:36,447 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] [2018-11-10 07:40:36,448 INFO L793 eck$LassoCheckResult]: Stem: 22828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 22795#L153-1 [2018-11-10 07:40:36,448 INFO L795 eck$LassoCheckResult]: Loop: 22795#L153-1 assume true; 22993#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22991#L41 assume !(main_~cond~0 == 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; 22986#L66 assume !(main_~p1~0 != 0); 22980#L66-2 assume !(main_~p2~0 != 0); 22974#L70-1 assume !(main_~p3~0 != 0); 22968#L74-1 assume !(main_~p4~0 != 0); 22960#L78-1 assume !(main_~p5~0 != 0); 22958#L82-1 assume !(main_~p6~0 != 0); 22959#L86-1 assume !(main_~p7~0 != 0); 23039#L90-1 assume !(main_~p8~0 != 0); 23036#L94-1 assume !(main_~p9~0 != 0); 23034#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 23031#L102-1 assume !(main_~p1~0 != 0); 23028#L108-1 assume !(main_~p2~0 != 0); 23023#L113-1 assume !(main_~p3~0 != 0); 23017#L118-1 assume !(main_~p4~0 != 0); 23013#L123-1 assume !(main_~p5~0 != 0); 23007#L128-1 assume !(main_~p6~0 != 0); 23004#L133-1 assume !(main_~p7~0 != 0); 23002#L138-1 assume !(main_~p8~0 != 0); 23000#L143-1 assume !(main_~p9~0 != 0); 22997#L148-1 assume !(main_~p10~0 != 0); 22795#L153-1 [2018-11-10 07:40:36,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 07:40:36,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1780313309, now seen corresponding path program 1 times [2018-11-10 07:40:36,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:40:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:40:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:40:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:40:36,465 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:40:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:40:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:40:36,465 INFO L87 Difference]: Start difference. First operand 7426 states and 10498 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2018-11-10 07:40:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:40:36,513 INFO L93 Difference]: Finished difference Result 14594 states and 20226 transitions. [2018-11-10 07:40:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:40:36,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14594 states and 20226 transitions. [2018-11-10 07:40:36,580 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-11-10 07:40:36,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-11-10 07:40:36,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14594 [2018-11-10 07:40:36,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14594 [2018-11-10 07:40:36,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14594 states and 20226 transitions. [2018-11-10 07:40:36,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:40:36,666 INFO L705 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-10 07:40:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14594 states and 20226 transitions. [2018-11-10 07:40:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14594 to 14594. [2018-11-10 07:40:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14594 states. [2018-11-10 07:40:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-11-10 07:40:36,894 INFO L728 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-10 07:40:36,894 INFO L608 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-11-10 07:40:36,894 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:40:36,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14594 states and 20226 transitions. [2018-11-10 07:40:36,935 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-11-10 07:40:36,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:40:36,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:40:36,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 07:40:36,936 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] [2018-11-10 07:40:36,936 INFO L793 eck$LassoCheckResult]: Stem: 44853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 44820#L153-1 [2018-11-10 07:40:36,937 INFO L795 eck$LassoCheckResult]: Loop: 44820#L153-1 assume true; 45307#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 45305#L41 assume !(main_~cond~0 == 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; 45303#L66 assume !(main_~p1~0 != 0); 45299#L66-2 assume !(main_~p2~0 != 0); 45292#L70-1 assume !(main_~p3~0 != 0); 45284#L74-1 assume !(main_~p4~0 != 0); 45277#L78-1 assume !(main_~p5~0 != 0); 45273#L82-1 assume !(main_~p6~0 != 0); 45265#L86-1 assume !(main_~p7~0 != 0); 45261#L90-1 assume !(main_~p8~0 != 0); 45253#L94-1 assume !(main_~p9~0 != 0); 45068#L98-1 assume !(main_~p10~0 != 0); 45070#L102-1 assume !(main_~p1~0 != 0); 45242#L108-1 assume !(main_~p2~0 != 0); 45229#L113-1 assume !(main_~p3~0 != 0); 45231#L118-1 assume !(main_~p4~0 != 0); 45212#L123-1 assume !(main_~p5~0 != 0); 45213#L128-1 assume !(main_~p6~0 != 0); 45322#L133-1 assume !(main_~p7~0 != 0); 45319#L138-1 assume !(main_~p8~0 != 0); 45314#L143-1 assume !(main_~p9~0 != 0); 45310#L148-1 assume !(main_~p10~0 != 0); 44820#L153-1 [2018-11-10 07:40:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 07:40:36,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1813589409, now seen corresponding path program 1 times [2018-11-10 07:40:36,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:40:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:40:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1849576355, now seen corresponding path program 1 times [2018-11-10 07:40:36,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:40:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:40:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:40:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:40:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:40:37,076 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-10 07:40:37,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:40:37 BoogieIcfgContainer [2018-11-10 07:40:37,192 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:40:37,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:40:37,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:40:37,193 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:40:37,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:40:35" (3/4) ... [2018-11-10 07:40:37,196 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 07:40:37,239 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_71c95aba-dbbb-4840-88fc-a47a5948a962/bin-2019/uautomizer/witness.graphml [2018-11-10 07:40:37,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:40:37,240 INFO L168 Benchmark]: Toolchain (without parser) took 2596.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,240 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:40:37,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,241 INFO L168 Benchmark]: Boogie Preprocessor took 16.85 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:40:37,241 INFO L168 Benchmark]: RCFGBuilder took 282.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,242 INFO L168 Benchmark]: BuchiAutomizer took 2043.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.0 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,242 INFO L168 Benchmark]: Witness Printer took 46.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:40:37,244 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 27.16 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.85 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 282.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2043.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.0 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. * Witness Printer took 46.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. 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 14594 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 14594 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 745 SDtfs, 383 SDslu, 454 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 39]: 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@492dd5db=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@466d7337=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41e7b68=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b68fef0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a0ab8b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4003f045=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f8a923=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35ce22ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4614f2e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b80d5fe=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d3df73f=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: 39]: 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; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...