./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/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 5107685577f81a5867811396b2c0a05eb5630c95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 11:21:17,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:21:17,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:21:17,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:21:17,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:21:17,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:21:17,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:21:17,762 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:21:17,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:21:17,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:21:17,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:21:17,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:21:17,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:21:17,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:21:17,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:21:17,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:21:17,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:21:17,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:21:17,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:21:17,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:21:17,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:21:17,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:21:17,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:21:17,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:21:17,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:21:17,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:21:17,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:21:17,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:21:17,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:21:17,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:21:17,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:21:17,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:21:17,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:21:17,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:21:17,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:21:17,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:21:17,783 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:21:17,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:21:17,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:21:17,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:21:17,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:21:17,796 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:21:17,796 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:21:17,797 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:21:17,797 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:21:17,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:21:17,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:21:17,797 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:21:17,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:21:17,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:21:17,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:21:17,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:21:17,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:21:17,800 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:21:17,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:21:17,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:21:17,800 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:21:17,801 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:21:17,801 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_83209569-f30c-460e-8923-0c3299ad72ac/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-28 11:21:17,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:21:17,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:21:17,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:21:17,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:21:17,845 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:21:17,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:21:17,899 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/data/ae3caf07a/f6f55d19ba2d42fda0cd683d45492097/FLAG28e320e41 [2018-11-28 11:21:18,268 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:21:18,269 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:21:18,274 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/data/ae3caf07a/f6f55d19ba2d42fda0cd683d45492097/FLAG28e320e41 [2018-11-28 11:21:18,285 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/data/ae3caf07a/f6f55d19ba2d42fda0cd683d45492097 [2018-11-28 11:21:18,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:21:18,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:21:18,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:21:18,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:21:18,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:21:18,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5d7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18, skipping insertion in model container [2018-11-28 11:21:18,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:21:18,316 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:21:18,441 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:21:18,445 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:21:18,465 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:21:18,479 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:21:18,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18 WrapperNode [2018-11-28 11:21:18,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:21:18,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:21:18,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:21:18,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:21:18,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:21:18,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:21:18,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:21:18,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:21:18,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... [2018-11-28 11:21:18,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:21:18,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:21:18,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:21:18,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:21:18,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:21:18,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:21:18,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:21:18,893 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:21:18,893 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:21:18,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:18 BoogieIcfgContainer [2018-11-28 11:21:18,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:21:18,894 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:21:18,894 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:21:18,896 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:21:18,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:21:18,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:18" (1/3) ... [2018-11-28 11:21:18,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f9db13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:18, skipping insertion in model container [2018-11-28 11:21:18,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:21:18,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:18" (2/3) ... [2018-11-28 11:21:18,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f9db13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:18, skipping insertion in model container [2018-11-28 11:21:18,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:21:18,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:18" (3/3) ... [2018-11-28 11:21:18,901 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:21:18,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:21:18,942 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:21:18,942 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:21:18,942 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:21:18,942 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:21:18,942 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:21:18,942 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:21:18,943 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:21:18,943 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:21:18,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-28 11:21:18,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-28 11:21:18,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:18,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:18,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:18,975 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] [2018-11-28 11:21:18,975 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:21:18,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-28 11:21:18,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-28 11:21:18,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:18,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:18,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:18,978 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] [2018-11-28 11:21:18,983 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_~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_~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;havoc main_~cond~0; 31#L139-1true [2018-11-28 11:21:18,984 INFO L796 eck$LassoCheckResult]: Loop: 31#L139-1true assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L38true 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; 27#L61true assume 0 != main_~p1~0;main_~lk1~0 := 1; 24#L61-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 11#L65-1true assume !(0 != main_~p3~0); 20#L69-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L73-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 34#L77-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 23#L81-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 30#L85-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 17#L89-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L93-1true assume !(0 != main_~p1~0); 35#L99-1true assume !(0 != main_~p2~0); 6#L104-1true assume !(0 != main_~p3~0); 14#L109-1true assume !(0 != main_~p4~0); 26#L114-1true assume !(0 != main_~p5~0); 33#L119-1true assume !(0 != main_~p6~0); 3#L124-1true assume !(0 != main_~p7~0); 12#L129-1true assume !(0 != main_~p8~0); 22#L134-1true assume !(0 != main_~p9~0); 31#L139-1true [2018-11-28 11:21:18,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 11:21:18,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:18,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1889319211, now seen corresponding path program 1 times [2018-11-28 11:21:19,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,138 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,151 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-11-28 11:21:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,190 INFO L93 Difference]: Finished difference Result 68 states and 117 transitions. [2018-11-28 11:21:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 117 transitions. [2018-11-28 11:21:19,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-28 11:21:19,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 58 states and 92 transitions. [2018-11-28 11:21:19,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-28 11:21:19,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-28 11:21:19,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 92 transitions. [2018-11-28 11:21:19,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,202 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2018-11-28 11:21:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 92 transitions. [2018-11-28 11:21:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-28 11:21:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 11:21:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2018-11-28 11:21:19,226 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2018-11-28 11:21:19,226 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 92 transitions. [2018-11-28 11:21:19,226 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:21:19,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 92 transitions. [2018-11-28 11:21:19,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-28 11:21:19,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,228 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] [2018-11-28 11:21:19,229 INFO L794 eck$LassoCheckResult]: Stem: 143#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_~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_~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;havoc main_~cond~0; 144#L139-1 [2018-11-28 11:21:19,229 INFO L796 eck$LassoCheckResult]: Loop: 144#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 155#L38 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; 154#L61 assume !(0 != main_~p1~0); 139#L61-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 128#L65-1 assume !(0 != main_~p3~0); 129#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 124#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 125#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 149#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 148#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 147#L93-1 assume !(0 != main_~p1~0); 146#L99-1 assume !(0 != main_~p2~0); 119#L104-1 assume !(0 != main_~p3~0); 120#L109-1 assume !(0 != main_~p4~0); 127#L114-1 assume !(0 != main_~p5~0); 135#L119-1 assume !(0 != main_~p6~0); 112#L124-1 assume !(0 != main_~p7~0); 113#L129-1 assume !(0 != main_~p8~0); 157#L134-1 assume !(0 != main_~p9~0); 144#L139-1 [2018-11-28 11:21:19,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 11:21:19,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash 411503379, now seen corresponding path program 1 times [2018-11-28 11:21:19,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,268 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,268 INFO L87 Difference]: Start difference. First operand 58 states and 92 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-28 11:21:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,293 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2018-11-28 11:21:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 177 transitions. [2018-11-28 11:21:19,296 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2018-11-28 11:21:19,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 177 transitions. [2018-11-28 11:21:19,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2018-11-28 11:21:19,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2018-11-28 11:21:19,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 177 transitions. [2018-11-28 11:21:19,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,300 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2018-11-28 11:21:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 177 transitions. [2018-11-28 11:21:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-28 11:21:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-28 11:21:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2018-11-28 11:21:19,309 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2018-11-28 11:21:19,309 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 177 transitions. [2018-11-28 11:21:19,309 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:21:19,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 177 transitions. [2018-11-28 11:21:19,310 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2018-11-28 11:21:19,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,311 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] [2018-11-28 11:21:19,311 INFO L794 eck$LassoCheckResult]: Stem: 323#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_~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_~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;havoc main_~cond~0; 324#L139-1 [2018-11-28 11:21:19,312 INFO L796 eck$LassoCheckResult]: Loop: 324#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 292#L38 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; 293#L61 assume !(0 != main_~p1~0); 359#L61-2 assume !(0 != main_~p2~0); 358#L65-1 assume !(0 != main_~p3~0); 357#L69-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 356#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 355#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 354#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 353#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 352#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 350#L93-1 assume !(0 != main_~p1~0); 349#L99-1 assume !(0 != main_~p2~0); 347#L104-1 assume !(0 != main_~p3~0); 346#L109-1 assume !(0 != main_~p4~0); 341#L114-1 assume !(0 != main_~p5~0); 339#L119-1 assume !(0 != main_~p6~0); 338#L124-1 assume !(0 != main_~p7~0); 333#L129-1 assume !(0 != main_~p8~0); 331#L134-1 assume !(0 != main_~p9~0); 324#L139-1 [2018-11-28 11:21:19,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-28 11:21:19,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1176844523, now seen corresponding path program 1 times [2018-11-28 11:21:19,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,360 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,360 INFO L87 Difference]: Start difference. First operand 113 states and 177 transitions. cyclomatic complexity: 68 Second operand 3 states. [2018-11-28 11:21:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,390 INFO L93 Difference]: Finished difference Result 221 states and 341 transitions. [2018-11-28 11:21:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 341 transitions. [2018-11-28 11:21:19,392 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2018-11-28 11:21:19,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 341 transitions. [2018-11-28 11:21:19,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2018-11-28 11:21:19,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2018-11-28 11:21:19,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 341 transitions. [2018-11-28 11:21:19,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,395 INFO L705 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2018-11-28 11:21:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 341 transitions. [2018-11-28 11:21:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-11-28 11:21:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-28 11:21:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2018-11-28 11:21:19,411 INFO L728 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2018-11-28 11:21:19,411 INFO L608 BuchiCegarLoop]: Abstraction has 221 states and 341 transitions. [2018-11-28 11:21:19,411 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:21:19,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 341 transitions. [2018-11-28 11:21:19,413 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2018-11-28 11:21:19,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,414 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] [2018-11-28 11:21:19,414 INFO L794 eck$LassoCheckResult]: Stem: 663#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_~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_~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;havoc main_~cond~0; 664#L139-1 [2018-11-28 11:21:19,415 INFO L796 eck$LassoCheckResult]: Loop: 664#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 724#L38 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; 714#L61 assume !(0 != main_~p1~0); 716#L61-2 assume !(0 != main_~p2~0); 707#L65-1 assume !(0 != main_~p3~0); 708#L69-1 assume !(0 != main_~p4~0); 770#L73-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 769#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 768#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 767#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 766#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 765#L93-1 assume !(0 != main_~p1~0); 762#L99-1 assume !(0 != main_~p2~0); 760#L104-1 assume !(0 != main_~p3~0); 756#L109-1 assume !(0 != main_~p4~0); 757#L114-1 assume !(0 != main_~p5~0); 752#L119-1 assume !(0 != main_~p6~0); 751#L124-1 assume !(0 != main_~p7~0); 746#L129-1 assume !(0 != main_~p8~0); 745#L134-1 assume !(0 != main_~p9~0); 664#L139-1 [2018-11-28 11:21:19,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-28 11:21:19,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1838259095, now seen corresponding path program 1 times [2018-11-28 11:21:19,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,449 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,449 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. cyclomatic complexity: 128 Second operand 3 states. [2018-11-28 11:21:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,470 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2018-11-28 11:21:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 657 transitions. [2018-11-28 11:21:19,472 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2018-11-28 11:21:19,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 657 transitions. [2018-11-28 11:21:19,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2018-11-28 11:21:19,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2018-11-28 11:21:19,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 657 transitions. [2018-11-28 11:21:19,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,478 INFO L705 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2018-11-28 11:21:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 657 transitions. [2018-11-28 11:21:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-11-28 11:21:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-28 11:21:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 657 transitions. [2018-11-28 11:21:19,494 INFO L728 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2018-11-28 11:21:19,494 INFO L608 BuchiCegarLoop]: Abstraction has 433 states and 657 transitions. [2018-11-28 11:21:19,494 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:21:19,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 657 transitions. [2018-11-28 11:21:19,497 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2018-11-28 11:21:19,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,498 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] [2018-11-28 11:21:19,498 INFO L794 eck$LassoCheckResult]: Stem: 1324#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_~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_~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;havoc main_~cond~0; 1325#L139-1 [2018-11-28 11:21:19,498 INFO L796 eck$LassoCheckResult]: Loop: 1325#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 1372#L38 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; 1370#L61 assume !(0 != main_~p1~0); 1366#L61-2 assume !(0 != main_~p2~0); 1364#L65-1 assume !(0 != main_~p3~0); 1360#L69-1 assume !(0 != main_~p4~0); 1356#L73-1 assume !(0 != main_~p5~0); 1354#L77-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1352#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1350#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1348#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1346#L93-1 assume !(0 != main_~p1~0); 1340#L99-1 assume !(0 != main_~p2~0); 1342#L104-1 assume !(0 != main_~p3~0); 1397#L109-1 assume !(0 != main_~p4~0); 1393#L114-1 assume !(0 != main_~p5~0); 1390#L119-1 assume !(0 != main_~p6~0); 1385#L124-1 assume !(0 != main_~p7~0); 1382#L129-1 assume !(0 != main_~p8~0); 1376#L134-1 assume !(0 != main_~p9~0); 1325#L139-1 [2018-11-28 11:21:19,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-28 11:21:19,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 827141845, now seen corresponding path program 1 times [2018-11-28 11:21:19,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,522 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,523 INFO L87 Difference]: Start difference. First operand 433 states and 657 transitions. cyclomatic complexity: 240 Second operand 3 states. [2018-11-28 11:21:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,552 INFO L93 Difference]: Finished difference Result 849 states and 1265 transitions. [2018-11-28 11:21:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 849 states and 1265 transitions. [2018-11-28 11:21:19,559 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2018-11-28 11:21:19,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 849 states to 849 states and 1265 transitions. [2018-11-28 11:21:19,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2018-11-28 11:21:19,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 849 [2018-11-28 11:21:19,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1265 transitions. [2018-11-28 11:21:19,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,564 INFO L705 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2018-11-28 11:21:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1265 transitions. [2018-11-28 11:21:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-28 11:21:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-28 11:21:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1265 transitions. [2018-11-28 11:21:19,584 INFO L728 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2018-11-28 11:21:19,584 INFO L608 BuchiCegarLoop]: Abstraction has 849 states and 1265 transitions. [2018-11-28 11:21:19,584 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:21:19,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1265 transitions. [2018-11-28 11:21:19,588 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2018-11-28 11:21:19,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,588 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] [2018-11-28 11:21:19,589 INFO L794 eck$LassoCheckResult]: Stem: 2614#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_~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_~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;havoc main_~cond~0; 2615#L139-1 [2018-11-28 11:21:19,589 INFO L796 eck$LassoCheckResult]: Loop: 2615#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 2769#L38 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; 2767#L61 assume !(0 != main_~p1~0); 2764#L61-2 assume !(0 != main_~p2~0); 2765#L65-1 assume !(0 != main_~p3~0); 2746#L69-1 assume !(0 != main_~p4~0); 2748#L73-1 assume !(0 != main_~p5~0); 2732#L77-1 assume !(0 != main_~p6~0); 2734#L81-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2718#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2719#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2700#L93-1 assume !(0 != main_~p1~0); 2702#L99-1 assume !(0 != main_~p2~0); 2791#L104-1 assume !(0 != main_~p3~0); 2788#L109-1 assume !(0 != main_~p4~0); 2786#L114-1 assume !(0 != main_~p5~0); 2784#L119-1 assume !(0 != main_~p6~0); 2780#L124-1 assume !(0 != main_~p7~0); 2777#L129-1 assume !(0 != main_~p8~0); 2773#L134-1 assume !(0 != main_~p9~0); 2615#L139-1 [2018-11-28 11:21:19,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-11-28 11:21:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 240335831, now seen corresponding path program 1 times [2018-11-28 11:21:19,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,620 INFO L87 Difference]: Start difference. First operand 849 states and 1265 transitions. cyclomatic complexity: 448 Second operand 3 states. [2018-11-28 11:21:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,650 INFO L93 Difference]: Finished difference Result 1665 states and 2433 transitions. [2018-11-28 11:21:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1665 states and 2433 transitions. [2018-11-28 11:21:19,662 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2018-11-28 11:21:19,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1665 states to 1665 states and 2433 transitions. [2018-11-28 11:21:19,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2018-11-28 11:21:19,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1665 [2018-11-28 11:21:19,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2433 transitions. [2018-11-28 11:21:19,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,671 INFO L705 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2018-11-28 11:21:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2433 transitions. [2018-11-28 11:21:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2018-11-28 11:21:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2018-11-28 11:21:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2433 transitions. [2018-11-28 11:21:19,691 INFO L728 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2018-11-28 11:21:19,691 INFO L608 BuchiCegarLoop]: Abstraction has 1665 states and 2433 transitions. [2018-11-28 11:21:19,691 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:21:19,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1665 states and 2433 transitions. [2018-11-28 11:21:19,697 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2018-11-28 11:21:19,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,698 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] [2018-11-28 11:21:19,698 INFO L794 eck$LassoCheckResult]: Stem: 5134#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_~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_~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;havoc main_~cond~0; 5135#L139-1 [2018-11-28 11:21:19,698 INFO L796 eck$LassoCheckResult]: Loop: 5135#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 5321#L38 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; 5319#L61 assume !(0 != main_~p1~0); 5317#L61-2 assume !(0 != main_~p2~0); 5316#L65-1 assume !(0 != main_~p3~0); 5313#L69-1 assume !(0 != main_~p4~0); 5309#L73-1 assume !(0 != main_~p5~0); 5305#L77-1 assume !(0 != main_~p6~0); 5306#L81-1 assume !(0 != main_~p7~0); 5284#L85-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5285#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5270#L93-1 assume !(0 != main_~p1~0); 5271#L99-1 assume !(0 != main_~p2~0); 5245#L104-1 assume !(0 != main_~p3~0); 5244#L109-1 assume !(0 != main_~p4~0); 5225#L114-1 assume !(0 != main_~p5~0); 5227#L119-1 assume !(0 != main_~p6~0); 5326#L124-1 assume !(0 != main_~p7~0); 5325#L129-1 assume !(0 != main_~p8~0); 5323#L134-1 assume !(0 != main_~p9~0); 5135#L139-1 [2018-11-28 11:21:19,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-11-28 11:21:19,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash 498501269, now seen corresponding path program 1 times [2018-11-28 11:21:19,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:19,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,728 INFO L87 Difference]: Start difference. First operand 1665 states and 2433 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-28 11:21:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,773 INFO L93 Difference]: Finished difference Result 3265 states and 4673 transitions. [2018-11-28 11:21:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 4673 transitions. [2018-11-28 11:21:19,790 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2018-11-28 11:21:19,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 3265 states and 4673 transitions. [2018-11-28 11:21:19,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3265 [2018-11-28 11:21:19,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3265 [2018-11-28 11:21:19,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3265 states and 4673 transitions. [2018-11-28 11:21:19,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,805 INFO L705 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2018-11-28 11:21:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states and 4673 transitions. [2018-11-28 11:21:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3265. [2018-11-28 11:21:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2018-11-28 11:21:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4673 transitions. [2018-11-28 11:21:19,850 INFO L728 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2018-11-28 11:21:19,850 INFO L608 BuchiCegarLoop]: Abstraction has 3265 states and 4673 transitions. [2018-11-28 11:21:19,850 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:21:19,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3265 states and 4673 transitions. [2018-11-28 11:21:19,862 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2018-11-28 11:21:19,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:19,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:19,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:19,863 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] [2018-11-28 11:21:19,863 INFO L794 eck$LassoCheckResult]: Stem: 10069#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_~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_~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;havoc main_~cond~0; 10070#L139-1 [2018-11-28 11:21:19,863 INFO L796 eck$LassoCheckResult]: Loop: 10070#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 10336#L38 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; 10334#L61 assume !(0 != main_~p1~0); 10332#L61-2 assume !(0 != main_~p2~0); 10329#L65-1 assume !(0 != main_~p3~0); 10326#L69-1 assume !(0 != main_~p4~0); 10322#L73-1 assume !(0 != main_~p5~0); 10318#L77-1 assume !(0 != main_~p6~0); 10319#L81-1 assume !(0 != main_~p7~0); 10299#L85-1 assume !(0 != main_~p8~0); 10301#L89-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 10284#L93-1 assume !(0 != main_~p1~0); 10286#L99-1 assume !(0 != main_~p2~0); 10242#L104-1 assume !(0 != main_~p3~0); 10241#L109-1 assume !(0 != main_~p4~0); 10225#L114-1 assume !(0 != main_~p5~0); 10227#L119-1 assume !(0 != main_~p6~0); 10342#L124-1 assume !(0 != main_~p7~0); 10340#L129-1 assume !(0 != main_~p8~0); 10339#L134-1 assume !(0 != main_~p9~0); 10070#L139-1 [2018-11-28 11:21:19,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-11-28 11:21:19,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:19,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1199565847, now seen corresponding path program 1 times [2018-11-28 11:21:19,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:19,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:19,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:19,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:21:19,889 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:21:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:19,889 INFO L87 Difference]: Start difference. First operand 3265 states and 4673 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2018-11-28 11:21:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:19,927 INFO L93 Difference]: Finished difference Result 6401 states and 8961 transitions. [2018-11-28 11:21:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:19,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6401 states and 8961 transitions. [2018-11-28 11:21:19,954 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2018-11-28 11:21:19,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6401 states to 6401 states and 8961 transitions. [2018-11-28 11:21:19,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6401 [2018-11-28 11:21:19,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6401 [2018-11-28 11:21:19,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6401 states and 8961 transitions. [2018-11-28 11:21:19,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:21:19,985 INFO L705 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2018-11-28 11:21:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states and 8961 transitions. [2018-11-28 11:21:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6401. [2018-11-28 11:21:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2018-11-28 11:21:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 8961 transitions. [2018-11-28 11:21:20,074 INFO L728 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2018-11-28 11:21:20,074 INFO L608 BuchiCegarLoop]: Abstraction has 6401 states and 8961 transitions. [2018-11-28 11:21:20,074 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:21:20,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6401 states and 8961 transitions. [2018-11-28 11:21:20,092 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2018-11-28 11:21:20,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:21:20,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:21:20,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 11:21:20,093 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] [2018-11-28 11:21:20,093 INFO L794 eck$LassoCheckResult]: Stem: 19746#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_~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_~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;havoc main_~cond~0; 19747#L139-1 [2018-11-28 11:21:20,094 INFO L796 eck$LassoCheckResult]: Loop: 19747#L139-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 20162#L38 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; 20160#L61 assume !(0 != main_~p1~0); 20158#L61-2 assume !(0 != main_~p2~0); 20157#L65-1 assume !(0 != main_~p3~0); 20029#L69-1 assume !(0 != main_~p4~0); 20031#L73-1 assume !(0 != main_~p5~0); 20146#L77-1 assume !(0 != main_~p6~0); 20142#L81-1 assume !(0 != main_~p7~0); 20138#L85-1 assume !(0 != main_~p8~0); 20090#L89-1 assume !(0 != main_~p9~0); 20092#L93-1 assume !(0 != main_~p1~0); 20079#L99-1 assume !(0 != main_~p2~0); 20081#L104-1 assume !(0 != main_~p3~0); 20073#L109-1 assume !(0 != main_~p4~0); 20074#L114-1 assume !(0 != main_~p5~0); 20068#L119-1 assume !(0 != main_~p6~0); 20069#L124-1 assume !(0 != main_~p7~0); 20175#L129-1 assume !(0 != main_~p8~0); 20089#L134-1 assume !(0 != main_~p9~0); 19747#L139-1 [2018-11-28 11:21:20,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-11-28 11:21:20,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 806538837, now seen corresponding path program 1 times [2018-11-28 11:21:20,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:21:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1231517452, now seen corresponding path program 1 times [2018-11-28 11:21:20,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:20,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:21:20,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:20 BoogieIcfgContainer [2018-11-28 11:21:20,286 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:21:20,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:21:20,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:21:20,287 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:21:20,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:18" (3/4) ... [2018-11-28 11:21:20,290 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 11:21:20,336 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_83209569-f30c-460e-8923-0c3299ad72ac/bin-2019/uautomizer/witness.graphml [2018-11-28 11:21:20,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:21:20,339 INFO L168 Benchmark]: Toolchain (without parser) took 2049.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.2 MB in the beginning and 851.3 MB in the end (delta: 100.9 MB). Peak memory consumption was 233.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,340 INFO L168 Benchmark]: CDTParser took 0.18 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-11-28 11:21:20,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.74 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.30 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,342 INFO L168 Benchmark]: Boogie Preprocessor took 61.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,342 INFO L168 Benchmark]: RCFGBuilder took 319.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,342 INFO L168 Benchmark]: BuchiAutomizer took 1392.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.8 MB in the end (delta: 250.7 MB). Peak memory consumption was 250.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,343 INFO L168 Benchmark]: Witness Printer took 51.39 ms. Allocated memory is still 1.2 GB. Free memory was 854.8 MB in the beginning and 851.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:20,345 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.18 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 189.74 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.30 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 319.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1392.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 854.8 MB in the end (delta: 250.7 MB). Peak memory consumption was 250.7 MB. Max. memory is 11.5 GB. * Witness Printer took 51.39 ms. Allocated memory is still 1.2 GB. Free memory was 854.8 MB in the beginning and 851.3 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6401 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 6401 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 575 SDtfs, 301 SDslu, 348 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28e18f30=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52bfc377=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@786b8bd8=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2565dea3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30495db6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e188cd4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@237add3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d8d0687=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c0e5023=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6135835e=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: 36]: 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; [L34] int cond; Loop: [L36] COND TRUE 1 [L37] cond = __VERIFIER_nondet_int() [L38] COND FALSE !(cond == 0) [L41] lk1 = 0 [L43] lk2 = 0 [L45] lk3 = 0 [L47] lk4 = 0 [L49] lk5 = 0 [L51] lk6 = 0 [L53] lk7 = 0 [L55] lk8 = 0 [L57] lk9 = 0 [L61] COND FALSE !(p1 != 0) [L65] COND FALSE !(p2 != 0) [L69] COND FALSE !(p3 != 0) [L73] COND FALSE !(p4 != 0) [L77] COND FALSE !(p5 != 0) [L81] COND FALSE !(p6 != 0) [L85] COND FALSE !(p7 != 0) [L89] COND FALSE !(p8 != 0) [L93] COND FALSE !(p9 != 0) [L99] COND FALSE !(p1 != 0) [L104] COND FALSE !(p2 != 0) [L109] COND FALSE !(p3 != 0) [L114] COND FALSE !(p4 != 0) [L119] COND FALSE !(p5 != 0) [L124] COND FALSE !(p6 != 0) [L129] COND FALSE !(p7 != 0) [L134] COND FALSE !(p8 != 0) [L139] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...