./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7_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_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:43:57,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:43:57,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:43:57,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:43:57,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:43:57,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:43:57,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:43:57,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:43:57,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:43:57,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:43:57,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:43:57,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:43:57,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:43:57,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:43:57,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:43:57,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:43:57,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:43:57,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:43:57,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:43:57,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:43:57,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:43:57,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:43:57,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:43:57,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:43:57,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:43:57,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:43:57,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:43:57,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:43:57,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:43:57,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:43:57,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:43:57,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:43:57,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:43:57,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:43:57,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:43:57,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:43:57,978 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:43:57,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:43:57,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:43:57,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:43:57,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:43:57,991 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:43:57,991 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:43:57,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:43:57,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:43:57,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:43:57,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:43:57,994 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:43:57,995 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:43:57,995 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_d7106c62-ef53-41a7-9a48-324644866bb5/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-10 04:43:58,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:43:58,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:43:58,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:43:58,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:43:58,031 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:43:58,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:43:58,070 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/data/6bc57f6a0/650bc34cb79348f18768dc96f05cb0b2/FLAGf3cd649fe [2018-11-10 04:43:58,366 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:43:58,366 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:43:58,370 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/data/6bc57f6a0/650bc34cb79348f18768dc96f05cb0b2/FLAGf3cd649fe [2018-11-10 04:43:58,381 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/data/6bc57f6a0/650bc34cb79348f18768dc96f05cb0b2 [2018-11-10 04:43:58,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:43:58,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:43:58,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:43:58,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:43:58,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:43:58,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50020d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58, skipping insertion in model container [2018-11-10 04:43:58,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:43:58,407 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:43:58,499 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:43:58,501 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:43:58,514 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:43:58,522 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:43:58,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58 WrapperNode [2018-11-10 04:43:58,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:43:58,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:43:58,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:43:58,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:43:58,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:43:58,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:43:58,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:43:58,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:43:58,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... [2018-11-10 04:43:58,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:43:58,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:43:58,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:43:58,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:43:58,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/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 04:43:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:43:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:43:58,785 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:43:58,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:43:58 BoogieIcfgContainer [2018-11-10 04:43:58,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:43:58,786 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:43:58,786 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:43:58,789 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:43:58,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:43:58,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:43:58" (1/3) ... [2018-11-10 04:43:58,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c47018f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:43:58, skipping insertion in model container [2018-11-10 04:43:58,791 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:43:58,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:43:58" (2/3) ... [2018-11-10 04:43:58,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c47018f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:43:58, skipping insertion in model container [2018-11-10 04:43:58,792 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:43:58,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:43:58" (3/3) ... [2018-11-10 04:43:58,794 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:43:58,842 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:43:58,843 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:43:58,843 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:43:58,843 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:43:58,843 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:43:58,843 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:43:58,844 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:43:58,844 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:43:58,844 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:43:58,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 04:43:58,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-10 04:43:58,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:58,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:58,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:58,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:58,881 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:43:58,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 04:43:58,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-10 04:43:58,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:58,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:58,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:58,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:58,889 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#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_~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_~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;havoc main_~cond~0; 19#L111-1true [2018-11-10 04:43:58,889 INFO L795 eck$LassoCheckResult]: Loop: 19#L111-1true assume true; 25#L30-1true assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 12#L32true 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; 8#L51true assume main_~p1~0 != 0;main_~lk1~0 := 1; 6#L51-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 31#L55-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 21#L59-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 26#L63-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 16#L67-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 4#L71-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 27#L75-1true assume !(main_~p1~0 != 0); 22#L81-1true assume !(main_~p2~0 != 0); 29#L86-1true assume !(main_~p3~0 != 0); 3#L91-1true assume !(main_~p4~0 != 0); 11#L96-1true assume !(main_~p5~0 != 0); 33#L101-1true assume !(main_~p6~0 != 0); 9#L106-1true assume !(main_~p7~0 != 0); 19#L111-1true [2018-11-10 04:43:58,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 04:43:58,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:58,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:58,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1664994326, now seen corresponding path program 1 times [2018-11-10 04:43:58,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:58,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:58,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,023 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 04:43:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,027 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,037 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-10 04:43:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,065 INFO L93 Difference]: Finished difference Result 59 states and 96 transitions. [2018-11-10 04:43:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 96 transitions. [2018-11-10 04:43:59,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-10 04:43:59,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 49 states and 75 transitions. [2018-11-10 04:43:59,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 04:43:59,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 04:43:59,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 75 transitions. [2018-11-10 04:43:59,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,072 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 04:43:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 75 transitions. [2018-11-10 04:43:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 04:43:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 04:43:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-10 04:43:59,095 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 04:43:59,095 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 04:43:59,095 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:43:59,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 75 transitions. [2018-11-10 04:43:59,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2018-11-10 04:43:59,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,097 INFO L793 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 114#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_~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_~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;havoc main_~cond~0; 115#L111-1 [2018-11-10 04:43:59,097 INFO L795 eck$LassoCheckResult]: Loop: 115#L111-1 assume true; 122#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 137#L32 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; 136#L51 assume !(main_~p1~0 != 0); 135#L51-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 134#L55-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 133#L59-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 128#L63-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 121#L67-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 102#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 103#L75-1 assume !(main_~p1~0 != 0); 125#L81-1 assume !(main_~p2~0 != 0); 120#L86-1 assume !(main_~p3~0 != 0); 99#L91-1 assume !(main_~p4~0 != 0); 100#L96-1 assume !(main_~p5~0 != 0); 141#L101-1 assume !(main_~p6~0 != 0); 139#L106-1 assume !(main_~p7~0 != 0); 115#L111-1 [2018-11-10 04:43:59,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 04:43:59,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1618855720, now seen corresponding path program 1 times [2018-11-10 04:43:59,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,129 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 04:43:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,130 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,130 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-10 04:43:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,148 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2018-11-10 04:43:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 142 transitions. [2018-11-10 04:43:59,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-10 04:43:59,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 142 transitions. [2018-11-10 04:43:59,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-10 04:43:59,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-11-10 04:43:59,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 142 transitions. [2018-11-10 04:43:59,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,151 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 142 transitions. [2018-11-10 04:43:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 142 transitions. [2018-11-10 04:43:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-10 04:43:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 04:43:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2018-11-10 04:43:59,156 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 142 transitions. [2018-11-10 04:43:59,156 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 142 transitions. [2018-11-10 04:43:59,156 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:43:59,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 142 transitions. [2018-11-10 04:43:59,157 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2018-11-10 04:43:59,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,158 INFO L793 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 263#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_~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_~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;havoc main_~cond~0; 264#L111-1 [2018-11-10 04:43:59,158 INFO L795 eck$LassoCheckResult]: Loop: 264#L111-1 assume true; 300#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 298#L32 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; 296#L51 assume !(main_~p1~0 != 0); 293#L51-2 assume !(main_~p2~0 != 0); 291#L55-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 289#L59-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 287#L63-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 285#L67-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 283#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 280#L75-1 assume !(main_~p1~0 != 0); 281#L81-1 assume !(main_~p2~0 != 0); 320#L86-1 assume !(main_~p3~0 != 0); 316#L91-1 assume !(main_~p4~0 != 0); 311#L96-1 assume !(main_~p5~0 != 0); 308#L101-1 assume !(main_~p6~0 != 0); 304#L106-1 assume !(main_~p7~0 != 0); 264#L111-1 [2018-11-10 04:43:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 04:43:59,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1032049706, now seen corresponding path program 1 times [2018-11-10 04:43:59,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,185 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 04:43:59,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,185 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,186 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-11-10 04:43:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,200 INFO L93 Difference]: Finished difference Result 182 states and 270 transitions. [2018-11-10 04:43:59,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 270 transitions. [2018-11-10 04:43:59,202 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2018-11-10 04:43:59,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 270 transitions. [2018-11-10 04:43:59,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2018-11-10 04:43:59,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2018-11-10 04:43:59,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 270 transitions. [2018-11-10 04:43:59,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,204 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 270 transitions. [2018-11-10 04:43:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 270 transitions. [2018-11-10 04:43:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-10 04:43:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 04:43:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 270 transitions. [2018-11-10 04:43:59,213 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 270 transitions. [2018-11-10 04:43:59,213 INFO L608 BuchiCegarLoop]: Abstraction has 182 states and 270 transitions. [2018-11-10 04:43:59,213 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:43:59,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 270 transitions. [2018-11-10 04:43:59,215 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2018-11-10 04:43:59,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,216 INFO L793 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 545#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_~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_~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;havoc main_~cond~0; 546#L111-1 [2018-11-10 04:43:59,216 INFO L795 eck$LassoCheckResult]: Loop: 546#L111-1 assume true; 606#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 602#L32 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; 598#L51 assume !(main_~p1~0 != 0); 592#L51-2 assume !(main_~p2~0 != 0); 586#L55-1 assume !(main_~p3~0 != 0); 587#L59-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 652#L63-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 649#L67-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 648#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 569#L75-1 assume !(main_~p1~0 != 0); 570#L81-1 assume !(main_~p2~0 != 0); 642#L86-1 assume !(main_~p3~0 != 0); 633#L91-1 assume !(main_~p4~0 != 0); 626#L96-1 assume !(main_~p5~0 != 0); 625#L101-1 assume !(main_~p6~0 != 0); 615#L106-1 assume !(main_~p7~0 != 0); 546#L111-1 [2018-11-10 04:43:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 04:43:59,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1290215144, now seen corresponding path program 1 times [2018-11-10 04:43:59,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,246 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 04:43:59,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,247 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,247 INFO L87 Difference]: Start difference. First operand 182 states and 270 transitions. cyclomatic complexity: 96 Second operand 3 states. [2018-11-10 04:43:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,266 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2018-11-10 04:43:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 514 transitions. [2018-11-10 04:43:59,271 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 352 [2018-11-10 04:43:59,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 354 states and 514 transitions. [2018-11-10 04:43:59,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2018-11-10 04:43:59,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2018-11-10 04:43:59,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 514 transitions. [2018-11-10 04:43:59,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,277 INFO L705 BuchiCegarLoop]: Abstraction has 354 states and 514 transitions. [2018-11-10 04:43:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 514 transitions. [2018-11-10 04:43:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2018-11-10 04:43:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-10 04:43:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 514 transitions. [2018-11-10 04:43:59,291 INFO L728 BuchiCegarLoop]: Abstraction has 354 states and 514 transitions. [2018-11-10 04:43:59,291 INFO L608 BuchiCegarLoop]: Abstraction has 354 states and 514 transitions. [2018-11-10 04:43:59,291 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:43:59,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 514 transitions. [2018-11-10 04:43:59,293 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 352 [2018-11-10 04:43:59,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,293 INFO L793 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1087#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_~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_~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;havoc main_~cond~0; 1088#L111-1 [2018-11-10 04:43:59,294 INFO L795 eck$LassoCheckResult]: Loop: 1088#L111-1 assume true; 1130#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 1126#L32 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; 1121#L51 assume !(main_~p1~0 != 0); 1122#L51-2 assume !(main_~p2~0 != 0); 1193#L55-1 assume !(main_~p3~0 != 0); 1188#L59-1 assume !(main_~p4~0 != 0); 1184#L63-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1180#L67-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1176#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1168#L75-1 assume !(main_~p1~0 != 0); 1160#L81-1 assume !(main_~p2~0 != 0); 1148#L86-1 assume !(main_~p3~0 != 0); 1146#L91-1 assume !(main_~p4~0 != 0); 1144#L96-1 assume !(main_~p5~0 != 0); 1143#L101-1 assume !(main_~p6~0 != 0); 1141#L106-1 assume !(main_~p7~0 != 0); 1088#L111-1 [2018-11-10 04:43:59,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 04:43:59,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1991279722, now seen corresponding path program 1 times [2018-11-10 04:43:59,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,314 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 04:43:59,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,314 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,315 INFO L87 Difference]: Start difference. First operand 354 states and 514 transitions. cyclomatic complexity: 176 Second operand 3 states. [2018-11-10 04:43:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,328 INFO L93 Difference]: Finished difference Result 690 states and 978 transitions. [2018-11-10 04:43:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 978 transitions. [2018-11-10 04:43:59,332 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 688 [2018-11-10 04:43:59,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 690 states and 978 transitions. [2018-11-10 04:43:59,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2018-11-10 04:43:59,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2018-11-10 04:43:59,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 690 states and 978 transitions. [2018-11-10 04:43:59,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,338 INFO L705 BuchiCegarLoop]: Abstraction has 690 states and 978 transitions. [2018-11-10 04:43:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states and 978 transitions. [2018-11-10 04:43:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2018-11-10 04:43:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-10 04:43:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 978 transitions. [2018-11-10 04:43:59,350 INFO L728 BuchiCegarLoop]: Abstraction has 690 states and 978 transitions. [2018-11-10 04:43:59,350 INFO L608 BuchiCegarLoop]: Abstraction has 690 states and 978 transitions. [2018-11-10 04:43:59,351 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:43:59,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 978 transitions. [2018-11-10 04:43:59,354 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 688 [2018-11-10 04:43:59,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,355 INFO L793 eck$LassoCheckResult]: Stem: 2155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2136#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_~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_~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;havoc main_~cond~0; 2137#L111-1 [2018-11-10 04:43:59,356 INFO L795 eck$LassoCheckResult]: Loop: 2137#L111-1 assume true; 2309#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 2308#L32 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; 2306#L51 assume !(main_~p1~0 != 0); 2303#L51-2 assume !(main_~p2~0 != 0); 2300#L55-1 assume !(main_~p3~0 != 0); 2275#L59-1 assume !(main_~p4~0 != 0); 2266#L63-1 assume !(main_~p5~0 != 0); 2267#L67-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2248#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2249#L75-1 assume !(main_~p1~0 != 0); 2231#L81-1 assume !(main_~p2~0 != 0); 2232#L86-1 assume !(main_~p3~0 != 0); 2317#L91-1 assume !(main_~p4~0 != 0); 2314#L96-1 assume !(main_~p5~0 != 0); 2313#L101-1 assume !(main_~p6~0 != 0); 2311#L106-1 assume !(main_~p7~0 != 0); 2137#L111-1 [2018-11-10 04:43:59,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 04:43:59,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1598252712, now seen corresponding path program 1 times [2018-11-10 04:43:59,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,384 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 04:43:59,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:43:59,385 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,386 INFO L87 Difference]: Start difference. First operand 690 states and 978 transitions. cyclomatic complexity: 320 Second operand 3 states. [2018-11-10 04:43:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,406 INFO L93 Difference]: Finished difference Result 1346 states and 1858 transitions. [2018-11-10 04:43:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1346 states and 1858 transitions. [2018-11-10 04:43:59,418 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1344 [2018-11-10 04:43:59,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1346 states to 1346 states and 1858 transitions. [2018-11-10 04:43:59,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1346 [2018-11-10 04:43:59,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1346 [2018-11-10 04:43:59,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1346 states and 1858 transitions. [2018-11-10 04:43:59,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,428 INFO L705 BuchiCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2018-11-10 04:43:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states and 1858 transitions. [2018-11-10 04:43:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2018-11-10 04:43:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-11-10 04:43:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1858 transitions. [2018-11-10 04:43:59,452 INFO L728 BuchiCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2018-11-10 04:43:59,452 INFO L608 BuchiCegarLoop]: Abstraction has 1346 states and 1858 transitions. [2018-11-10 04:43:59,453 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:43:59,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 1858 transitions. [2018-11-10 04:43:59,458 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1344 [2018-11-10 04:43:59,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,459 INFO L793 eck$LassoCheckResult]: Stem: 4197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4179#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_~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_~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;havoc main_~cond~0; 4180#L111-1 [2018-11-10 04:43:59,459 INFO L795 eck$LassoCheckResult]: Loop: 4180#L111-1 assume true; 4292#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 4289#L32 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; 4286#L51 assume !(main_~p1~0 != 0); 4283#L51-2 assume !(main_~p2~0 != 0); 4280#L55-1 assume !(main_~p3~0 != 0); 4276#L59-1 assume !(main_~p4~0 != 0); 4233#L63-1 assume !(main_~p5~0 != 0); 4223#L67-1 assume !(main_~p6~0 != 0); 4217#L71-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4218#L75-1 assume !(main_~p1~0 != 0); 4325#L81-1 assume !(main_~p2~0 != 0); 4318#L86-1 assume !(main_~p3~0 != 0); 4311#L91-1 assume !(main_~p4~0 != 0); 4304#L96-1 assume !(main_~p5~0 != 0); 4299#L101-1 assume !(main_~p6~0 != 0); 4297#L106-1 assume !(main_~p7~0 != 0); 4180#L111-1 [2018-11-10 04:43:59,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 04:43:59,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2016656214, now seen corresponding path program 1 times [2018-11-10 04:43:59,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:43:59,475 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 04:43:59,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:43:59,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:43:59,475 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:43:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:43:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:43:59,476 INFO L87 Difference]: Start difference. First operand 1346 states and 1858 transitions. cyclomatic complexity: 576 Second operand 3 states. [2018-11-10 04:43:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:43:59,500 INFO L93 Difference]: Finished difference Result 2626 states and 3522 transitions. [2018-11-10 04:43:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:43:59,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3522 transitions. [2018-11-10 04:43:59,512 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2624 [2018-11-10 04:43:59,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3522 transitions. [2018-11-10 04:43:59,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2018-11-10 04:43:59,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2018-11-10 04:43:59,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3522 transitions. [2018-11-10 04:43:59,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:43:59,526 INFO L705 BuchiCegarLoop]: Abstraction has 2626 states and 3522 transitions. [2018-11-10 04:43:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3522 transitions. [2018-11-10 04:43:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2018-11-10 04:43:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2018-11-10 04:43:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3522 transitions. [2018-11-10 04:43:59,565 INFO L728 BuchiCegarLoop]: Abstraction has 2626 states and 3522 transitions. [2018-11-10 04:43:59,565 INFO L608 BuchiCegarLoop]: Abstraction has 2626 states and 3522 transitions. [2018-11-10 04:43:59,565 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:43:59,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3522 transitions. [2018-11-10 04:43:59,573 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2624 [2018-11-10 04:43:59,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:43:59,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:43:59,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:43:59,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:43:59,574 INFO L793 eck$LassoCheckResult]: Stem: 8181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8156#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_~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_~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;havoc main_~cond~0; 8157#L111-1 [2018-11-10 04:43:59,574 INFO L795 eck$LassoCheckResult]: Loop: 8157#L111-1 assume true; 8268#L30-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 8260#L32 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; 8261#L51 assume !(main_~p1~0 != 0); 8313#L51-2 assume !(main_~p2~0 != 0); 8309#L55-1 assume !(main_~p3~0 != 0); 8306#L59-1 assume !(main_~p4~0 != 0); 8305#L63-1 assume !(main_~p5~0 != 0); 8303#L67-1 assume !(main_~p6~0 != 0); 8299#L71-1 assume !(main_~p7~0 != 0); 8297#L75-1 assume !(main_~p1~0 != 0); 8294#L81-1 assume !(main_~p2~0 != 0); 8290#L86-1 assume !(main_~p3~0 != 0); 8286#L91-1 assume !(main_~p4~0 != 0); 8282#L96-1 assume !(main_~p5~0 != 0); 8278#L101-1 assume !(main_~p6~0 != 0); 8279#L106-1 assume !(main_~p7~0 != 0); 8157#L111-1 [2018-11-10 04:43:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 04:43:59,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1468964456, now seen corresponding path program 1 times [2018-11-10 04:43:59,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:43:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:43:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 63067878, now seen corresponding path program 1 times [2018-11-10 04:43:59,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:43:59,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:43:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:43:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:43:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:43:59,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:43:59 BoogieIcfgContainer [2018-11-10 04:43:59,708 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:43:59,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:43:59,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:43:59,708 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:43:59,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:43:58" (3/4) ... [2018-11-10 04:43:59,711 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 04:43:59,745 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d7106c62-ef53-41a7-9a48-324644866bb5/bin-2019/uautomizer/witness.graphml [2018-11-10 04:43:59,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:43:59,746 INFO L168 Benchmark]: Toolchain (without parser) took 1362.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 962.5 MB in the beginning and 976.6 MB in the end (delta: -14.1 MB). Peak memory consumption was 124.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:43:59,748 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:43:59,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.03 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 951.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:43:59,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 946.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:43:59,749 INFO L168 Benchmark]: Boogie Preprocessor took 12.42 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:43:59,749 INFO L168 Benchmark]: RCFGBuilder took 229.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:43:59,749 INFO L168 Benchmark]: BuchiAutomizer took 922.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 141.1 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:43:59,750 INFO L168 Benchmark]: Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:43:59,753 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 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.03 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 951.8 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 20.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 946.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.42 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 229.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 922.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 141.1 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. * Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 2626 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. 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 2626 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 420 SDtfs, 214 SDslu, 248 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 30]: 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@43845696=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2facd6a2=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e96e333=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50230b97=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ad498a8=0, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d53831f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b7ea8ae=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@344ddc1f=0, cond=1, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: 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; [L28] int cond; Loop: [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...