./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/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 4892275a211cad54ffe3d940980c258aec58e47d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:14:33,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:14:33,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:14:33,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:14:33,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:14:33,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:14:33,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:14:33,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:14:33,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:14:33,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:14:33,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:14:33,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:14:33,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:14:33,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:14:33,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:14:33,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:14:33,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:14:33,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:14:33,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:14:33,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:14:33,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:14:33,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:14:33,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:14:33,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:14:33,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:14:33,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:14:33,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:14:33,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:14:33,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:14:33,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:14:33,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:14:33,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:14:33,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:14:33,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:14:33,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:14:33,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:14:33,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:14:33,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:14:33,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:14:33,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:14:33,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:14:33,969 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:14:33,969 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:14:33,969 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:14:33,969 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:14:33,969 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:14:33,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:14:33,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:14:33,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:14:33,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:14:33,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:14:33,972 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:14:33,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:14:33,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:14:33,972 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:14:33,973 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:14:33,973 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_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/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 -> 4892275a211cad54ffe3d940980c258aec58e47d [2018-11-10 12:14:33,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:14:34,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:14:34,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:14:34,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:14:34,006 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:14:34,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:14:34,041 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/data/98d1719f4/c3412bf26f5c460db0df75f478dfd8c8/FLAG51379913b [2018-11-10 12:14:34,437 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:14:34,437 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/sv-benchmarks/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:14:34,442 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/data/98d1719f4/c3412bf26f5c460db0df75f478dfd8c8/FLAG51379913b [2018-11-10 12:14:34,451 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/data/98d1719f4/c3412bf26f5c460db0df75f478dfd8c8 [2018-11-10 12:14:34,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:14:34,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:14:34,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:14:34,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:14:34,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:14:34,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34, skipping insertion in model container [2018-11-10 12:14:34,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:14:34,481 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:14:34,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:14:34,584 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:14:34,605 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:14:34,617 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:14:34,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34 WrapperNode [2018-11-10 12:14:34,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:14:34,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:14:34,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:14:34,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:14:34,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:14:34,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:14:34,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:14:34,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:14:34,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... [2018-11-10 12:14:34,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:14:34,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:14:34,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:14:34,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:14:34,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:14:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:14:34,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:14:34,957 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:14:34,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:34 BoogieIcfgContainer [2018-11-10 12:14:34,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:14:34,958 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:14:34,958 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:14:34,960 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:14:34,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:34,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:14:34" (1/3) ... [2018-11-10 12:14:34,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f0eff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:14:34, skipping insertion in model container [2018-11-10 12:14:34,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:34,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:14:34" (2/3) ... [2018-11-10 12:14:34,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f0eff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:14:34, skipping insertion in model container [2018-11-10 12:14:34,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:14:34,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:34" (3/3) ... [2018-11-10 12:14:34,966 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:14:35,022 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:14:35,023 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:14:35,023 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:14:35,023 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:14:35,023 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:14:35,023 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:14:35,023 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:14:35,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:14:35,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:14:35,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 12:14:35,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 12:14:35,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,060 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:14:35,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2018-11-10 12:14:35,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 12:14:35,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,069 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2018-11-10 12:14:35,070 INFO L795 eck$LassoCheckResult]: Loop: 9#L223-1true assume true; 12#L54-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 43#L56true assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume main_~p1~0 != 0;main_~lk1~0 := 1; 19#L91-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 10#L95-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 32#L99-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 23#L103-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 40#L107-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 45#L111-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 37#L115-1true assume !(main_~p8~0 != 0); 54#L119-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 46#L123-1true assume main_~p10~0 != 0;main_~lk10~0 := 1; 51#L127-1true assume main_~p11~0 != 0;main_~lk11~0 := 1; 16#L131-1true assume main_~p12~0 != 0;main_~lk12~0 := 1; 6#L135-1true assume main_~p13~0 != 0;main_~lk13~0 := 1; 29#L139-1true assume main_~p14~0 != 0;main_~lk14~0 := 1; 34#L143-1true assume main_~p15~0 != 0;main_~lk15~0 := 1; 25#L147-1true assume !(main_~p1~0 != 0); 17#L153-1true assume main_~p2~0 != 0; 52#L159true assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 26#L158true assume !(main_~p3~0 != 0); 56#L163-1true assume !(main_~p4~0 != 0); 7#L168-1true assume !(main_~p5~0 != 0); 42#L173-1true assume !(main_~p6~0 != 0); 49#L178-1true assume !(main_~p7~0 != 0); 31#L183-1true assume !(main_~p8~0 != 0); 35#L188-1true assume !(main_~p9~0 != 0); 13#L193-1true assume !(main_~p10~0 != 0); 22#L198-1true assume !(main_~p11~0 != 0); 53#L203-1true assume !(main_~p12~0 != 0); 3#L208-1true assume !(main_~p13~0 != 0); 28#L213-1true assume main_~p14~0 != 0; 5#L219true assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 47#L218true assume !(main_~p15~0 != 0); 9#L223-1true [2018-11-10 12:14:35,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:14:35,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash -269332208, now seen corresponding path program 1 times [2018-11-10 12:14:35,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,207 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,218 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-11-10 12:14:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,255 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-10 12:14:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 192 transitions. [2018-11-10 12:14:35,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 95 [2018-11-10 12:14:35,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 97 states and 151 transitions. [2018-11-10 12:14:35,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2018-11-10 12:14:35,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2018-11-10 12:14:35,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 151 transitions. [2018-11-10 12:14:35,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,265 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 151 transitions. [2018-11-10 12:14:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 151 transitions. [2018-11-10 12:14:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-10 12:14:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 12:14:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 151 transitions. [2018-11-10 12:14:35,286 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 151 transitions. [2018-11-10 12:14:35,286 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 151 transitions. [2018-11-10 12:14:35,286 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:14:35,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 151 transitions. [2018-11-10 12:14:35,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 95 [2018-11-10 12:14:35,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,289 INFO L793 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 185#L223-1 [2018-11-10 12:14:35,289 INFO L795 eck$LassoCheckResult]: Loop: 185#L223-1 assume true; 186#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 190#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 227#L91 assume !(main_~p1~0 != 0); 199#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 187#L95-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 188#L99-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 204#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 205#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 219#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 217#L115-1 assume !(main_~p8~0 != 0); 218#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 224#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 225#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 196#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 178#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 179#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 210#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 216#L147-1 assume !(main_~p1~0 != 0); 197#L153-1 assume main_~p2~0 != 0; 198#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 208#L158 assume !(main_~p3~0 != 0); 201#L163-1 assume !(main_~p4~0 != 0); 180#L168-1 assume !(main_~p5~0 != 0); 181#L173-1 assume !(main_~p6~0 != 0); 184#L178-1 assume !(main_~p7~0 != 0); 212#L183-1 assume !(main_~p8~0 != 0); 213#L188-1 assume !(main_~p9~0 != 0); 191#L193-1 assume !(main_~p10~0 != 0); 193#L198-1 assume !(main_~p11~0 != 0); 195#L203-1 assume !(main_~p12~0 != 0); 234#L208-1 assume !(main_~p13~0 != 0); 232#L213-1 assume main_~p14~0 != 0; 231#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 230#L218 assume !(main_~p15~0 != 0); 185#L223-1 [2018-11-10 12:14:35,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 12:14:35,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 5427406, now seen corresponding path program 1 times [2018-11-10 12:14:35,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,337 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,338 INFO L87 Difference]: Start difference. First operand 97 states and 151 transitions. cyclomatic complexity: 56 Second operand 3 states. [2018-11-10 12:14:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,351 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2018-11-10 12:14:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 294 transitions. [2018-11-10 12:14:35,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 188 [2018-11-10 12:14:35,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 190 states and 294 transitions. [2018-11-10 12:14:35,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-10 12:14:35,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-10 12:14:35,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 294 transitions. [2018-11-10 12:14:35,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,357 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 294 transitions. [2018-11-10 12:14:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 294 transitions. [2018-11-10 12:14:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-10 12:14:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 12:14:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 294 transitions. [2018-11-10 12:14:35,364 INFO L728 BuchiCegarLoop]: Abstraction has 190 states and 294 transitions. [2018-11-10 12:14:35,364 INFO L608 BuchiCegarLoop]: Abstraction has 190 states and 294 transitions. [2018-11-10 12:14:35,364 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:14:35,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 294 transitions. [2018-11-10 12:14:35,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 188 [2018-11-10 12:14:35,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,366 INFO L793 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 483#L223-1 [2018-11-10 12:14:35,366 INFO L795 eck$LassoCheckResult]: Loop: 483#L223-1 assume true; 536#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 534#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 532#L91 assume !(main_~p1~0 != 0); 528#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 529#L95-1 assume !(main_~p3~0 != 0); 605#L99-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 604#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 603#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 602#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 601#L115-1 assume !(main_~p8~0 != 0); 600#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 599#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 598#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 597#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 596#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 595#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 594#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 593#L147-1 assume !(main_~p1~0 != 0); 592#L153-1 assume main_~p2~0 != 0; 590#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 587#L158 assume !(main_~p3~0 != 0); 585#L163-1 assume !(main_~p4~0 != 0); 580#L168-1 assume !(main_~p5~0 != 0); 577#L173-1 assume !(main_~p6~0 != 0); 573#L178-1 assume !(main_~p7~0 != 0); 569#L183-1 assume !(main_~p8~0 != 0); 565#L188-1 assume !(main_~p9~0 != 0); 561#L193-1 assume !(main_~p10~0 != 0); 557#L198-1 assume !(main_~p11~0 != 0); 553#L203-1 assume !(main_~p12~0 != 0); 549#L208-1 assume !(main_~p13~0 != 0); 545#L213-1 assume main_~p14~0 != 0; 543#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 541#L218 assume !(main_~p15~0 != 0); 483#L223-1 [2018-11-10 12:14:35,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 12:14:35,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 28059660, now seen corresponding path program 1 times [2018-11-10 12:14:35,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,411 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,411 INFO L87 Difference]: Start difference. First operand 190 states and 294 transitions. cyclomatic complexity: 108 Second operand 3 states. [2018-11-10 12:14:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,442 INFO L93 Difference]: Finished difference Result 374 states and 574 transitions. [2018-11-10 12:14:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 574 transitions. [2018-11-10 12:14:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 372 [2018-11-10 12:14:35,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 374 states and 574 transitions. [2018-11-10 12:14:35,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 12:14:35,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 12:14:35,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 574 transitions. [2018-11-10 12:14:35,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,450 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 574 transitions. [2018-11-10 12:14:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 574 transitions. [2018-11-10 12:14:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2018-11-10 12:14:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-10 12:14:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 574 transitions. [2018-11-10 12:14:35,465 INFO L728 BuchiCegarLoop]: Abstraction has 374 states and 574 transitions. [2018-11-10 12:14:35,465 INFO L608 BuchiCegarLoop]: Abstraction has 374 states and 574 transitions. [2018-11-10 12:14:35,465 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:14:35,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 574 transitions. [2018-11-10 12:14:35,468 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 372 [2018-11-10 12:14:35,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,470 INFO L793 eck$LassoCheckResult]: Stem: 1078#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1052#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1053#L223-1 [2018-11-10 12:14:35,470 INFO L795 eck$LassoCheckResult]: Loop: 1053#L223-1 assume true; 1110#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1111#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1102#L91 assume !(main_~p1~0 != 0); 1103#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 1255#L95-1 assume !(main_~p3~0 != 0); 1253#L99-1 assume !(main_~p4~0 != 0); 1251#L103-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1249#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1245#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1241#L115-1 assume !(main_~p8~0 != 0); 1237#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1233#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 1210#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 1211#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 1202#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 1203#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 1194#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 1195#L147-1 assume !(main_~p1~0 != 0); 1223#L153-1 assume main_~p2~0 != 0; 1221#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 1218#L158 assume !(main_~p3~0 != 0); 1215#L163-1 assume !(main_~p4~0 != 0); 1216#L168-1 assume !(main_~p5~0 != 0); 1171#L173-1 assume !(main_~p6~0 != 0); 1170#L178-1 assume !(main_~p7~0 != 0); 1159#L183-1 assume !(main_~p8~0 != 0); 1158#L188-1 assume !(main_~p9~0 != 0); 1147#L193-1 assume !(main_~p10~0 != 0); 1142#L198-1 assume !(main_~p11~0 != 0); 1137#L203-1 assume !(main_~p12~0 != 0); 1136#L208-1 assume !(main_~p13~0 != 0); 1125#L213-1 assume main_~p14~0 != 0; 1126#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 1120#L218 assume !(main_~p15~0 != 0); 1053#L223-1 [2018-11-10 12:14:35,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 12:14:35,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1414263054, now seen corresponding path program 1 times [2018-11-10 12:14:35,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:35,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,502 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,502 INFO L87 Difference]: Start difference. First operand 374 states and 574 transitions. cyclomatic complexity: 208 Second operand 3 states. [2018-11-10 12:14:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,518 INFO L93 Difference]: Finished difference Result 738 states and 1122 transitions. [2018-11-10 12:14:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 738 states and 1122 transitions. [2018-11-10 12:14:35,522 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 736 [2018-11-10 12:14:35,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 738 states to 738 states and 1122 transitions. [2018-11-10 12:14:35,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 738 [2018-11-10 12:14:35,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 738 [2018-11-10 12:14:35,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 738 states and 1122 transitions. [2018-11-10 12:14:35,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,526 INFO L705 BuchiCegarLoop]: Abstraction has 738 states and 1122 transitions. [2018-11-10 12:14:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states and 1122 transitions. [2018-11-10 12:14:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-11-10 12:14:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-10 12:14:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1122 transitions. [2018-11-10 12:14:35,542 INFO L728 BuchiCegarLoop]: Abstraction has 738 states and 1122 transitions. [2018-11-10 12:14:35,542 INFO L608 BuchiCegarLoop]: Abstraction has 738 states and 1122 transitions. [2018-11-10 12:14:35,542 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:14:35,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 738 states and 1122 transitions. [2018-11-10 12:14:35,544 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 736 [2018-11-10 12:14:35,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,545 INFO L793 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2170#L223-1 [2018-11-10 12:14:35,546 INFO L795 eck$LassoCheckResult]: Loop: 2170#L223-1 assume true; 2281#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2279#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2277#L91 assume !(main_~p1~0 != 0); 2275#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 2271#L95-1 assume !(main_~p3~0 != 0); 2267#L99-1 assume !(main_~p4~0 != 0); 2263#L103-1 assume !(main_~p5~0 != 0); 2261#L107-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2259#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2257#L115-1 assume !(main_~p8~0 != 0); 2255#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 2253#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 2251#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 2249#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 2247#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 2245#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 2243#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 2240#L147-1 assume !(main_~p1~0 != 0); 2241#L153-1 assume main_~p2~0 != 0; 2231#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 2232#L158 assume !(main_~p3~0 != 0); 2326#L163-1 assume !(main_~p4~0 != 0); 2322#L168-1 assume !(main_~p5~0 != 0); 2319#L173-1 assume !(main_~p6~0 != 0); 2315#L178-1 assume !(main_~p7~0 != 0); 2311#L183-1 assume !(main_~p8~0 != 0); 2307#L188-1 assume !(main_~p9~0 != 0); 2303#L193-1 assume !(main_~p10~0 != 0); 2299#L198-1 assume !(main_~p11~0 != 0); 2295#L203-1 assume !(main_~p12~0 != 0); 2292#L208-1 assume !(main_~p13~0 != 0); 2289#L213-1 assume main_~p14~0 != 0; 2288#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 2285#L218 assume !(main_~p15~0 != 0); 2170#L223-1 [2018-11-10 12:14:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 12:14:35,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash 904789964, now seen corresponding path program 1 times [2018-11-10 12:14:35,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:35,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,575 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,576 INFO L87 Difference]: Start difference. First operand 738 states and 1122 transitions. cyclomatic complexity: 400 Second operand 3 states. [2018-11-10 12:14:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,599 INFO L93 Difference]: Finished difference Result 1458 states and 2194 transitions. [2018-11-10 12:14:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1458 states and 2194 transitions. [2018-11-10 12:14:35,609 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1456 [2018-11-10 12:14:35,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1458 states to 1458 states and 2194 transitions. [2018-11-10 12:14:35,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1458 [2018-11-10 12:14:35,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1458 [2018-11-10 12:14:35,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1458 states and 2194 transitions. [2018-11-10 12:14:35,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,616 INFO L705 BuchiCegarLoop]: Abstraction has 1458 states and 2194 transitions. [2018-11-10 12:14:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states and 2194 transitions. [2018-11-10 12:14:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2018-11-10 12:14:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-11-10 12:14:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2194 transitions. [2018-11-10 12:14:35,634 INFO L728 BuchiCegarLoop]: Abstraction has 1458 states and 2194 transitions. [2018-11-10 12:14:35,634 INFO L608 BuchiCegarLoop]: Abstraction has 1458 states and 2194 transitions. [2018-11-10 12:14:35,634 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:14:35,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1458 states and 2194 transitions. [2018-11-10 12:14:35,638 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1456 [2018-11-10 12:14:35,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,639 INFO L793 eck$LassoCheckResult]: Stem: 4396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4372#L223-1 [2018-11-10 12:14:35,639 INFO L795 eck$LassoCheckResult]: Loop: 4372#L223-1 assume true; 4491#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4489#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4487#L91 assume !(main_~p1~0 != 0); 4485#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 4481#L95-1 assume !(main_~p3~0 != 0); 4477#L99-1 assume !(main_~p4~0 != 0); 4473#L103-1 assume !(main_~p5~0 != 0); 4469#L107-1 assume !(main_~p6~0 != 0); 4467#L111-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 4465#L115-1 assume !(main_~p8~0 != 0); 4463#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 4461#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 4459#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 4457#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 4455#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 4453#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 4451#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 4448#L147-1 assume !(main_~p1~0 != 0); 4449#L153-1 assume main_~p2~0 != 0; 4439#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 4440#L158 assume !(main_~p3~0 != 0); 4538#L163-1 assume !(main_~p4~0 != 0); 4534#L168-1 assume !(main_~p5~0 != 0); 4530#L173-1 assume !(main_~p6~0 != 0); 4527#L178-1 assume !(main_~p7~0 != 0); 4523#L183-1 assume !(main_~p8~0 != 0); 4519#L188-1 assume !(main_~p9~0 != 0); 4515#L193-1 assume !(main_~p10~0 != 0); 4511#L198-1 assume !(main_~p11~0 != 0); 4507#L203-1 assume !(main_~p12~0 != 0); 4503#L208-1 assume !(main_~p13~0 != 0); 4500#L213-1 assume main_~p14~0 != 0; 4498#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 4495#L218 assume !(main_~p15~0 != 0); 4372#L223-1 [2018-11-10 12:14:35,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,639 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 12:14:35,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1466949298, now seen corresponding path program 1 times [2018-11-10 12:14:35,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,668 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,668 INFO L87 Difference]: Start difference. First operand 1458 states and 2194 transitions. cyclomatic complexity: 768 Second operand 3 states. [2018-11-10 12:14:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,690 INFO L93 Difference]: Finished difference Result 2882 states and 4290 transitions. [2018-11-10 12:14:35,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4290 transitions. [2018-11-10 12:14:35,708 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2880 [2018-11-10 12:14:35,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4290 transitions. [2018-11-10 12:14:35,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2018-11-10 12:14:35,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2018-11-10 12:14:35,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4290 transitions. [2018-11-10 12:14:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,726 INFO L705 BuchiCegarLoop]: Abstraction has 2882 states and 4290 transitions. [2018-11-10 12:14:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4290 transitions. [2018-11-10 12:14:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2018-11-10 12:14:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2018-11-10 12:14:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4290 transitions. [2018-11-10 12:14:35,778 INFO L728 BuchiCegarLoop]: Abstraction has 2882 states and 4290 transitions. [2018-11-10 12:14:35,778 INFO L608 BuchiCegarLoop]: Abstraction has 2882 states and 4290 transitions. [2018-11-10 12:14:35,778 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:14:35,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4290 transitions. [2018-11-10 12:14:35,790 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2880 [2018-11-10 12:14:35,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:35,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:35,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:35,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:35,792 INFO L793 eck$LassoCheckResult]: Stem: 8743#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8718#L223-1 [2018-11-10 12:14:35,792 INFO L795 eck$LassoCheckResult]: Loop: 8718#L223-1 assume true; 8869#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8865#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8861#L91 assume !(main_~p1~0 != 0); 8857#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 8850#L95-1 assume !(main_~p3~0 != 0); 8842#L99-1 assume !(main_~p4~0 != 0); 8834#L103-1 assume !(main_~p5~0 != 0); 8826#L107-1 assume !(main_~p6~0 != 0); 8819#L111-1 assume !(main_~p7~0 != 0); 8820#L115-1 assume !(main_~p8~0 != 0); 8810#L119-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 8811#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 8803#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 8800#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 8797#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 8794#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 8791#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 8792#L147-1 assume !(main_~p1~0 != 0); 8953#L153-1 assume main_~p2~0 != 0; 8947#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 8945#L158 assume !(main_~p3~0 != 0); 8935#L163-1 assume !(main_~p4~0 != 0); 8929#L168-1 assume !(main_~p5~0 != 0); 8927#L173-1 assume !(main_~p6~0 != 0); 8921#L178-1 assume !(main_~p7~0 != 0); 8920#L183-1 assume !(main_~p8~0 != 0); 8914#L188-1 assume !(main_~p9~0 != 0); 8908#L193-1 assume !(main_~p10~0 != 0); 8902#L198-1 assume !(main_~p11~0 != 0); 8896#L203-1 assume !(main_~p12~0 != 0); 8887#L208-1 assume !(main_~p13~0 != 0); 8884#L213-1 assume main_~p14~0 != 0; 8881#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 8878#L218 assume !(main_~p15~0 != 0); 8718#L223-1 [2018-11-10 12:14:35,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 12:14:35,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:35,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1404909684, now seen corresponding path program 1 times [2018-11-10 12:14:35,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:35,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:35,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:35,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:35,825 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:35,826 INFO L87 Difference]: Start difference. First operand 2882 states and 4290 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2018-11-10 12:14:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:35,860 INFO L93 Difference]: Finished difference Result 5698 states and 8386 transitions. [2018-11-10 12:14:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:35,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5698 states and 8386 transitions. [2018-11-10 12:14:35,890 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5696 [2018-11-10 12:14:35,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5698 states to 5698 states and 8386 transitions. [2018-11-10 12:14:35,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5698 [2018-11-10 12:14:35,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5698 [2018-11-10 12:14:35,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5698 states and 8386 transitions. [2018-11-10 12:14:35,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:35,926 INFO L705 BuchiCegarLoop]: Abstraction has 5698 states and 8386 transitions. [2018-11-10 12:14:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states and 8386 transitions. [2018-11-10 12:14:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2018-11-10 12:14:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2018-11-10 12:14:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8386 transitions. [2018-11-10 12:14:36,022 INFO L728 BuchiCegarLoop]: Abstraction has 5698 states and 8386 transitions. [2018-11-10 12:14:36,022 INFO L608 BuchiCegarLoop]: Abstraction has 5698 states and 8386 transitions. [2018-11-10 12:14:36,022 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:14:36,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5698 states and 8386 transitions. [2018-11-10 12:14:36,042 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5696 [2018-11-10 12:14:36,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:36,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:36,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:36,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:36,043 INFO L793 eck$LassoCheckResult]: Stem: 17327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 17304#L223-1 [2018-11-10 12:14:36,043 INFO L795 eck$LassoCheckResult]: Loop: 17304#L223-1 assume true; 17561#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17557#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17551#L91 assume !(main_~p1~0 != 0); 17497#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 17493#L95-1 assume !(main_~p3~0 != 0); 17489#L99-1 assume !(main_~p4~0 != 0); 17486#L103-1 assume !(main_~p5~0 != 0); 17420#L107-1 assume !(main_~p6~0 != 0); 17415#L111-1 assume !(main_~p7~0 != 0); 17416#L115-1 assume !(main_~p8~0 != 0); 17398#L119-1 assume !(main_~p9~0 != 0); 17399#L123-1 assume main_~p10~0 != 0;main_~lk10~0 := 1; 17686#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 17683#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 17680#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 17677#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 17676#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 17674#L147-1 assume !(main_~p1~0 != 0); 17673#L153-1 assume main_~p2~0 != 0; 17672#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 17670#L158 assume !(main_~p3~0 != 0); 17667#L163-1 assume !(main_~p4~0 != 0); 17664#L168-1 assume !(main_~p5~0 != 0); 17606#L173-1 assume !(main_~p6~0 != 0); 17604#L178-1 assume !(main_~p7~0 != 0); 17602#L183-1 assume !(main_~p8~0 != 0); 17597#L188-1 assume !(main_~p9~0 != 0); 17596#L193-1 assume !(main_~p10~0 != 0); 17592#L198-1 assume !(main_~p11~0 != 0); 17588#L203-1 assume !(main_~p12~0 != 0); 17582#L208-1 assume !(main_~p13~0 != 0); 17578#L213-1 assume main_~p14~0 != 0; 17572#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 17569#L218 assume !(main_~p15~0 != 0); 17304#L223-1 [2018-11-10 12:14:36,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 12:14:36,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1538923190, now seen corresponding path program 1 times [2018-11-10 12:14:36,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:36,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:36,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:36,072 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:36,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:36,072 INFO L87 Difference]: Start difference. First operand 5698 states and 8386 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2018-11-10 12:14:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:36,107 INFO L93 Difference]: Finished difference Result 11266 states and 16386 transitions. [2018-11-10 12:14:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:36,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11266 states and 16386 transitions. [2018-11-10 12:14:36,166 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11264 [2018-11-10 12:14:36,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11266 states to 11266 states and 16386 transitions. [2018-11-10 12:14:36,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11266 [2018-11-10 12:14:36,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11266 [2018-11-10 12:14:36,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11266 states and 16386 transitions. [2018-11-10 12:14:36,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:36,203 INFO L705 BuchiCegarLoop]: Abstraction has 11266 states and 16386 transitions. [2018-11-10 12:14:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states and 16386 transitions. [2018-11-10 12:14:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11266. [2018-11-10 12:14:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11266 states. [2018-11-10 12:14:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 16386 transitions. [2018-11-10 12:14:36,304 INFO L728 BuchiCegarLoop]: Abstraction has 11266 states and 16386 transitions. [2018-11-10 12:14:36,304 INFO L608 BuchiCegarLoop]: Abstraction has 11266 states and 16386 transitions. [2018-11-10 12:14:36,304 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:14:36,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11266 states and 16386 transitions. [2018-11-10 12:14:36,326 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11264 [2018-11-10 12:14:36,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:36,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:36,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:36,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:36,327 INFO L793 eck$LassoCheckResult]: Stem: 34301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 34274#L223-1 [2018-11-10 12:14:36,327 INFO L795 eck$LassoCheckResult]: Loop: 34274#L223-1 assume true; 34619#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 34617#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 34613#L91 assume !(main_~p1~0 != 0); 34611#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 34608#L95-1 assume !(main_~p3~0 != 0); 34602#L99-1 assume !(main_~p4~0 != 0); 34604#L103-1 assume !(main_~p5~0 != 0); 34590#L107-1 assume !(main_~p6~0 != 0); 34592#L111-1 assume !(main_~p7~0 != 0); 34582#L115-1 assume !(main_~p8~0 != 0); 34583#L119-1 assume !(main_~p9~0 != 0); 34570#L123-1 assume !(main_~p10~0 != 0); 34572#L127-1 assume main_~p11~0 != 0;main_~lk11~0 := 1; 34554#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 34555#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 34538#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 34539#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 34518#L147-1 assume !(main_~p1~0 != 0); 34519#L153-1 assume main_~p2~0 != 0; 34502#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 34503#L158 assume !(main_~p3~0 != 0); 34657#L163-1 assume !(main_~p4~0 != 0); 34655#L168-1 assume !(main_~p5~0 != 0); 34653#L173-1 assume !(main_~p6~0 != 0); 34651#L178-1 assume !(main_~p7~0 != 0); 34649#L183-1 assume !(main_~p8~0 != 0); 34646#L188-1 assume !(main_~p9~0 != 0); 34642#L193-1 assume !(main_~p10~0 != 0); 34639#L198-1 assume !(main_~p11~0 != 0); 34635#L203-1 assume !(main_~p12~0 != 0); 34631#L208-1 assume !(main_~p13~0 != 0); 34628#L213-1 assume main_~p14~0 != 0; 34626#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 34623#L218 assume !(main_~p15~0 != 0); 34274#L223-1 [2018-11-10 12:14:36,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 12:14:36,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 950605772, now seen corresponding path program 1 times [2018-11-10 12:14:36,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:36,350 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:36,350 INFO L87 Difference]: Start difference. First operand 11266 states and 16386 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2018-11-10 12:14:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:36,393 INFO L93 Difference]: Finished difference Result 22274 states and 32002 transitions. [2018-11-10 12:14:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:36,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22274 states and 32002 transitions. [2018-11-10 12:14:36,445 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 22272 [2018-11-10 12:14:36,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22274 states to 22274 states and 32002 transitions. [2018-11-10 12:14:36,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22274 [2018-11-10 12:14:36,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22274 [2018-11-10 12:14:36,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22274 states and 32002 transitions. [2018-11-10 12:14:36,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:36,518 INFO L705 BuchiCegarLoop]: Abstraction has 22274 states and 32002 transitions. [2018-11-10 12:14:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22274 states and 32002 transitions. [2018-11-10 12:14:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22274 to 22274. [2018-11-10 12:14:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22274 states. [2018-11-10 12:14:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22274 states to 22274 states and 32002 transitions. [2018-11-10 12:14:36,769 INFO L728 BuchiCegarLoop]: Abstraction has 22274 states and 32002 transitions. [2018-11-10 12:14:36,769 INFO L608 BuchiCegarLoop]: Abstraction has 22274 states and 32002 transitions. [2018-11-10 12:14:36,769 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:14:36,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22274 states and 32002 transitions. [2018-11-10 12:14:36,812 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 22272 [2018-11-10 12:14:36,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:36,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:36,813 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:36,813 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:36,813 INFO L793 eck$LassoCheckResult]: Stem: 67846#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 67819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 67820#L223-1 [2018-11-10 12:14:36,813 INFO L795 eck$LassoCheckResult]: Loop: 67820#L223-1 assume true; 68086#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 68084#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 68080#L91 assume !(main_~p1~0 != 0); 68078#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 68074#L95-1 assume !(main_~p3~0 != 0); 68070#L99-1 assume !(main_~p4~0 != 0); 68066#L103-1 assume !(main_~p5~0 != 0); 68062#L107-1 assume !(main_~p6~0 != 0); 68060#L111-1 assume !(main_~p7~0 != 0); 68058#L115-1 assume !(main_~p8~0 != 0); 68054#L119-1 assume !(main_~p9~0 != 0); 68050#L123-1 assume !(main_~p10~0 != 0); 68046#L127-1 assume !(main_~p11~0 != 0); 68044#L131-1 assume main_~p12~0 != 0;main_~lk12~0 := 1; 68042#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 68040#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 68038#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 68034#L147-1 assume !(main_~p1~0 != 0); 68032#L153-1 assume main_~p2~0 != 0; 68030#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 68026#L158 assume !(main_~p3~0 != 0); 68022#L163-1 assume !(main_~p4~0 != 0); 68018#L168-1 assume !(main_~p5~0 != 0); 68014#L173-1 assume !(main_~p6~0 != 0); 68012#L178-1 assume !(main_~p7~0 != 0); 68006#L183-1 assume !(main_~p8~0 != 0); 68005#L188-1 assume !(main_~p9~0 != 0); 68109#L193-1 assume !(main_~p10~0 != 0); 68105#L198-1 assume !(main_~p11~0 != 0); 68102#L203-1 assume !(main_~p12~0 != 0); 68098#L208-1 assume !(main_~p13~0 != 0); 68095#L213-1 assume main_~p14~0 != 0; 68093#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 68090#L218 assume !(main_~p15~0 != 0); 67820#L223-1 [2018-11-10 12:14:36,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-10 12:14:36,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:36,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1169460490, now seen corresponding path program 1 times [2018-11-10 12:14:36,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:36,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:36,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:36,844 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:36,844 INFO L87 Difference]: Start difference. First operand 22274 states and 32002 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2018-11-10 12:14:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:36,935 INFO L93 Difference]: Finished difference Result 44034 states and 62466 transitions. [2018-11-10 12:14:36,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:36,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44034 states and 62466 transitions. [2018-11-10 12:14:37,071 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 44032 [2018-11-10 12:14:37,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44034 states to 44034 states and 62466 transitions. [2018-11-10 12:14:37,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44034 [2018-11-10 12:14:37,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44034 [2018-11-10 12:14:37,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44034 states and 62466 transitions. [2018-11-10 12:14:37,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:37,212 INFO L705 BuchiCegarLoop]: Abstraction has 44034 states and 62466 transitions. [2018-11-10 12:14:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44034 states and 62466 transitions. [2018-11-10 12:14:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44034 to 44034. [2018-11-10 12:14:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44034 states. [2018-11-10 12:14:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44034 states to 44034 states and 62466 transitions. [2018-11-10 12:14:37,627 INFO L728 BuchiCegarLoop]: Abstraction has 44034 states and 62466 transitions. [2018-11-10 12:14:37,627 INFO L608 BuchiCegarLoop]: Abstraction has 44034 states and 62466 transitions. [2018-11-10 12:14:37,627 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:14:37,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44034 states and 62466 transitions. [2018-11-10 12:14:37,704 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 44032 [2018-11-10 12:14:37,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:37,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:37,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:37,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:37,705 INFO L793 eck$LassoCheckResult]: Stem: 134162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 134133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 134134#L223-1 [2018-11-10 12:14:37,705 INFO L795 eck$LassoCheckResult]: Loop: 134134#L223-1 assume true; 134892#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 134883#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 134879#L91 assume !(main_~p1~0 != 0); 134877#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 134874#L95-1 assume !(main_~p3~0 != 0); 134789#L99-1 assume !(main_~p4~0 != 0); 134790#L103-1 assume !(main_~p5~0 != 0); 134792#L107-1 assume !(main_~p6~0 != 0); 134929#L111-1 assume !(main_~p7~0 != 0); 134924#L115-1 assume !(main_~p8~0 != 0); 134921#L119-1 assume !(main_~p9~0 != 0); 134509#L123-1 assume !(main_~p10~0 != 0); 134503#L127-1 assume !(main_~p11~0 != 0); 134505#L131-1 assume !(main_~p12~0 != 0); 134765#L135-1 assume main_~p13~0 != 0;main_~lk13~0 := 1; 134763#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 134760#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 134713#L147-1 assume !(main_~p1~0 != 0); 134711#L153-1 assume main_~p2~0 != 0; 134709#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 134706#L158 assume !(main_~p3~0 != 0); 134694#L163-1 assume !(main_~p4~0 != 0); 134695#L168-1 assume !(main_~p5~0 != 0); 134837#L173-1 assume !(main_~p6~0 != 0); 134674#L178-1 assume !(main_~p7~0 != 0); 134676#L183-1 assume !(main_~p8~0 != 0); 134658#L188-1 assume !(main_~p9~0 != 0); 134660#L193-1 assume !(main_~p10~0 != 0); 134906#L198-1 assume !(main_~p11~0 != 0); 134904#L203-1 assume !(main_~p12~0 != 0); 134903#L208-1 assume !(main_~p13~0 != 0); 134901#L213-1 assume main_~p14~0 != 0; 134900#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 134899#L218 assume !(main_~p15~0 != 0); 134134#L223-1 [2018-11-10 12:14:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-10 12:14:37,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:37,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1592162316, now seen corresponding path program 1 times [2018-11-10 12:14:37,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:37,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:37,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:37,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:37,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:14:37,738 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:37,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:37,739 INFO L87 Difference]: Start difference. First operand 44034 states and 62466 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2018-11-10 12:14:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:37,900 INFO L93 Difference]: Finished difference Result 87042 states and 121858 transitions. [2018-11-10 12:14:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:37,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87042 states and 121858 transitions. [2018-11-10 12:14:38,276 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 87040 [2018-11-10 12:14:38,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87042 states to 87042 states and 121858 transitions. [2018-11-10 12:14:38,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87042 [2018-11-10 12:14:38,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87042 [2018-11-10 12:14:38,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87042 states and 121858 transitions. [2018-11-10 12:14:38,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:38,447 INFO L705 BuchiCegarLoop]: Abstraction has 87042 states and 121858 transitions. [2018-11-10 12:14:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87042 states and 121858 transitions. [2018-11-10 12:14:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87042 to 87042. [2018-11-10 12:14:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87042 states. [2018-11-10 12:14:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87042 states to 87042 states and 121858 transitions. [2018-11-10 12:14:39,188 INFO L728 BuchiCegarLoop]: Abstraction has 87042 states and 121858 transitions. [2018-11-10 12:14:39,188 INFO L608 BuchiCegarLoop]: Abstraction has 87042 states and 121858 transitions. [2018-11-10 12:14:39,188 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:14:39,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87042 states and 121858 transitions. [2018-11-10 12:14:39,343 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 87040 [2018-11-10 12:14:39,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:39,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:39,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:39,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:39,344 INFO L793 eck$LassoCheckResult]: Stem: 265239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 265214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 265215#L223-1 [2018-11-10 12:14:39,344 INFO L795 eck$LassoCheckResult]: Loop: 265215#L223-1 assume true; 265689#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 265687#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 265684#L91 assume !(main_~p1~0 != 0); 265680#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 265681#L95-1 assume !(main_~p3~0 != 0); 265780#L99-1 assume !(main_~p4~0 != 0); 265777#L103-1 assume !(main_~p5~0 != 0); 265774#L107-1 assume !(main_~p6~0 != 0); 265771#L111-1 assume !(main_~p7~0 != 0); 265768#L115-1 assume !(main_~p8~0 != 0); 265764#L119-1 assume !(main_~p9~0 != 0); 265760#L123-1 assume !(main_~p10~0 != 0); 265756#L127-1 assume !(main_~p11~0 != 0); 265752#L131-1 assume !(main_~p12~0 != 0); 265749#L135-1 assume !(main_~p13~0 != 0); 265747#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 265745#L143-1 assume main_~p15~0 != 0;main_~lk15~0 := 1; 265744#L147-1 assume !(main_~p1~0 != 0); 265743#L153-1 assume main_~p2~0 != 0; 265742#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 265740#L158 assume !(main_~p3~0 != 0); 265736#L163-1 assume !(main_~p4~0 != 0); 265732#L168-1 assume !(main_~p5~0 != 0); 265728#L173-1 assume !(main_~p6~0 != 0); 265724#L178-1 assume !(main_~p7~0 != 0); 265721#L183-1 assume !(main_~p8~0 != 0); 265716#L188-1 assume !(main_~p9~0 != 0); 265712#L193-1 assume !(main_~p10~0 != 0); 265708#L198-1 assume !(main_~p11~0 != 0); 265704#L203-1 assume !(main_~p12~0 != 0); 265700#L208-1 assume !(main_~p13~0 != 0); 265698#L213-1 assume main_~p14~0 != 0; 265696#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 265693#L218 assume !(main_~p15~0 != 0); 265215#L223-1 [2018-11-10 12:14:39,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2018-11-10 12:14:39,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:39,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:39,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 774513866, now seen corresponding path program 1 times [2018-11-10 12:14:39,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:39,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:14:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:14:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:14:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:14:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:14:39,366 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:14:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:14:39,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:14:39,367 INFO L87 Difference]: Start difference. First operand 87042 states and 121858 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2018-11-10 12:14:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:14:39,626 INFO L93 Difference]: Finished difference Result 172034 states and 237570 transitions. [2018-11-10 12:14:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:14:39,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172034 states and 237570 transitions. [2018-11-10 12:14:40,390 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 172032 [2018-11-10 12:14:40,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172034 states to 172034 states and 237570 transitions. [2018-11-10 12:14:40,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172034 [2018-11-10 12:14:40,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172034 [2018-11-10 12:14:40,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172034 states and 237570 transitions. [2018-11-10 12:14:40,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:14:40,678 INFO L705 BuchiCegarLoop]: Abstraction has 172034 states and 237570 transitions. [2018-11-10 12:14:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172034 states and 237570 transitions. [2018-11-10 12:14:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172034 to 172034. [2018-11-10 12:14:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172034 states. [2018-11-10 12:14:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172034 states to 172034 states and 237570 transitions. [2018-11-10 12:14:42,020 INFO L728 BuchiCegarLoop]: Abstraction has 172034 states and 237570 transitions. [2018-11-10 12:14:42,020 INFO L608 BuchiCegarLoop]: Abstraction has 172034 states and 237570 transitions. [2018-11-10 12:14:42,020 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:14:42,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172034 states and 237570 transitions. [2018-11-10 12:14:42,337 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 172032 [2018-11-10 12:14:42,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:14:42,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:14:42,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:14:42,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:14:42,339 INFO L793 eck$LassoCheckResult]: Stem: 524323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 524296#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 524297#L223-1 [2018-11-10 12:14:42,339 INFO L795 eck$LassoCheckResult]: Loop: 524297#L223-1 assume true; 525012#L54-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 525011#L56 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 525009#L91 assume !(main_~p1~0 != 0); 525008#L91-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 525005#L95-1 assume !(main_~p3~0 != 0); 525001#L99-1 assume !(main_~p4~0 != 0); 524997#L103-1 assume !(main_~p5~0 != 0); 524993#L107-1 assume !(main_~p6~0 != 0); 524989#L111-1 assume !(main_~p7~0 != 0); 524986#L115-1 assume !(main_~p8~0 != 0); 524983#L119-1 assume !(main_~p9~0 != 0); 524979#L123-1 assume !(main_~p10~0 != 0); 524975#L127-1 assume !(main_~p11~0 != 0); 524971#L131-1 assume !(main_~p12~0 != 0); 524967#L135-1 assume !(main_~p13~0 != 0); 524964#L139-1 assume main_~p14~0 != 0;main_~lk14~0 := 1; 524961#L143-1 assume !(main_~p15~0 != 0); 524962#L147-1 assume !(main_~p1~0 != 0); 525102#L153-1 assume main_~p2~0 != 0; 525100#L159 assume !(main_~lk2~0 != 1);main_~lk2~0 := 0; 525094#L158 assume !(main_~p3~0 != 0); 525088#L163-1 assume !(main_~p4~0 != 0); 525082#L168-1 assume !(main_~p5~0 != 0); 525076#L173-1 assume !(main_~p6~0 != 0); 525069#L178-1 assume !(main_~p7~0 != 0); 525064#L183-1 assume !(main_~p8~0 != 0); 525055#L188-1 assume !(main_~p9~0 != 0); 525047#L193-1 assume !(main_~p10~0 != 0); 525039#L198-1 assume !(main_~p11~0 != 0); 525031#L203-1 assume !(main_~p12~0 != 0); 525023#L208-1 assume !(main_~p13~0 != 0); 525019#L213-1 assume main_~p14~0 != 0; 525014#L219 assume !(main_~lk14~0 != 1);main_~lk14~0 := 0; 525013#L218 assume !(main_~p15~0 != 0); 524297#L223-1 [2018-11-10 12:14:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2018-11-10 12:14:42,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1219630840, now seen corresponding path program 1 times [2018-11-10 12:14:42,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:14:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1931493882, now seen corresponding path program 1 times [2018-11-10 12:14:42,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:14:42,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:14:42,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:14:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:14:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:14:42,497 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 12:14:42,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:14:42 BoogieIcfgContainer [2018-11-10 12:14:42,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:14:42,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:14:42,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:14:42,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:14:42,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:14:34" (3/4) ... [2018-11-10 12:14:42,630 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 12:14:42,670 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ca6a80a-4e56-4ee9-9d48-17174cf0647d/bin-2019/uautomizer/witness.graphml [2018-11-10 12:14:42,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:14:42,671 INFO L168 Benchmark]: Toolchain (without parser) took 8216.60 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 959.1 MB in the beginning and 469.2 MB in the end (delta: 489.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 12:14:42,672 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:14:42,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:14:42,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.24 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:14:42,672 INFO L168 Benchmark]: Boogie Preprocessor took 18.35 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:14:42,674 INFO L168 Benchmark]: RCFGBuilder took 296.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:14:42,674 INFO L168 Benchmark]: BuchiAutomizer took 7667.47 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 893.4 MB). Free memory was 1.1 GB in the beginning and 469.2 MB in the end (delta: 647.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 12:14:42,675 INFO L168 Benchmark]: Witness Printer took 44.84 ms. Allocated memory is still 2.1 GB. Free memory is still 469.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:14:42,676 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.24 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.35 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 296.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7667.47 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 893.4 MB). Free memory was 1.1 GB in the beginning and 469.2 MB in the end (delta: 647.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 44.84 ms. Allocated memory is still 2.1 GB. Free memory is still 469.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 172034 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 3.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.1s. Biggest automaton had 172034 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1409 SDtfs, 717 SDslu, 884 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 54]: 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=2, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b3f7989=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5506d642=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d399f45=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59978fd9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@396ce165=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d2cb371=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@751ecd3=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d2f746c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e33cad1=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23687e70=0, p14=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@664b1912=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45a595d5=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ef81d4d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2faa7e60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6755f7df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@417f634d=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND TRUE p2 != 0 [L96] lk2 = 1 [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND TRUE p14 != 0 [L144] lk14 = 1 [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND TRUE p2 != 0 [L159] COND FALSE !(lk2 != 1) [L160] lk2 = 0 [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND TRUE p14 != 0 [L219] COND FALSE !(lk14 != 1) [L220] lk14 = 0 [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...