./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/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_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/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-635dfa2 [2018-12-09 11:51:16,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:51:16,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:51:16,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:51:16,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:51:16,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:51:16,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:51:16,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:51:16,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:51:16,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:51:16,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:51:16,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:51:16,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:51:16,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:51:16,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:51:16,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:51:16,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:51:16,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:51:16,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:51:16,496 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:51:16,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:51:16,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:51:16,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:51:16,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:51:16,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:51:16,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:51:16,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:51:16,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:51:16,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:51:16,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:51:16,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:51:16,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:51:16,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:51:16,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:51:16,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:51:16,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:51:16,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 11:51:16,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:51:16,509 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:51:16,510 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:51:16,510 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:51:16,510 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:51:16,510 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 11:51:16,511 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 11:51:16,511 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 11:51:16,511 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 11:51:16,511 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 11:51:16,511 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 11:51:16,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 11:51:16,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:51:16,513 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 11:51:16,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:51:16,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:51:16,514 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 11:51:16,514 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:51:16,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:51:16,514 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 11:51:16,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 11:51:16,515 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_427530b4-69fa-4726-9a78-7006ce004f86/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-12-09 11:51:16,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:51:16,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:51:16,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:51:16,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:51:16,547 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:51:16,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:51:16,581 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/data/edb082f01/25c6cf1f4926470aaced9a2288c28b4d/FLAGa5e5667aa [2018-12-09 11:51:16,969 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:51:16,970 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:51:16,975 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/data/edb082f01/25c6cf1f4926470aaced9a2288c28b4d/FLAGa5e5667aa [2018-12-09 11:51:16,985 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/data/edb082f01/25c6cf1f4926470aaced9a2288c28b4d [2018-12-09 11:51:16,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:51:16,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:51:16,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:51:16,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:51:16,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:51:16,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:51:16" (1/1) ... [2018-12-09 11:51:16,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:16, skipping insertion in model container [2018-12-09 11:51:16,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:51:16" (1/1) ... [2018-12-09 11:51:16,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:51:17,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:51:17,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:51:17,111 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:51:17,124 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:51:17,132 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:51:17,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17 WrapperNode [2018-12-09 11:51:17,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:51:17,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:51:17,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:51:17,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:51:17,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:51:17,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:51:17,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:51:17,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:51:17,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... [2018-12-09 11:51:17,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:51:17,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:51:17,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:51:17,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:51:17,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/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-12-09 11:51:17,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:51:17,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:51:17,355 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:51:17,356 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 11:51:17,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:51:17 BoogieIcfgContainer [2018-12-09 11:51:17,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:51:17,356 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 11:51:17,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 11:51:17,358 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 11:51:17,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:51:17,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 11:51:16" (1/3) ... [2018-12-09 11:51:17,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5828a0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:51:17, skipping insertion in model container [2018-12-09 11:51:17,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:51:17,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:51:17" (2/3) ... [2018-12-09 11:51:17,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5828a0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:51:17, skipping insertion in model container [2018-12-09 11:51:17,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:51:17,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:51:17" (3/3) ... [2018-12-09 11:51:17,361 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:51:17,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:51:17,392 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 11:51:17,392 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 11:51:17,392 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 11:51:17,392 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:51:17,392 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:51:17,392 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 11:51:17,392 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:51:17,392 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 11:51:17,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2018-12-09 11:51:17,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-12-09 11:51:17,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,419 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] [2018-12-09 11:51:17,420 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 11:51:17,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2018-12-09 11:51:17,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-12-09 11:51:17,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,422 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] [2018-12-09 11:51:17,428 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 17#L153-1true [2018-12-09 11:51:17,428 INFO L796 eck$LassoCheckResult]: Loop: 17#L153-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 26#L41true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 37#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 22#L70-1true assume !(0 != main_~p3~0); 27#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 31#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 39#L90-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 11#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 34#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 9#L118-1true assume !(0 != main_~p4~0); 20#L123-1true assume !(0 != main_~p5~0); 30#L128-1true assume !(0 != main_~p6~0); 19#L133-1true assume !(0 != main_~p7~0); 28#L138-1true assume !(0 != main_~p8~0); 38#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 17#L153-1true [2018-12-09 11:51:17,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-09 11:51:17,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times [2018-12-09 11:51:17,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,535 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,546 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-09 11:51:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,571 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2018-12-09 11:51:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 129 transitions. [2018-12-09 11:51:17,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2018-12-09 11:51:17,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 64 states and 102 transitions. [2018-12-09 11:51:17,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-12-09 11:51:17,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-12-09 11:51:17,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 102 transitions. [2018-12-09 11:51:17,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,579 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2018-12-09 11:51:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 102 transitions. [2018-12-09 11:51:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-09 11:51:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 11:51:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 102 transitions. [2018-12-09 11:51:17,597 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2018-12-09 11:51:17,597 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2018-12-09 11:51:17,597 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 11:51:17,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 102 transitions. [2018-12-09 11:51:17,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2018-12-09 11:51:17,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,598 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] [2018-12-09 11:51:17,599 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 155#L153-1 [2018-12-09 11:51:17,599 INFO L796 eck$LassoCheckResult]: Loop: 155#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 161#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 160#L66 assume !(0 != main_~p1~0); 156#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 147#L70-1 assume !(0 != main_~p3~0); 148#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 128#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 129#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 153#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 136#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 137#L102-1 assume !(0 != main_~p1~0); 159#L108-1 assume !(0 != main_~p2~0); 183#L113-1 assume !(0 != main_~p3~0); 181#L118-1 assume !(0 != main_~p4~0); 146#L123-1 assume !(0 != main_~p5~0); 139#L128-1 assume !(0 != main_~p6~0); 143#L133-1 assume !(0 != main_~p7~0); 145#L138-1 assume !(0 != main_~p8~0); 127#L143-1 assume !(0 != main_~p9~0); 163#L148-1 assume !(0 != main_~p10~0); 155#L153-1 [2018-12-09 11:51:17,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-09 11:51:17,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times [2018-12-09 11:51:17,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:17,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,625 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,626 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. cyclomatic complexity: 40 Second operand 3 states. [2018-12-09 11:51:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,644 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2018-12-09 11:51:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 197 transitions. [2018-12-09 11:51:17,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2018-12-09 11:51:17,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 197 transitions. [2018-12-09 11:51:17,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-12-09 11:51:17,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-12-09 11:51:17,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 197 transitions. [2018-12-09 11:51:17,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,648 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2018-12-09 11:51:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 197 transitions. [2018-12-09 11:51:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-09 11:51:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-09 11:51:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2018-12-09 11:51:17,653 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2018-12-09 11:51:17,653 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2018-12-09 11:51:17,653 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 11:51:17,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 197 transitions. [2018-12-09 11:51:17,654 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2018-12-09 11:51:17,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,654 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] [2018-12-09 11:51:17,654 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 352#L153-1 [2018-12-09 11:51:17,655 INFO L796 eck$LassoCheckResult]: Loop: 352#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 371#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 370#L66 assume !(0 != main_~p1~0); 369#L66-2 assume !(0 != main_~p2~0); 366#L70-1 assume !(0 != main_~p3~0); 365#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 364#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 363#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 362#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 361#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 360#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 358#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 359#L102-1 assume !(0 != main_~p1~0); 388#L108-1 assume !(0 != main_~p2~0); 387#L113-1 assume !(0 != main_~p3~0); 385#L118-1 assume !(0 != main_~p4~0); 382#L123-1 assume !(0 != main_~p5~0); 381#L128-1 assume !(0 != main_~p6~0); 379#L133-1 assume !(0 != main_~p7~0); 377#L138-1 assume !(0 != main_~p8~0); 375#L143-1 assume !(0 != main_~p9~0); 373#L148-1 assume !(0 != main_~p10~0); 352#L153-1 [2018-12-09 11:51:17,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-12-09 11:51:17,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times [2018-12-09 11:51:17,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:17,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,677 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,677 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. cyclomatic complexity: 76 Second operand 3 states. [2018-12-09 11:51:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,688 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2018-12-09 11:51:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 381 transitions. [2018-12-09 11:51:17,691 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2018-12-09 11:51:17,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 381 transitions. [2018-12-09 11:51:17,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2018-12-09 11:51:17,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2018-12-09 11:51:17,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 381 transitions. [2018-12-09 11:51:17,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,695 INFO L705 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2018-12-09 11:51:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 381 transitions. [2018-12-09 11:51:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-12-09 11:51:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-09 11:51:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2018-12-09 11:51:17,707 INFO L728 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2018-12-09 11:51:17,707 INFO L608 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2018-12-09 11:51:17,707 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 11:51:17,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 381 transitions. [2018-12-09 11:51:17,709 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2018-12-09 11:51:17,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,709 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] [2018-12-09 11:51:17,710 INFO L794 eck$LassoCheckResult]: Stem: 727#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 728#L153-1 [2018-12-09 11:51:17,710 INFO L796 eck$LassoCheckResult]: Loop: 728#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 765#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 760#L66 assume !(0 != main_~p1~0); 753#L66-2 assume !(0 != main_~p2~0); 754#L70-1 assume !(0 != main_~p3~0); 854#L74-1 assume !(0 != main_~p4~0); 853#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 851#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 849#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 847#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 845#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 843#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 838#L102-1 assume !(0 != main_~p1~0); 834#L108-1 assume !(0 != main_~p2~0); 831#L113-1 assume !(0 != main_~p3~0); 822#L118-1 assume !(0 != main_~p4~0); 819#L123-1 assume !(0 != main_~p5~0); 816#L128-1 assume !(0 != main_~p6~0); 812#L133-1 assume !(0 != main_~p7~0); 808#L138-1 assume !(0 != main_~p8~0); 804#L143-1 assume !(0 != main_~p9~0); 800#L148-1 assume !(0 != main_~p10~0); 728#L153-1 [2018-12-09 11:51:17,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-12-09 11:51:17,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times [2018-12-09 11:51:17,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,735 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,736 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-12-09 11:51:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,748 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2018-12-09 11:51:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 737 transitions. [2018-12-09 11:51:17,751 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2018-12-09 11:51:17,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 737 transitions. [2018-12-09 11:51:17,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2018-12-09 11:51:17,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2018-12-09 11:51:17,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 737 transitions. [2018-12-09 11:51:17,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,756 INFO L705 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2018-12-09 11:51:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 737 transitions. [2018-12-09 11:51:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2018-12-09 11:51:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-12-09 11:51:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2018-12-09 11:51:17,768 INFO L728 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2018-12-09 11:51:17,768 INFO L608 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2018-12-09 11:51:17,768 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 11:51:17,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 737 transitions. [2018-12-09 11:51:17,770 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2018-12-09 11:51:17,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,770 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] [2018-12-09 11:51:17,770 INFO L794 eck$LassoCheckResult]: Stem: 1461#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 1462#L153-1 [2018-12-09 11:51:17,770 INFO L796 eck$LassoCheckResult]: Loop: 1462#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1635#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 1631#L66 assume !(0 != main_~p1~0); 1577#L66-2 assume !(0 != main_~p2~0); 1491#L70-1 assume !(0 != main_~p3~0); 1492#L74-1 assume !(0 != main_~p4~0); 1566#L78-1 assume !(0 != main_~p5~0); 1567#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1560#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1561#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1554#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1555#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1546#L102-1 assume !(0 != main_~p1~0); 1547#L108-1 assume !(0 != main_~p2~0); 1537#L113-1 assume !(0 != main_~p3~0); 1536#L118-1 assume !(0 != main_~p4~0); 1609#L123-1 assume !(0 != main_~p5~0); 1683#L128-1 assume !(0 != main_~p6~0); 1680#L133-1 assume !(0 != main_~p7~0); 1677#L138-1 assume !(0 != main_~p8~0); 1673#L143-1 assume !(0 != main_~p9~0); 1647#L148-1 assume !(0 != main_~p10~0); 1462#L153-1 [2018-12-09 11:51:17,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-12-09 11:51:17,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times [2018-12-09 11:51:17,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,788 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,789 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. cyclomatic complexity: 272 Second operand 3 states. [2018-12-09 11:51:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,800 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2018-12-09 11:51:17,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1425 transitions. [2018-12-09 11:51:17,805 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2018-12-09 11:51:17,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 945 states and 1425 transitions. [2018-12-09 11:51:17,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 945 [2018-12-09 11:51:17,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 945 [2018-12-09 11:51:17,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1425 transitions. [2018-12-09 11:51:17,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,812 INFO L705 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2018-12-09 11:51:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1425 transitions. [2018-12-09 11:51:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2018-12-09 11:51:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-12-09 11:51:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2018-12-09 11:51:17,830 INFO L728 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2018-12-09 11:51:17,830 INFO L608 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2018-12-09 11:51:17,830 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 11:51:17,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1425 transitions. [2018-12-09 11:51:17,835 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2018-12-09 11:51:17,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,836 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] [2018-12-09 11:51:17,836 INFO L794 eck$LassoCheckResult]: Stem: 2900#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 2901#L153-1 [2018-12-09 11:51:17,836 INFO L796 eck$LassoCheckResult]: Loop: 2901#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3094#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 3092#L66 assume !(0 != main_~p1~0); 3090#L66-2 assume !(0 != main_~p2~0); 3089#L70-1 assume !(0 != main_~p3~0); 3087#L74-1 assume !(0 != main_~p4~0); 3085#L78-1 assume !(0 != main_~p5~0); 3082#L82-1 assume !(0 != main_~p6~0); 3073#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3074#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3059#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3060#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3043#L102-1 assume !(0 != main_~p1~0); 3044#L108-1 assume !(0 != main_~p2~0); 3026#L113-1 assume !(0 != main_~p3~0); 3025#L118-1 assume !(0 != main_~p4~0); 3003#L123-1 assume !(0 != main_~p5~0); 3004#L128-1 assume !(0 != main_~p6~0); 3102#L133-1 assume !(0 != main_~p7~0); 3100#L138-1 assume !(0 != main_~p8~0); 3098#L143-1 assume !(0 != main_~p9~0); 3096#L148-1 assume !(0 != main_~p10~0); 2901#L153-1 [2018-12-09 11:51:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-12-09 11:51:17,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,843 INFO L82 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times [2018-12-09 11:51:17,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,862 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,862 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. cyclomatic complexity: 512 Second operand 3 states. [2018-12-09 11:51:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,879 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2018-12-09 11:51:17,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2753 transitions. [2018-12-09 11:51:17,892 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2018-12-09 11:51:17,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1857 states and 2753 transitions. [2018-12-09 11:51:17,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1857 [2018-12-09 11:51:17,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1857 [2018-12-09 11:51:17,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1857 states and 2753 transitions. [2018-12-09 11:51:17,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:17,904 INFO L705 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2018-12-09 11:51:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states and 2753 transitions. [2018-12-09 11:51:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2018-12-09 11:51:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2018-12-09 11:51:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2753 transitions. [2018-12-09 11:51:17,933 INFO L728 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2018-12-09 11:51:17,933 INFO L608 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2018-12-09 11:51:17,933 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 11:51:17,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1857 states and 2753 transitions. [2018-12-09 11:51:17,940 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2018-12-09 11:51:17,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:17,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:17,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:17,941 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] [2018-12-09 11:51:17,941 INFO L794 eck$LassoCheckResult]: Stem: 5707#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 5708#L153-1 [2018-12-09 11:51:17,941 INFO L796 eck$LassoCheckResult]: Loop: 5708#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 5792#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 5789#L66 assume !(0 != main_~p1~0); 5787#L66-2 assume !(0 != main_~p2~0); 5784#L70-1 assume !(0 != main_~p3~0); 5780#L74-1 assume !(0 != main_~p4~0); 5776#L78-1 assume !(0 != main_~p5~0); 5772#L82-1 assume !(0 != main_~p6~0); 5769#L86-1 assume !(0 != main_~p7~0); 5767#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5765#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5762#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5759#L102-1 assume !(0 != main_~p1~0); 5756#L108-1 assume !(0 != main_~p2~0); 5752#L113-1 assume !(0 != main_~p3~0); 5751#L118-1 assume !(0 != main_~p4~0); 5815#L123-1 assume !(0 != main_~p5~0); 5811#L128-1 assume !(0 != main_~p6~0); 5807#L133-1 assume !(0 != main_~p7~0); 5804#L138-1 assume !(0 != main_~p8~0); 5800#L143-1 assume !(0 != main_~p9~0); 5797#L148-1 assume !(0 != main_~p10~0); 5708#L153-1 [2018-12-09 11:51:17,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-12-09 11:51:17,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:17,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times [2018-12-09 11:51:17,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:17,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:17,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:17,965 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:17,966 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. cyclomatic complexity: 960 Second operand 3 states. [2018-12-09 11:51:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:17,991 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2018-12-09 11:51:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:17,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3649 states and 5313 transitions. [2018-12-09 11:51:18,010 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2018-12-09 11:51:18,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3649 states to 3649 states and 5313 transitions. [2018-12-09 11:51:18,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3649 [2018-12-09 11:51:18,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3649 [2018-12-09 11:51:18,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3649 states and 5313 transitions. [2018-12-09 11:51:18,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:18,028 INFO L705 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2018-12-09 11:51:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states and 5313 transitions. [2018-12-09 11:51:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3649. [2018-12-09 11:51:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-12-09 11:51:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5313 transitions. [2018-12-09 11:51:18,067 INFO L728 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2018-12-09 11:51:18,067 INFO L608 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2018-12-09 11:51:18,067 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 11:51:18,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 5313 transitions. [2018-12-09 11:51:18,076 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2018-12-09 11:51:18,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:18,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:18,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:18,077 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] [2018-12-09 11:51:18,077 INFO L794 eck$LassoCheckResult]: Stem: 11215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 11216#L153-1 [2018-12-09 11:51:18,077 INFO L796 eck$LassoCheckResult]: Loop: 11216#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11415#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 11362#L66 assume !(0 != main_~p1~0); 11364#L66-2 assume !(0 != main_~p2~0); 11381#L70-1 assume !(0 != main_~p3~0); 11382#L74-1 assume !(0 != main_~p4~0); 11490#L78-1 assume !(0 != main_~p5~0); 11483#L82-1 assume !(0 != main_~p6~0); 11485#L86-1 assume !(0 != main_~p7~0); 11476#L90-1 assume !(0 != main_~p8~0); 11478#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11470#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11471#L102-1 assume !(0 != main_~p1~0); 11519#L108-1 assume !(0 != main_~p2~0); 11517#L113-1 assume !(0 != main_~p3~0); 11512#L118-1 assume !(0 != main_~p4~0); 11513#L123-1 assume !(0 != main_~p5~0); 11532#L128-1 assume !(0 != main_~p6~0); 11530#L133-1 assume !(0 != main_~p7~0); 11529#L138-1 assume !(0 != main_~p8~0); 11426#L143-1 assume !(0 != main_~p9~0); 11425#L148-1 assume !(0 != main_~p10~0); 11216#L153-1 [2018-12-09 11:51:18,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-12-09 11:51:18,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times [2018-12-09 11:51:18,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:18,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:18,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:51:18,091 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:18,091 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2018-12-09 11:51:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:18,119 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2018-12-09 11:51:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:18,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7169 states and 10241 transitions. [2018-12-09 11:51:18,157 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2018-12-09 11:51:18,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7169 states to 7169 states and 10241 transitions. [2018-12-09 11:51:18,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2018-12-09 11:51:18,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7169 [2018-12-09 11:51:18,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7169 states and 10241 transitions. [2018-12-09 11:51:18,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:18,188 INFO L705 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2018-12-09 11:51:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states and 10241 transitions. [2018-12-09 11:51:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2018-12-09 11:51:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2018-12-09 11:51:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 10241 transitions. [2018-12-09 11:51:18,271 INFO L728 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2018-12-09 11:51:18,271 INFO L608 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2018-12-09 11:51:18,271 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 11:51:18,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7169 states and 10241 transitions. [2018-12-09 11:51:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2018-12-09 11:51:18,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:18,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:18,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:18,294 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] [2018-12-09 11:51:18,294 INFO L794 eck$LassoCheckResult]: Stem: 22045#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 22046#L153-1 [2018-12-09 11:51:18,294 INFO L796 eck$LassoCheckResult]: Loop: 22046#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22320#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 22315#L66 assume !(0 != main_~p1~0); 22316#L66-2 assume !(0 != main_~p2~0); 22303#L70-1 assume !(0 != main_~p3~0); 22304#L74-1 assume !(0 != main_~p4~0); 22412#L78-1 assume !(0 != main_~p5~0); 22408#L82-1 assume !(0 != main_~p6~0); 22404#L86-1 assume !(0 != main_~p7~0); 22398#L90-1 assume !(0 != main_~p8~0); 22392#L94-1 assume !(0 != main_~p9~0); 22389#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22384#L102-1 assume !(0 != main_~p1~0); 22378#L108-1 assume !(0 != main_~p2~0); 22373#L113-1 assume !(0 != main_~p3~0); 22365#L118-1 assume !(0 != main_~p4~0); 22361#L123-1 assume !(0 != main_~p5~0); 22358#L128-1 assume !(0 != main_~p6~0); 22354#L133-1 assume !(0 != main_~p7~0); 22348#L138-1 assume !(0 != main_~p8~0); 22342#L143-1 assume !(0 != main_~p9~0); 22331#L148-1 assume !(0 != main_~p10~0); 22046#L153-1 [2018-12-09 11:51:18,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-12-09 11:51:18,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times [2018-12-09 11:51:18,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:51:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:51:18,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:51:18,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:51:18,313 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:51:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:51:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:51:18,313 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2018-12-09 11:51:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:51:18,346 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2018-12-09 11:51:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:51:18,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14081 states and 19713 transitions. [2018-12-09 11:51:18,380 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2018-12-09 11:51:18,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14081 states to 14081 states and 19713 transitions. [2018-12-09 11:51:18,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14081 [2018-12-09 11:51:18,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14081 [2018-12-09 11:51:18,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14081 states and 19713 transitions. [2018-12-09 11:51:18,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:51:18,428 INFO L705 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2018-12-09 11:51:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states and 19713 transitions. [2018-12-09 11:51:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 14081. [2018-12-09 11:51:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14081 states. [2018-12-09 11:51:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 19713 transitions. [2018-12-09 11:51:18,547 INFO L728 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2018-12-09 11:51:18,547 INFO L608 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2018-12-09 11:51:18,547 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 11:51:18,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14081 states and 19713 transitions. [2018-12-09 11:51:18,574 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2018-12-09 11:51:18,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:51:18,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:51:18,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 11:51:18,574 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] [2018-12-09 11:51:18,574 INFO L794 eck$LassoCheckResult]: Stem: 43300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~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; 43301#L153-1 [2018-12-09 11:51:18,575 INFO L796 eck$LassoCheckResult]: Loop: 43301#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 43624#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 43621#L66 assume !(0 != main_~p1~0); 43617#L66-2 assume !(0 != main_~p2~0); 43614#L70-1 assume !(0 != main_~p3~0); 43611#L74-1 assume !(0 != main_~p4~0); 43607#L78-1 assume !(0 != main_~p5~0); 43604#L82-1 assume !(0 != main_~p6~0); 43600#L86-1 assume !(0 != main_~p7~0); 43601#L90-1 assume !(0 != main_~p8~0); 43649#L94-1 assume !(0 != main_~p9~0); 43748#L98-1 assume !(0 != main_~p10~0); 43750#L102-1 assume !(0 != main_~p1~0); 43657#L108-1 assume !(0 != main_~p2~0); 43654#L113-1 assume !(0 != main_~p3~0); 43650#L118-1 assume !(0 != main_~p4~0); 43645#L123-1 assume !(0 != main_~p5~0); 43460#L128-1 assume !(0 != main_~p6~0); 43462#L133-1 assume !(0 != main_~p7~0); 43634#L138-1 assume !(0 != main_~p8~0); 43630#L143-1 assume !(0 != main_~p9~0); 43627#L148-1 assume !(0 != main_~p10~0); 43301#L153-1 [2018-12-09 11:51:18,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2018-12-09 11:51:18,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times [2018-12-09 11:51:18,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:51:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:51:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash -962117286, now seen corresponding path program 1 times [2018-12-09 11:51:18,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:51:18,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:51:18,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:51:18,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:51:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:51:18,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 11:51:18 BoogieIcfgContainer [2018-12-09 11:51:18,716 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 11:51:18,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:51:18,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:51:18,717 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:51:18,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:51:17" (3/4) ... [2018-12-09 11:51:18,720 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 11:51:18,760 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_427530b4-69fa-4726-9a78-7006ce004f86/bin-2019/uautomizer/witness.graphml [2018-12-09 11:51:18,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:51:18,761 INFO L168 Benchmark]: Toolchain (without parser) took 1773.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 954.4 MB in the beginning and 898.0 MB in the end (delta: 56.4 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,762 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:51:18,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.49 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.05 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,763 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,763 INFO L168 Benchmark]: RCFGBuilder took 163.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,764 INFO L168 Benchmark]: BuchiAutomizer took 1360.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,764 INFO L168 Benchmark]: Witness Printer took 43.68 ms. Allocated memory is still 1.1 GB. Free memory was 901.5 MB in the beginning and 898.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:51:18,765 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.49 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.05 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1360.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. * Witness Printer took 43.68 ms. Allocated memory is still 1.1 GB. Free memory was 901.5 MB in the beginning and 898.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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 14081 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 14081 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 713 SDtfs, 374 SDslu, 436 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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@23b79e6d=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b18c1f2=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@195164e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f4fe107=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fa6e425=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a244d73=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c23df16=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23f014cd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e93c348=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@182166e9=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@508fee79=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...