./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7b0b589689413087c164ce10eb80c902ee4046 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:06,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:06,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:06,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:06,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:06,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:06,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:06,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:06,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:06,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:06,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:06,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:06,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:06,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:06,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:06,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:06,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:06,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:06,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:06,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:06,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:06,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:06,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:06,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:06,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:06,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:06,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:06,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:06,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:06,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:06,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:06,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:06,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:06,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:06,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:06,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:06,412 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:07:06,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:06,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:06,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:06,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:06,425 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:06,425 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:06,425 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:06,425 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:06,425 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:06,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:06,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:07:06,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:06,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:06,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:06,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:06,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:07:06,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:06,429 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:06,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:06,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:06,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:06,430 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:06,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:06,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:06,430 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:06,431 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:06,431 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_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-10-27 06:07:06,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:06,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:06,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:06,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:06,490 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:06,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:07:06,546 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/data/9ced08d9b/2059af4e337d4a149dc2f43ebfcc381d/FLAGf8f7fb2f7 [2018-10-27 06:07:06,941 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:06,942 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:07:06,950 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/data/9ced08d9b/2059af4e337d4a149dc2f43ebfcc381d/FLAGf8f7fb2f7 [2018-10-27 06:07:06,962 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/data/9ced08d9b/2059af4e337d4a149dc2f43ebfcc381d [2018-10-27 06:07:06,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:06,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:06,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:06,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:06,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:06,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb44556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:06, skipping insertion in model container [2018-10-27 06:07:06,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:06" (1/1) ... [2018-10-27 06:07:06,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:07,008 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:07,157 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:07,161 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:07,185 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:07,197 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:07,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07 WrapperNode [2018-10-27 06:07:07,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:07,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:07,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:07,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:07,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:07,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:07,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:07,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:07,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... [2018-10-27 06:07:07,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:07,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:07,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:07,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:07,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/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-10-27 06:07:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:07,925 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:07,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07 BoogieIcfgContainer [2018-10-27 06:07:07,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:07,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:07,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:07,930 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:07,931 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:06" (1/3) ... [2018-10-27 06:07:07,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520f1e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:07, skipping insertion in model container [2018-10-27 06:07:07,932 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:07" (2/3) ... [2018-10-27 06:07:07,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520f1e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:07, skipping insertion in model container [2018-10-27 06:07:07,933 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:07,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07" (3/3) ... [2018-10-27 06:07:07,934 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 06:07:07,993 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:07,994 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:07,994 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:07,994 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:07,994 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:07,994 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:07,994 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:07,994 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:07,995 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:08,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-10-27 06:07:08,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:07:08,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,044 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:08,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-10-27 06:07:08,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:07:08,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,060 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 18#L153-1true [2018-10-27 06:07:08,063 INFO L795 eck$LassoCheckResult]: Loop: 18#L153-1true assume true; 24#L39-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 28#L41true assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 39#L66true assume main_~p1~0 != 0;main_~lk1~0 := 1; 35#L66-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 23#L70-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 29#L74-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 16#L78-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 6#L82-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 33#L86-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 41#L90-1true assume !(main_~p8~0 != 0); 27#L94-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 12#L98-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 3#L102-1true assume !(main_~p1~0 != 0); 36#L108-1true assume !(main_~p2~0 != 0); 4#L113-1true assume !(main_~p3~0 != 0); 10#L118-1true assume !(main_~p4~0 != 0); 21#L123-1true assume !(main_~p5~0 != 0); 32#L128-1true assume !(main_~p6~0 != 0); 20#L133-1true assume !(main_~p7~0 != 0); 30#L138-1true assume !(main_~p8~0 != 0); 40#L143-1true assume !(main_~p9~0 != 0); 8#L148-1true assume !(main_~p10~0 != 0); 18#L153-1true [2018-10-27 06:07:08,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:07:08,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1961619935, now seen corresponding path program 1 times [2018-10-27 06:07:08,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:08,315 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:08,331 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-10-27 06:07:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,384 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-10-27 06:07:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:08,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 132 transitions. [2018-10-27 06:07:08,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-10-27 06:07:08,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 67 states and 105 transitions. [2018-10-27 06:07:08,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2018-10-27 06:07:08,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-10-27 06:07:08,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 105 transitions. [2018-10-27 06:07:08,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:08,396 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-10-27 06:07:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 105 transitions. [2018-10-27 06:07:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-27 06:07:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 06:07:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-10-27 06:07:08,422 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-10-27 06:07:08,422 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2018-10-27 06:07:08,422 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:08,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 105 transitions. [2018-10-27 06:07:08,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-10-27 06:07:08,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,425 INFO L793 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 141#L153-1 [2018-10-27 06:07:08,425 INFO L795 eck$LassoCheckResult]: Loop: 141#L153-1 assume true; 148#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 160#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 161#L66 assume !(main_~p1~0 != 0); 167#L66-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 152#L70-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 153#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 177#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 176#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 164#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 165#L90-1 assume !(main_~p8~0 != 0); 175#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 174#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 173#L102-1 assume !(main_~p1~0 != 0); 168#L108-1 assume !(main_~p2~0 != 0); 128#L113-1 assume !(main_~p3~0 != 0); 130#L118-1 assume !(main_~p4~0 != 0); 136#L123-1 assume !(main_~p5~0 != 0); 145#L128-1 assume !(main_~p6~0 != 0); 149#L133-1 assume !(main_~p7~0 != 0); 151#L138-1 assume !(main_~p8~0 != 0); 132#L143-1 assume !(main_~p9~0 != 0); 180#L148-1 assume !(main_~p10~0 != 0); 141#L153-1 [2018-10-27 06:07:08,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:07:08,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1515698911, now seen corresponding path program 1 times [2018-10-27 06:07:08,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:08,477 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:08,478 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. cyclomatic complexity: 40 Second operand 3 states. [2018-10-27 06:07:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,536 INFO L93 Difference]: Finished difference Result 130 states and 202 transitions. [2018-10-27 06:07:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:08,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 202 transitions. [2018-10-27 06:07:08,539 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-10-27 06:07:08,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 202 transitions. [2018-10-27 06:07:08,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-10-27 06:07:08,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-10-27 06:07:08,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 202 transitions. [2018-10-27 06:07:08,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:08,542 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-10-27 06:07:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 202 transitions. [2018-10-27 06:07:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-10-27 06:07:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 06:07:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2018-10-27 06:07:08,553 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-10-27 06:07:08,553 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-10-27 06:07:08,554 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:08,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 202 transitions. [2018-10-27 06:07:08,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2018-10-27 06:07:08,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,556 INFO L793 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 344#L153-1 [2018-10-27 06:07:08,557 INFO L795 eck$LassoCheckResult]: Loop: 344#L153-1 assume true; 392#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 390#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 386#L66 assume !(main_~p1~0 != 0); 387#L66-2 assume !(main_~p2~0 != 0); 355#L70-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 356#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 349#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 336#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 337#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 377#L90-1 assume !(main_~p8~0 != 0); 378#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 373#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 374#L102-1 assume !(main_~p1~0 != 0); 426#L108-1 assume !(main_~p2~0 != 0); 423#L113-1 assume !(main_~p3~0 != 0); 419#L118-1 assume !(main_~p4~0 != 0); 415#L123-1 assume !(main_~p5~0 != 0); 411#L128-1 assume !(main_~p6~0 != 0); 407#L133-1 assume !(main_~p7~0 != 0); 403#L138-1 assume !(main_~p8~0 != 0); 401#L143-1 assume !(main_~p9~0 != 0); 396#L148-1 assume !(main_~p10~0 != 0); 344#L153-1 [2018-10-27 06:07:08,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:07:08,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -173244831, now seen corresponding path program 1 times [2018-10-27 06:07:08,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:08,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:08,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:08,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:08,634 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. cyclomatic complexity: 76 Second operand 3 states. [2018-10-27 06:07:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,709 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2018-10-27 06:07:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:08,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 390 transitions. [2018-10-27 06:07:08,713 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-10-27 06:07:08,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 390 transitions. [2018-10-27 06:07:08,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-10-27 06:07:08,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2018-10-27 06:07:08,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 390 transitions. [2018-10-27 06:07:08,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:08,721 INFO L705 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-10-27 06:07:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 390 transitions. [2018-10-27 06:07:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-10-27 06:07:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-27 06:07:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 390 transitions. [2018-10-27 06:07:08,737 INFO L728 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-10-27 06:07:08,737 INFO L608 BuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2018-10-27 06:07:08,738 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:08,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 390 transitions. [2018-10-27 06:07:08,739 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2018-10-27 06:07:08,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,740 INFO L793 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 733#L153-1 [2018-10-27 06:07:08,741 INFO L795 eck$LassoCheckResult]: Loop: 733#L153-1 assume true; 891#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 889#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 887#L66 assume !(main_~p1~0 != 0); 886#L66-2 assume !(main_~p2~0 != 0); 885#L70-1 assume !(main_~p3~0 != 0); 884#L74-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 852#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 853#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 846#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 847#L90-1 assume !(main_~p8~0 != 0); 838#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 839#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 831#L102-1 assume !(main_~p1~0 != 0); 832#L108-1 assume !(main_~p2~0 != 0); 883#L113-1 assume !(main_~p3~0 != 0); 919#L118-1 assume !(main_~p4~0 != 0); 915#L123-1 assume !(main_~p5~0 != 0); 911#L128-1 assume !(main_~p6~0 != 0); 907#L133-1 assume !(main_~p7~0 != 0); 903#L138-1 assume !(main_~p8~0 != 0); 899#L143-1 assume !(main_~p9~0 != 0); 895#L148-1 assume !(main_~p10~0 != 0); 733#L153-1 [2018-10-27 06:07:08,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:07:08,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2127577759, now seen corresponding path program 1 times [2018-10-27 06:07:08,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:08,810 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:08,810 INFO L87 Difference]: Start difference. First operand 254 states and 390 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-10-27 06:07:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,843 INFO L93 Difference]: Finished difference Result 498 states and 754 transitions. [2018-10-27 06:07:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:08,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 754 transitions. [2018-10-27 06:07:08,847 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-10-27 06:07:08,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 754 transitions. [2018-10-27 06:07:08,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2018-10-27 06:07:08,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2018-10-27 06:07:08,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 754 transitions. [2018-10-27 06:07:08,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:08,854 INFO L705 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-10-27 06:07:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 754 transitions. [2018-10-27 06:07:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2018-10-27 06:07:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-27 06:07:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 754 transitions. [2018-10-27 06:07:08,874 INFO L728 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-10-27 06:07:08,874 INFO L608 BuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2018-10-27 06:07:08,874 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:08,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 754 transitions. [2018-10-27 06:07:08,877 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2018-10-27 06:07:08,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:08,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:08,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:08,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:08,878 INFO L793 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 1491#L153-1 [2018-10-27 06:07:08,878 INFO L795 eck$LassoCheckResult]: Loop: 1491#L153-1 assume true; 1567#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1563#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 1558#L66 assume !(main_~p1~0 != 0); 1552#L66-2 assume !(main_~p2~0 != 0); 1544#L70-1 assume !(main_~p3~0 != 0); 1546#L74-1 assume !(main_~p4~0 != 0); 1648#L78-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1645#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1641#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1637#L90-1 assume !(main_~p8~0 != 0); 1633#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1630#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1626#L102-1 assume !(main_~p1~0 != 0); 1621#L108-1 assume !(main_~p2~0 != 0); 1617#L113-1 assume !(main_~p3~0 != 0); 1615#L118-1 assume !(main_~p4~0 != 0); 1614#L123-1 assume !(main_~p5~0 != 0); 1612#L128-1 assume !(main_~p6~0 != 0); 1610#L133-1 assume !(main_~p7~0 != 0); 1608#L138-1 assume !(main_~p8~0 != 0); 1606#L143-1 assume !(main_~p9~0 != 0); 1578#L148-1 assume !(main_~p10~0 != 0); 1491#L153-1 [2018-10-27 06:07:08,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,879 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:07:08,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:08,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:08,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 539229857, now seen corresponding path program 1 times [2018-10-27 06:07:08,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:08,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:08,928 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:08,928 INFO L87 Difference]: Start difference. First operand 498 states and 754 transitions. cyclomatic complexity: 272 Second operand 3 states. [2018-10-27 06:07:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:08,981 INFO L93 Difference]: Finished difference Result 978 states and 1458 transitions. [2018-10-27 06:07:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:08,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 978 states and 1458 transitions. [2018-10-27 06:07:08,989 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-10-27 06:07:08,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 978 states to 978 states and 1458 transitions. [2018-10-27 06:07:08,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 978 [2018-10-27 06:07:08,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 978 [2018-10-27 06:07:08,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1458 transitions. [2018-10-27 06:07:08,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:08,998 INFO L705 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-10-27 06:07:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1458 transitions. [2018-10-27 06:07:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-10-27 06:07:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-27 06:07:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1458 transitions. [2018-10-27 06:07:09,027 INFO L728 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-10-27 06:07:09,027 INFO L608 BuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2018-10-27 06:07:09,027 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:09,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1458 transitions. [2018-10-27 06:07:09,033 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2018-10-27 06:07:09,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:09,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:09,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:09,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,035 INFO L793 eck$LassoCheckResult]: Stem: 3000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2972#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 2973#L153-1 [2018-10-27 06:07:09,035 INFO L795 eck$LassoCheckResult]: Loop: 2973#L153-1 assume true; 3184#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3182#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 3178#L66 assume !(main_~p1~0 != 0); 3174#L66-2 assume !(main_~p2~0 != 0); 3171#L70-1 assume !(main_~p3~0 != 0); 3172#L74-1 assume !(main_~p4~0 != 0); 3231#L78-1 assume !(main_~p5~0 != 0); 3229#L82-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 3227#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 3225#L90-1 assume !(main_~p8~0 != 0); 3223#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 3221#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 3217#L102-1 assume !(main_~p1~0 != 0); 3214#L108-1 assume !(main_~p2~0 != 0); 3213#L113-1 assume !(main_~p3~0 != 0); 3211#L118-1 assume !(main_~p4~0 != 0); 3207#L123-1 assume !(main_~p5~0 != 0); 3204#L128-1 assume !(main_~p6~0 != 0); 3200#L133-1 assume !(main_~p7~0 != 0); 3196#L138-1 assume !(main_~p8~0 != 0); 3192#L143-1 assume !(main_~p9~0 != 0); 3188#L148-1 assume !(main_~p10~0 != 0); 2973#L153-1 [2018-10-27 06:07:09,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:07:09,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash -481838497, now seen corresponding path program 1 times [2018-10-27 06:07:09,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:09,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:09,113 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:09,114 INFO L87 Difference]: Start difference. First operand 978 states and 1458 transitions. cyclomatic complexity: 512 Second operand 3 states. [2018-10-27 06:07:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:09,173 INFO L93 Difference]: Finished difference Result 1922 states and 2818 transitions. [2018-10-27 06:07:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:09,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1922 states and 2818 transitions. [2018-10-27 06:07:09,190 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-10-27 06:07:09,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-10-27 06:07:09,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2018-10-27 06:07:09,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2018-10-27 06:07:09,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1922 states and 2818 transitions. [2018-10-27 06:07:09,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:09,209 INFO L705 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-10-27 06:07:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states and 2818 transitions. [2018-10-27 06:07:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2018-10-27 06:07:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-10-27 06:07:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2818 transitions. [2018-10-27 06:07:09,251 INFO L728 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-10-27 06:07:09,251 INFO L608 BuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2018-10-27 06:07:09,251 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:09,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1922 states and 2818 transitions. [2018-10-27 06:07:09,264 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2018-10-27 06:07:09,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:09,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:09,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:09,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,265 INFO L793 eck$LassoCheckResult]: Stem: 5909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 5879#L153-1 [2018-10-27 06:07:09,265 INFO L795 eck$LassoCheckResult]: Loop: 5879#L153-1 assume true; 6086#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 6084#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 6082#L66 assume !(main_~p1~0 != 0); 6033#L66-2 assume !(main_~p2~0 != 0); 6034#L70-1 assume !(main_~p3~0 != 0); 6015#L74-1 assume !(main_~p4~0 != 0); 6017#L78-1 assume !(main_~p5~0 != 0); 5994#L82-1 assume !(main_~p6~0 != 0); 5996#L86-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 6143#L90-1 assume !(main_~p8~0 != 0); 6141#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 5963#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 5964#L102-1 assume !(main_~p1~0 != 0); 6117#L108-1 assume !(main_~p2~0 != 0); 6115#L113-1 assume !(main_~p3~0 != 0); 6113#L118-1 assume !(main_~p4~0 != 0); 6110#L123-1 assume !(main_~p5~0 != 0); 6106#L128-1 assume !(main_~p6~0 != 0); 6103#L133-1 assume !(main_~p7~0 != 0); 6099#L138-1 assume !(main_~p8~0 != 0); 6095#L143-1 assume !(main_~p9~0 != 0); 6091#L148-1 assume !(main_~p10~0 != 0); 5879#L153-1 [2018-10-27 06:07:09,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:07:09,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1761702175, now seen corresponding path program 1 times [2018-10-27 06:07:09,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:09,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:09,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:09,326 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:09,327 INFO L87 Difference]: Start difference. First operand 1922 states and 2818 transitions. cyclomatic complexity: 960 Second operand 3 states. [2018-10-27 06:07:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:09,400 INFO L93 Difference]: Finished difference Result 3778 states and 5442 transitions. [2018-10-27 06:07:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:09,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3778 states and 5442 transitions. [2018-10-27 06:07:09,428 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-10-27 06:07:09,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-10-27 06:07:09,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3778 [2018-10-27 06:07:09,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3778 [2018-10-27 06:07:09,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3778 states and 5442 transitions. [2018-10-27 06:07:09,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:09,457 INFO L705 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-10-27 06:07:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states and 5442 transitions. [2018-10-27 06:07:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3778. [2018-10-27 06:07:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3778 states. [2018-10-27 06:07:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 5442 transitions. [2018-10-27 06:07:09,535 INFO L728 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-10-27 06:07:09,536 INFO L608 BuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2018-10-27 06:07:09,536 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:07:09,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3778 states and 5442 transitions. [2018-10-27 06:07:09,560 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2018-10-27 06:07:09,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:09,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:09,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:09,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:09,561 INFO L793 eck$LassoCheckResult]: Stem: 11615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 11585#L153-1 [2018-10-27 06:07:09,561 INFO L795 eck$LassoCheckResult]: Loop: 11585#L153-1 assume true; 11887#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11886#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 11884#L66 assume !(main_~p1~0 != 0); 11881#L66-2 assume !(main_~p2~0 != 0); 11877#L70-1 assume !(main_~p3~0 != 0); 11873#L74-1 assume !(main_~p4~0 != 0); 11870#L78-1 assume !(main_~p5~0 != 0); 11864#L82-1 assume !(main_~p6~0 != 0); 11866#L86-1 assume !(main_~p7~0 != 0); 11857#L90-1 assume !(main_~p8~0 != 0); 11858#L94-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 11849#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 11850#L102-1 assume !(main_~p1~0 != 0); 11830#L108-1 assume !(main_~p2~0 != 0); 11831#L113-1 assume !(main_~p3~0 != 0); 11806#L118-1 assume !(main_~p4~0 != 0); 11808#L123-1 assume !(main_~p5~0 != 0); 11899#L128-1 assume !(main_~p6~0 != 0); 11896#L133-1 assume !(main_~p7~0 != 0); 11894#L138-1 assume !(main_~p8~0 != 0); 11892#L143-1 assume !(main_~p9~0 != 0); 11890#L148-1 assume !(main_~p10~0 != 0); 11585#L153-1 [2018-10-27 06:07:09,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-10-27 06:07:09,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:09,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1522147871, now seen corresponding path program 1 times [2018-10-27 06:07:09,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:09,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:09,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:09,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:09,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:09,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:09,642 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:09,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:09,642 INFO L87 Difference]: Start difference. First operand 3778 states and 5442 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2018-10-27 06:07:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:09,765 INFO L93 Difference]: Finished difference Result 7426 states and 10498 transitions. [2018-10-27 06:07:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:09,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7426 states and 10498 transitions. [2018-10-27 06:07:09,818 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-10-27 06:07:09,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-10-27 06:07:09,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7426 [2018-10-27 06:07:09,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7426 [2018-10-27 06:07:09,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7426 states and 10498 transitions. [2018-10-27 06:07:09,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:09,873 INFO L705 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-10-27 06:07:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states and 10498 transitions. [2018-10-27 06:07:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 7426. [2018-10-27 06:07:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2018-10-27 06:07:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 10498 transitions. [2018-10-27 06:07:10,028 INFO L728 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-10-27 06:07:10,028 INFO L608 BuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2018-10-27 06:07:10,028 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:07:10,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7426 states and 10498 transitions. [2018-10-27 06:07:10,057 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2018-10-27 06:07:10,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:10,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:10,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:10,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,058 INFO L793 eck$LassoCheckResult]: Stem: 22828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 22795#L153-1 [2018-10-27 06:07:10,058 INFO L795 eck$LassoCheckResult]: Loop: 22795#L153-1 assume true; 22993#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22991#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 22986#L66 assume !(main_~p1~0 != 0); 22980#L66-2 assume !(main_~p2~0 != 0); 22974#L70-1 assume !(main_~p3~0 != 0); 22968#L74-1 assume !(main_~p4~0 != 0); 22960#L78-1 assume !(main_~p5~0 != 0); 22958#L82-1 assume !(main_~p6~0 != 0); 22959#L86-1 assume !(main_~p7~0 != 0); 23039#L90-1 assume !(main_~p8~0 != 0); 23036#L94-1 assume !(main_~p9~0 != 0); 23034#L98-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 23031#L102-1 assume !(main_~p1~0 != 0); 23028#L108-1 assume !(main_~p2~0 != 0); 23023#L113-1 assume !(main_~p3~0 != 0); 23017#L118-1 assume !(main_~p4~0 != 0); 23013#L123-1 assume !(main_~p5~0 != 0); 23007#L128-1 assume !(main_~p6~0 != 0); 23004#L133-1 assume !(main_~p7~0 != 0); 23002#L138-1 assume !(main_~p8~0 != 0); 23000#L143-1 assume !(main_~p9~0 != 0); 22997#L148-1 assume !(main_~p10~0 != 0); 22795#L153-1 [2018-10-27 06:07:10,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-10-27 06:07:10,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1780313309, now seen corresponding path program 1 times [2018-10-27 06:07:10,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:10,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:10,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:10,137 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:10,137 INFO L87 Difference]: Start difference. First operand 7426 states and 10498 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2018-10-27 06:07:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:10,274 INFO L93 Difference]: Finished difference Result 14594 states and 20226 transitions. [2018-10-27 06:07:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:10,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14594 states and 20226 transitions. [2018-10-27 06:07:10,352 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-10-27 06:07:10,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-10-27 06:07:10,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14594 [2018-10-27 06:07:10,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14594 [2018-10-27 06:07:10,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14594 states and 20226 transitions. [2018-10-27 06:07:10,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:10,452 INFO L705 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-10-27 06:07:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14594 states and 20226 transitions. [2018-10-27 06:07:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14594 to 14594. [2018-10-27 06:07:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14594 states. [2018-10-27 06:07:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 20226 transitions. [2018-10-27 06:07:10,765 INFO L728 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-10-27 06:07:10,765 INFO L608 BuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2018-10-27 06:07:10,765 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:07:10,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14594 states and 20226 transitions. [2018-10-27 06:07:10,813 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2018-10-27 06:07:10,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:10,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:10,814 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:10,814 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,815 INFO L793 eck$LassoCheckResult]: Stem: 44853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 44820#L153-1 [2018-10-27 06:07:10,815 INFO L795 eck$LassoCheckResult]: Loop: 44820#L153-1 assume true; 45307#L39-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 45305#L41 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 45303#L66 assume !(main_~p1~0 != 0); 45299#L66-2 assume !(main_~p2~0 != 0); 45292#L70-1 assume !(main_~p3~0 != 0); 45284#L74-1 assume !(main_~p4~0 != 0); 45277#L78-1 assume !(main_~p5~0 != 0); 45273#L82-1 assume !(main_~p6~0 != 0); 45265#L86-1 assume !(main_~p7~0 != 0); 45261#L90-1 assume !(main_~p8~0 != 0); 45253#L94-1 assume !(main_~p9~0 != 0); 45068#L98-1 assume !(main_~p10~0 != 0); 45070#L102-1 assume !(main_~p1~0 != 0); 45242#L108-1 assume !(main_~p2~0 != 0); 45229#L113-1 assume !(main_~p3~0 != 0); 45231#L118-1 assume !(main_~p4~0 != 0); 45212#L123-1 assume !(main_~p5~0 != 0); 45213#L128-1 assume !(main_~p6~0 != 0); 45322#L133-1 assume !(main_~p7~0 != 0); 45319#L138-1 assume !(main_~p8~0 != 0); 45314#L143-1 assume !(main_~p9~0 != 0); 45310#L148-1 assume !(main_~p10~0 != 0); 44820#L153-1 [2018-10-27 06:07:10,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,815 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-10-27 06:07:10,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1813589409, now seen corresponding path program 1 times [2018-10-27 06:07:10,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1849576355, now seen corresponding path program 1 times [2018-10-27 06:07:10,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,449 WARN L179 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:07:12,049 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:07:12,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:12 BoogieIcfgContainer [2018-10-27 06:07:12,093 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:12,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:12,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:12,094 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:12,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:07" (3/4) ... [2018-10-27 06:07:12,098 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:07:12,151 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5bbc0087-9888-41c7-a30d-fe711b8b9609/bin-2019/uautomizer/witness.graphml [2018-10-27 06:07:12,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:12,152 INFO L168 Benchmark]: Toolchain (without parser) took 5187.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,153 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:12,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 939.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,154 INFO L168 Benchmark]: Boogie Preprocessor took 23.86 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:12,154 INFO L168 Benchmark]: RCFGBuilder took 665.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,155 INFO L168 Benchmark]: BuchiAutomizer took 4167.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.8 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,155 INFO L168 Benchmark]: Witness Printer took 57.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:12,158 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.0 GB. Free memory was 945.1 MB in the beginning and 939.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.86 ms. Allocated memory is still 1.0 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 665.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4167.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.8 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14594 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 14594 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 745 SDtfs, 383 SDslu, 454 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 39]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@568d80ba=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47c3f496=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c5f60f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@746143b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f51c1dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70dce38=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fb5f47d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@280f02e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7de2d722=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d91aaa9=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@754c5c22=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 39]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...