./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/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 f2cbbf56a13532141372a32a461d64a9d1351c0e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:30:11,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:30:11,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:30:11,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:30:11,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:30:11,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:30:11,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:30:11,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:30:11,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:30:11,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:30:11,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:30:11,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:30:11,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:30:11,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:30:11,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:30:11,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:30:11,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:30:11,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:30:11,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:30:11,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:30:11,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:30:11,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:30:11,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:30:11,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:30:11,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:30:11,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:30:11,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:30:11,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:30:11,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:30:11,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:30:11,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:30:11,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:30:11,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:30:11,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:30:11,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:30:11,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:30:11,779 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:30:11,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:30:11,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:30:11,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:30:11,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:30:11,791 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:30:11,791 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:30:11,791 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:30:11,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:30:11,792 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:30:11,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:30:11,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:30:11,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:30:11,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:30:11,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:30:11,795 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:30:11,796 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:30:11,796 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_46602a23-d3d8-454d-a609-5ff9b6299b89/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-10 10:30:11,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:30:11,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:30:11,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:30:11,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:30:11,831 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:30:11,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:30:11,875 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/data/3bb94db0e/754da435530940a9aaa317fcec032089/FLAG881be0319 [2018-11-10 10:30:12,273 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:30:12,274 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:30:12,279 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/data/3bb94db0e/754da435530940a9aaa317fcec032089/FLAG881be0319 [2018-11-10 10:30:12,288 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/data/3bb94db0e/754da435530940a9aaa317fcec032089 [2018-11-10 10:30:12,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:30:12,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:30:12,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:30:12,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:30:12,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:30:12,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12, skipping insertion in model container [2018-11-10 10:30:12,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:30:12,324 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:30:12,456 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:30:12,459 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:30:12,476 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:30:12,487 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:30:12,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12 WrapperNode [2018-11-10 10:30:12,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:30:12,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:30:12,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:30:12,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:30:12,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:30:12,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:30:12,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:30:12,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:30:12,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... [2018-11-10 10:30:12,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:30:12,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:30:12,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:30:12,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:30:12,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/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 10:30:12,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:30:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:30:12,762 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:30:12,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:30:12 BoogieIcfgContainer [2018-11-10 10:30:12,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:30:12,763 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:30:12,763 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:30:12,766 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:30:12,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:30:12,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:30:12" (1/3) ... [2018-11-10 10:30:12,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f2c4834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:30:12, skipping insertion in model container [2018-11-10 10:30:12,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:30:12,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:12" (2/3) ... [2018-11-10 10:30:12,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f2c4834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:30:12, skipping insertion in model container [2018-11-10 10:30:12,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:30:12,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:30:12" (3/3) ... [2018-11-10 10:30:12,770 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 10:30:12,806 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:30:12,807 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:30:12,807 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:30:12,807 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:30:12,807 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:30:12,807 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:30:12,807 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:30:12,807 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:30:12,808 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:30:12,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-10 10:30:12,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 10:30:12,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:12,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:12,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:12,838 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] [2018-11-10 10:30:12,838 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:30:12,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-10 10:30:12,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-10 10:30:12,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:12,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:12,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:12,840 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] [2018-11-10 10:30:12,846 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#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_~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_~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;havoc main_~cond~0; 24#L125-1true [2018-11-10 10:30:12,847 INFO L795 eck$LassoCheckResult]: Loop: 24#L125-1true assume true; 31#L33-1true assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 33#L35true 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; 18#L56true assume main_~p1~0 != 0;main_~lk1~0 := 1; 15#L56-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 5#L60-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 28#L64-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 34#L68-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 25#L72-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 14#L76-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 3#L80-1true assume !(main_~p8~0 != 0); 9#L84-1true assume !(main_~p1~0 != 0); 35#L90-1true assume !(main_~p2~0 != 0); 10#L95-1true assume !(main_~p3~0 != 0); 21#L100-1true assume !(main_~p4~0 != 0); 26#L105-1true assume !(main_~p5~0 != 0); 32#L110-1true assume !(main_~p6~0 != 0); 7#L115-1true assume !(main_~p7~0 != 0); 17#L120-1true assume !(main_~p8~0 != 0); 24#L125-1true [2018-11-10 10:30:12,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 10:30:12,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:12,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:12,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1996011056, now seen corresponding path program 1 times [2018-11-10 10:30:12,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:12,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:12,955 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 10:30:12,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:12,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:12,960 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:12,970 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-11-10 10:30:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,001 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2018-11-10 10:30:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 108 transitions. [2018-11-10 10:30:13,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-10 10:30:13,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 55 states and 85 transitions. [2018-11-10 10:30:13,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 10:30:13,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-10 10:30:13,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2018-11-10 10:30:13,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,009 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-10 10:30:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2018-11-10 10:30:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 10:30:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 10:30:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2018-11-10 10:30:13,031 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-10 10:30:13,031 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-10 10:30:13,031 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:30:13,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 85 transitions. [2018-11-10 10:30:13,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-10 10:30:13,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,033 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] [2018-11-10 10:30:13,033 INFO L793 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 124#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_~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_~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;havoc main_~cond~0; 125#L125-1 [2018-11-10 10:30:13,033 INFO L795 eck$LassoCheckResult]: Loop: 125#L125-1 assume true; 133#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L35 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; 142#L56 assume !(main_~p1~0 != 0); 143#L56-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 162#L60-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 161#L64-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 160#L68-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 159#L72-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 158#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 157#L80-1 assume !(main_~p8~0 != 0); 156#L84-1 assume !(main_~p1~0 != 0); 155#L90-1 assume !(main_~p2~0 != 0); 152#L95-1 assume !(main_~p3~0 != 0); 151#L100-1 assume !(main_~p4~0 != 0); 149#L105-1 assume !(main_~p5~0 != 0); 147#L110-1 assume !(main_~p6~0 != 0); 116#L115-1 assume !(main_~p7~0 != 0); 118#L120-1 assume !(main_~p8~0 != 0); 125#L125-1 [2018-11-10 10:30:13,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 10:30:13,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 974942702, now seen corresponding path program 1 times [2018-11-10 10:30:13,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,075 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 10:30:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,076 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,076 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-10 10:30:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,105 INFO L93 Difference]: Finished difference Result 106 states and 162 transitions. [2018-11-10 10:30:13,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 162 transitions. [2018-11-10 10:30:13,108 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-10 10:30:13,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 162 transitions. [2018-11-10 10:30:13,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2018-11-10 10:30:13,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2018-11-10 10:30:13,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 162 transitions. [2018-11-10 10:30:13,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,110 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 162 transitions. [2018-11-10 10:30:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 162 transitions. [2018-11-10 10:30:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-10 10:30:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 10:30:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2018-11-10 10:30:13,117 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 162 transitions. [2018-11-10 10:30:13,118 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 162 transitions. [2018-11-10 10:30:13,118 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:30:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 162 transitions. [2018-11-10 10:30:13,119 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-10 10:30:13,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,119 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] [2018-11-10 10:30:13,120 INFO L793 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 291#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_~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_~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;havoc main_~cond~0; 292#L125-1 [2018-11-10 10:30:13,120 INFO L795 eck$LassoCheckResult]: Loop: 292#L125-1 assume true; 302#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 308#L35 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; 315#L56 assume !(main_~p1~0 != 0); 316#L56-2 assume !(main_~p2~0 != 0); 279#L60-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 280#L64-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 307#L68-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 303#L72-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 304#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 336#L80-1 assume !(main_~p8~0 != 0); 332#L84-1 assume !(main_~p1~0 != 0); 330#L90-1 assume !(main_~p2~0 != 0); 331#L95-1 assume !(main_~p3~0 != 0); 379#L100-1 assume !(main_~p4~0 != 0); 377#L105-1 assume !(main_~p5~0 != 0); 359#L110-1 assume !(main_~p6~0 != 0); 322#L115-1 assume !(main_~p7~0 != 0); 320#L120-1 assume !(main_~p8~0 != 0); 292#L125-1 [2018-11-10 10:30:13,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 10:30:13,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash -304920976, now seen corresponding path program 1 times [2018-11-10 10:30:13,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,147 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 10:30:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,147 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,148 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-11-10 10:30:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,183 INFO L93 Difference]: Finished difference Result 206 states and 310 transitions. [2018-11-10 10:30:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 310 transitions. [2018-11-10 10:30:13,186 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2018-11-10 10:30:13,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 310 transitions. [2018-11-10 10:30:13,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2018-11-10 10:30:13,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2018-11-10 10:30:13,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 310 transitions. [2018-11-10 10:30:13,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,190 INFO L705 BuchiCegarLoop]: Abstraction has 206 states and 310 transitions. [2018-11-10 10:30:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 310 transitions. [2018-11-10 10:30:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-11-10 10:30:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-10 10:30:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2018-11-10 10:30:13,201 INFO L728 BuchiCegarLoop]: Abstraction has 206 states and 310 transitions. [2018-11-10 10:30:13,201 INFO L608 BuchiCegarLoop]: Abstraction has 206 states and 310 transitions. [2018-11-10 10:30:13,201 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:30:13,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 310 transitions. [2018-11-10 10:30:13,203 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2018-11-10 10:30:13,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,204 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] [2018-11-10 10:30:13,204 INFO L793 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 610#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_~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_~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;havoc main_~cond~0; 611#L125-1 [2018-11-10 10:30:13,204 INFO L795 eck$LassoCheckResult]: Loop: 611#L125-1 assume true; 670#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 659#L35 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; 660#L56 assume !(main_~p1~0 != 0); 665#L56-2 assume !(main_~p2~0 != 0); 666#L60-1 assume !(main_~p3~0 != 0); 709#L64-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 708#L68-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 707#L72-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 706#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 705#L80-1 assume !(main_~p8~0 != 0); 703#L84-1 assume !(main_~p1~0 != 0); 699#L90-1 assume !(main_~p2~0 != 0); 700#L95-1 assume !(main_~p3~0 != 0); 702#L100-1 assume !(main_~p4~0 != 0); 697#L105-1 assume !(main_~p5~0 != 0); 694#L110-1 assume !(main_~p6~0 != 0); 690#L115-1 assume !(main_~p7~0 != 0); 678#L120-1 assume !(main_~p8~0 != 0); 611#L125-1 [2018-11-10 10:30:13,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 10:30:13,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1316038226, now seen corresponding path program 1 times [2018-11-10 10:30:13,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,234 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 10:30:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,234 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,235 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. cyclomatic complexity: 112 Second operand 3 states. [2018-11-10 10:30:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,250 INFO L93 Difference]: Finished difference Result 402 states and 594 transitions. [2018-11-10 10:30:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 402 states and 594 transitions. [2018-11-10 10:30:13,253 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2018-11-10 10:30:13,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 402 states to 402 states and 594 transitions. [2018-11-10 10:30:13,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-11-10 10:30:13,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-11-10 10:30:13,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 594 transitions. [2018-11-10 10:30:13,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,256 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 594 transitions. [2018-11-10 10:30:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 594 transitions. [2018-11-10 10:30:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-11-10 10:30:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:30:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 594 transitions. [2018-11-10 10:30:13,268 INFO L728 BuchiCegarLoop]: Abstraction has 402 states and 594 transitions. [2018-11-10 10:30:13,269 INFO L608 BuchiCegarLoop]: Abstraction has 402 states and 594 transitions. [2018-11-10 10:30:13,269 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:30:13,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 594 transitions. [2018-11-10 10:30:13,271 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2018-11-10 10:30:13,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,272 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] [2018-11-10 10:30:13,272 INFO L793 eck$LassoCheckResult]: Stem: 1246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1223#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_~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_~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;havoc main_~cond~0; 1224#L125-1 [2018-11-10 10:30:13,272 INFO L795 eck$LassoCheckResult]: Loop: 1224#L125-1 assume true; 1303#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 1301#L35 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; 1298#L56 assume !(main_~p1~0 != 0); 1299#L56-2 assume !(main_~p2~0 != 0); 1345#L60-1 assume !(main_~p3~0 != 0); 1342#L64-1 assume !(main_~p4~0 != 0); 1340#L68-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1338#L72-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1336#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1334#L80-1 assume !(main_~p8~0 != 0); 1332#L84-1 assume !(main_~p1~0 != 0); 1330#L90-1 assume !(main_~p2~0 != 0); 1326#L95-1 assume !(main_~p3~0 != 0); 1322#L100-1 assume !(main_~p4~0 != 0); 1319#L105-1 assume !(main_~p5~0 != 0); 1315#L110-1 assume !(main_~p6~0 != 0); 1311#L115-1 assume !(main_~p7~0 != 0); 1307#L120-1 assume !(main_~p8~0 != 0); 1224#L125-1 [2018-11-10 10:30:13,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 10:30:13,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1902844240, now seen corresponding path program 1 times [2018-11-10 10:30:13,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,297 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 10:30:13,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,298 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,298 INFO L87 Difference]: Start difference. First operand 402 states and 594 transitions. cyclomatic complexity: 208 Second operand 3 states. [2018-11-10 10:30:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,324 INFO L93 Difference]: Finished difference Result 786 states and 1138 transitions. [2018-11-10 10:30:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1138 transitions. [2018-11-10 10:30:13,330 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2018-11-10 10:30:13,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 786 states and 1138 transitions. [2018-11-10 10:30:13,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2018-11-10 10:30:13,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2018-11-10 10:30:13,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1138 transitions. [2018-11-10 10:30:13,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,337 INFO L705 BuchiCegarLoop]: Abstraction has 786 states and 1138 transitions. [2018-11-10 10:30:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1138 transitions. [2018-11-10 10:30:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2018-11-10 10:30:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-11-10 10:30:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1138 transitions. [2018-11-10 10:30:13,358 INFO L728 BuchiCegarLoop]: Abstraction has 786 states and 1138 transitions. [2018-11-10 10:30:13,358 INFO L608 BuchiCegarLoop]: Abstraction has 786 states and 1138 transitions. [2018-11-10 10:30:13,358 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:30:13,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 786 states and 1138 transitions. [2018-11-10 10:30:13,361 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2018-11-10 10:30:13,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:13,362 INFO L793 eck$LassoCheckResult]: Stem: 2435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2416#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_~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_~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;havoc main_~cond~0; 2417#L125-1 [2018-11-10 10:30:13,362 INFO L795 eck$LassoCheckResult]: Loop: 2417#L125-1 assume true; 2512#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 2510#L35 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; 2506#L56 assume !(main_~p1~0 != 0); 2502#L56-2 assume !(main_~p2~0 != 0); 2498#L60-1 assume !(main_~p3~0 != 0); 2496#L64-1 assume !(main_~p4~0 != 0); 2492#L68-1 assume !(main_~p5~0 != 0); 2490#L72-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2488#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2486#L80-1 assume !(main_~p8~0 != 0); 2482#L84-1 assume !(main_~p1~0 != 0); 2478#L90-1 assume !(main_~p2~0 != 0); 2474#L95-1 assume !(main_~p3~0 != 0); 2471#L100-1 assume !(main_~p4~0 != 0); 2472#L105-1 assume !(main_~p5~0 != 0); 2524#L110-1 assume !(main_~p6~0 != 0); 2520#L115-1 assume !(main_~p7~0 != 0); 2516#L120-1 assume !(main_~p8~0 != 0); 2417#L125-1 [2018-11-10 10:30:13,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 10:30:13,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1644678802, now seen corresponding path program 1 times [2018-11-10 10:30:13,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,397 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 10:30:13,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,398 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,399 INFO L87 Difference]: Start difference. First operand 786 states and 1138 transitions. cyclomatic complexity: 384 Second operand 3 states. [2018-11-10 10:30:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,418 INFO L93 Difference]: Finished difference Result 1538 states and 2178 transitions. [2018-11-10 10:30:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1538 states and 2178 transitions. [2018-11-10 10:30:13,430 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2018-11-10 10:30:13,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1538 states to 1538 states and 2178 transitions. [2018-11-10 10:30:13,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1538 [2018-11-10 10:30:13,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1538 [2018-11-10 10:30:13,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1538 states and 2178 transitions. [2018-11-10 10:30:13,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,437 INFO L705 BuchiCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2018-11-10 10:30:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states and 2178 transitions. [2018-11-10 10:30:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2018-11-10 10:30:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-10 10:30:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2178 transitions. [2018-11-10 10:30:13,455 INFO L728 BuchiCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2018-11-10 10:30:13,455 INFO L608 BuchiCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2018-11-10 10:30:13,455 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:30:13,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1538 states and 2178 transitions. [2018-11-10 10:30:13,461 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2018-11-10 10:30:13,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,461 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] [2018-11-10 10:30:13,462 INFO L793 eck$LassoCheckResult]: Stem: 4772#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4746#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_~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_~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;havoc main_~cond~0; 4747#L125-1 [2018-11-10 10:30:13,462 INFO L795 eck$LassoCheckResult]: Loop: 4747#L125-1 assume true; 4908#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 4907#L35 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; 4905#L56 assume !(main_~p1~0 != 0); 4903#L56-2 assume !(main_~p2~0 != 0); 4899#L60-1 assume !(main_~p3~0 != 0); 4896#L64-1 assume !(main_~p4~0 != 0); 4890#L68-1 assume !(main_~p5~0 != 0); 4892#L72-1 assume !(main_~p6~0 != 0); 4880#L76-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4881#L80-1 assume !(main_~p8~0 != 0); 4872#L84-1 assume !(main_~p1~0 != 0); 4873#L90-1 assume !(main_~p2~0 != 0); 4859#L95-1 assume !(main_~p3~0 != 0); 4860#L100-1 assume !(main_~p4~0 != 0); 4915#L105-1 assume !(main_~p5~0 != 0); 4913#L110-1 assume !(main_~p6~0 != 0); 4912#L115-1 assume !(main_~p7~0 != 0); 4910#L120-1 assume !(main_~p8~0 != 0); 4747#L125-1 [2018-11-10 10:30:13,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 10:30:13,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash -943614224, now seen corresponding path program 1 times [2018-11-10 10:30:13,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:13,483 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 10:30:13,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:13,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:13,483 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:13,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:13,484 INFO L87 Difference]: Start difference. First operand 1538 states and 2178 transitions. cyclomatic complexity: 704 Second operand 3 states. [2018-11-10 10:30:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:13,503 INFO L93 Difference]: Finished difference Result 3010 states and 4162 transitions. [2018-11-10 10:30:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:13,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3010 states and 4162 transitions. [2018-11-10 10:30:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2018-11-10 10:30:13,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3010 states to 3010 states and 4162 transitions. [2018-11-10 10:30:13,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3010 [2018-11-10 10:30:13,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3010 [2018-11-10 10:30:13,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3010 states and 4162 transitions. [2018-11-10 10:30:13,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:30:13,539 INFO L705 BuchiCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2018-11-10 10:30:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states and 4162 transitions. [2018-11-10 10:30:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3010. [2018-11-10 10:30:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2018-11-10 10:30:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4162 transitions. [2018-11-10 10:30:13,592 INFO L728 BuchiCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2018-11-10 10:30:13,592 INFO L608 BuchiCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2018-11-10 10:30:13,592 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:30:13,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3010 states and 4162 transitions. [2018-11-10 10:30:13,605 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2018-11-10 10:30:13,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:13,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:13,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:30:13,606 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] [2018-11-10 10:30:13,606 INFO L793 eck$LassoCheckResult]: Stem: 9321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9299#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_~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_~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;havoc main_~cond~0; 9300#L125-1 [2018-11-10 10:30:13,606 INFO L795 eck$LassoCheckResult]: Loop: 9300#L125-1 assume true; 9429#L33-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 9427#L35 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; 9425#L56 assume !(main_~p1~0 != 0); 9417#L56-2 assume !(main_~p2~0 != 0); 9419#L60-1 assume !(main_~p3~0 != 0); 9407#L64-1 assume !(main_~p4~0 != 0); 9409#L68-1 assume !(main_~p5~0 != 0); 9395#L72-1 assume !(main_~p6~0 != 0); 9397#L76-1 assume !(main_~p7~0 != 0); 9385#L80-1 assume !(main_~p8~0 != 0); 9386#L84-1 assume !(main_~p1~0 != 0); 9449#L90-1 assume !(main_~p2~0 != 0); 9447#L95-1 assume !(main_~p3~0 != 0); 9445#L100-1 assume !(main_~p4~0 != 0); 9443#L105-1 assume !(main_~p5~0 != 0); 9441#L110-1 assume !(main_~p6~0 != 0); 9437#L115-1 assume !(main_~p7~0 != 0); 9434#L120-1 assume !(main_~p8~0 != 0); 9300#L125-1 [2018-11-10 10:30:13,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 10:30:13,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1336641234, now seen corresponding path program 1 times [2018-11-10 10:30:13,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash 511445548, now seen corresponding path program 1 times [2018-11-10 10:30:13,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:13,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:30:13 BoogieIcfgContainer [2018-11-10 10:30:13,780 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:30:13,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:30:13,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:30:13,781 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:30:13,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:30:12" (3/4) ... [2018-11-10 10:30:13,784 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 10:30:13,822 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_46602a23-d3d8-454d-a609-5ff9b6299b89/bin-2019/uautomizer/witness.graphml [2018-11-10 10:30:13,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:30:13,823 INFO L168 Benchmark]: Toolchain (without parser) took 1531.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 959.2 MB in the beginning and 956.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 141.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:13,824 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 10:30:13,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.77 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 10:30:13,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.76 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 10:30:13,825 INFO L168 Benchmark]: Boogie Preprocessor took 12.83 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 10:30:13,825 INFO L168 Benchmark]: RCFGBuilder took 238.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:13,826 INFO L168 Benchmark]: BuchiAutomizer took 1017.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 156.8 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:13,826 INFO L168 Benchmark]: Witness Printer took 41.65 ms. Allocated memory is still 1.2 GB. Free memory was 959.6 MB in the beginning and 956.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:30:13,828 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 195.77 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 22.76 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 12.83 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 238.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1017.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 156.8 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.65 ms. Allocated memory is still 1.2 GB. Free memory was 959.6 MB in the beginning and 956.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 3010 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 3010 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 478 SDtfs, 243 SDslu, 284 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 33]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@291933c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bd351b2=1, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d5ee89b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@da3ff7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a3f7b9c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73d91714=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b656705=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78fdfecc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d4e982f=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: 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; [L31] int cond; Loop: [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...