./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/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 56f043bec3037ec37b4a132611abd4a337934428 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 15:12:24,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:12:24,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:12:24,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:12:24,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:12:24,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:12:24,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:12:24,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:12:24,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:12:24,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:12:24,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:12:24,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:12:24,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:12:24,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:12:24,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:12:24,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:12:24,827 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:12:24,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:12:24,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:12:24,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:12:24,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:12:24,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:12:24,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:12:24,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:12:24,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:12:24,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:12:24,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:12:24,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:12:24,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:12:24,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:12:24,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:12:24,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:12:24,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:12:24,839 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:12:24,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:12:24,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:12:24,841 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:12:24,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:12:24,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:12:24,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:12:24,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:12:24,868 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:12:24,868 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:12:24,868 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:12:24,868 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:12:24,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:12:24,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:12:24,870 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:12:24,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:12:24,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:12:24,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:12:24,871 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:12:24,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:12:24,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:12:24,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:12:24,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:12:24,875 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_e0357b0c-6792-463a-994f-b25a929a7335/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-18 15:12:24,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:12:24,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:12:24,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:12:24,915 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:12:24,915 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:12:24,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 15:12:24,967 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/data/cef9c9313/9b704c9fbe5449a1bdd98cfb7993db2e/FLAG6f52f6b5c [2018-11-18 15:12:25,329 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:12:25,330 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 15:12:25,337 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/data/cef9c9313/9b704c9fbe5449a1bdd98cfb7993db2e/FLAG6f52f6b5c [2018-11-18 15:12:25,727 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/data/cef9c9313/9b704c9fbe5449a1bdd98cfb7993db2e [2018-11-18 15:12:25,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:12:25,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:12:25,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:12:25,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:12:25,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:12:25,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd02f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25, skipping insertion in model container [2018-11-18 15:12:25,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:12:25,760 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:12:25,887 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:12:25,890 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:12:25,909 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:12:25,920 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:12:25,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25 WrapperNode [2018-11-18 15:12:25,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:12:25,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:12:25,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:12:25,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:12:25,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:12:25,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:12:25,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:12:25,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:12:25,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... [2018-11-18 15:12:25,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:12:25,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:12:25,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:12:25,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:12:25,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/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-18 15:12:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:12:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:12:26,322 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:12:26,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:26 BoogieIcfgContainer [2018-11-18 15:12:26,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:12:26,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:12:26,323 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:12:26,325 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:12:26,325 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:12:26,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:12:25" (1/3) ... [2018-11-18 15:12:26,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@390b096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:12:26, skipping insertion in model container [2018-11-18 15:12:26,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:12:26,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:12:25" (2/3) ... [2018-11-18 15:12:26,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@390b096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:12:26, skipping insertion in model container [2018-11-18 15:12:26,327 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:12:26,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:26" (3/3) ... [2018-11-18 15:12:26,328 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 15:12:26,371 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:12:26,371 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:12:26,371 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:12:26,372 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:12:26,372 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:12:26,372 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:12:26,372 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:12:26,372 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:12:26,372 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:12:26,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 15:12:26,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-18 15:12:26,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,403 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] [2018-11-18 15:12:26,403 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:12:26,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 15:12:26,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-18 15:12:26,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,406 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] [2018-11-18 15:12:26,411 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 15#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_~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_~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;havoc main_~cond~0; 31#L167-1true [2018-11-18 15:12:26,411 INFO L796 eck$LassoCheckResult]: Loop: 31#L167-1true assume true; 12#L42-1true assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 40#L44true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 7#L71true assume 0 != main_~p1~0;main_~lk1~0 := 1; 4#L71-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 37#L75-1true assume 0 != main_~p3~0;main_~lk3~0 := 1; 45#L79-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 33#L83-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 18#L87-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 3#L91-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L95-1true assume !(0 != main_~p8~0); 42#L99-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 32#L103-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 16#L107-1true assume 0 != main_~p11~0;main_~lk11~0 := 1; 25#L111-1true assume !(0 != main_~p1~0); 13#L117-1true assume !(0 != main_~p2~0); 26#L122-1true assume !(0 != main_~p3~0); 35#L127-1true assume !(0 != main_~p4~0); 43#L132-1true assume !(0 != main_~p5~0); 9#L137-1true assume !(0 != main_~p6~0); 23#L142-1true assume !(0 != main_~p7~0); 34#L147-1true assume !(0 != main_~p8~0); 41#L152-1true assume !(0 != main_~p9~0); 6#L157-1true assume !(0 != main_~p10~0); 20#L162-1true assume !(0 != main_~p11~0); 31#L167-1true [2018-11-18 15:12:26,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:12:26,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 880454670, now seen corresponding path program 1 times [2018-11-18 15:12:26,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:26,545 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-18 15:12:26,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:26,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:26,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:26,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:26,566 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-18 15:12:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:26,593 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2018-11-18 15:12:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:26,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 144 transitions. [2018-11-18 15:12:26,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-11-18 15:12:26,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 73 states and 115 transitions. [2018-11-18 15:12:26,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-18 15:12:26,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-18 15:12:26,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 115 transitions. [2018-11-18 15:12:26,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:26,604 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-18 15:12:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 115 transitions. [2018-11-18 15:12:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-18 15:12:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 15:12:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 115 transitions. [2018-11-18 15:12:26,628 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-18 15:12:26,628 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2018-11-18 15:12:26,629 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:12:26,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 115 transitions. [2018-11-18 15:12:26,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-11-18 15:12:26,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,630 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] [2018-11-18 15:12:26,630 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 159#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_~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_~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;havoc main_~cond~0; 149#L167-1 [2018-11-18 15:12:26,630 INFO L796 eck$LassoCheckResult]: Loop: 149#L167-1 assume true; 190#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 188#L71 assume !(0 != main_~p1~0); 187#L71-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 178#L75-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 179#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 184#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 163#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 135#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 136#L95-1 assume !(0 != main_~p8~0); 182#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 183#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 160#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 161#L111-1 assume !(0 != main_~p1~0); 154#L117-1 assume !(0 != main_~p2~0); 156#L122-1 assume !(0 != main_~p3~0); 168#L127-1 assume !(0 != main_~p4~0); 140#L132-1 assume !(0 != main_~p5~0); 145#L137-1 assume !(0 != main_~p6~0); 146#L142-1 assume !(0 != main_~p7~0); 158#L147-1 assume !(0 != main_~p8~0); 171#L152-1 assume !(0 != main_~p9~0); 192#L157-1 assume !(0 != main_~p10~0); 166#L162-1 assume !(0 != main_~p11~0); 149#L167-1 [2018-11-18 15:12:26,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 15:12:26,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1099309388, now seen corresponding path program 1 times [2018-11-18 15:12:26,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:26,677 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-18 15:12:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:26,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:26,678 INFO L87 Difference]: Start difference. First operand 73 states and 115 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-11-18 15:12:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:26,715 INFO L93 Difference]: Finished difference Result 142 states and 222 transitions. [2018-11-18 15:12:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:26,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 222 transitions. [2018-11-18 15:12:26,718 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2018-11-18 15:12:26,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 222 transitions. [2018-11-18 15:12:26,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2018-11-18 15:12:26,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-11-18 15:12:26,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 222 transitions. [2018-11-18 15:12:26,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:26,720 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-18 15:12:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 222 transitions. [2018-11-18 15:12:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-18 15:12:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 15:12:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2018-11-18 15:12:26,728 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-18 15:12:26,728 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2018-11-18 15:12:26,728 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:12:26,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 222 transitions. [2018-11-18 15:12:26,729 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2018-11-18 15:12:26,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,730 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] [2018-11-18 15:12:26,730 INFO L794 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 379#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_~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_~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;havoc main_~cond~0; 380#L167-1 [2018-11-18 15:12:26,730 INFO L796 eck$LassoCheckResult]: Loop: 380#L167-1 assume true; 416#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 414#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 411#L71 assume !(0 != main_~p1~0); 412#L71-2 assume !(0 != main_~p2~0); 467#L75-1 assume 0 != main_~p3~0;main_~lk3~0 := 1; 466#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 465#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 464#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 463#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 462#L95-1 assume !(0 != main_~p8~0); 461#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 460#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 459#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 457#L111-1 assume !(0 != main_~p1~0); 455#L117-1 assume !(0 != main_~p2~0); 453#L122-1 assume !(0 != main_~p3~0); 449#L127-1 assume !(0 != main_~p4~0); 445#L132-1 assume !(0 != main_~p5~0); 441#L137-1 assume !(0 != main_~p6~0); 437#L142-1 assume !(0 != main_~p7~0); 433#L147-1 assume !(0 != main_~p8~0); 429#L152-1 assume !(0 != main_~p9~0); 424#L157-1 assume !(0 != main_~p10~0); 421#L162-1 assume !(0 != main_~p11~0); 380#L167-1 [2018-11-18 15:12:26,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 15:12:26,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1522011214, now seen corresponding path program 1 times [2018-11-18 15:12:26,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:26,766 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-18 15:12:26,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:26,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:26,766 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:26,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:26,767 INFO L87 Difference]: Start difference. First operand 142 states and 222 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-18 15:12:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:26,800 INFO L93 Difference]: Finished difference Result 278 states and 430 transitions. [2018-11-18 15:12:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:26,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 430 transitions. [2018-11-18 15:12:26,802 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2018-11-18 15:12:26,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 278 states and 430 transitions. [2018-11-18 15:12:26,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2018-11-18 15:12:26,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2018-11-18 15:12:26,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 430 transitions. [2018-11-18 15:12:26,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:26,805 INFO L705 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-18 15:12:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 430 transitions. [2018-11-18 15:12:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-11-18 15:12:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-18 15:12:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 430 transitions. [2018-11-18 15:12:26,817 INFO L728 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-18 15:12:26,817 INFO L608 BuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2018-11-18 15:12:26,817 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:12:26,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 430 transitions. [2018-11-18 15:12:26,819 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2018-11-18 15:12:26,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,820 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] [2018-11-18 15:12:26,820 INFO L794 eck$LassoCheckResult]: Stem: 827#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 804#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_~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_~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;havoc main_~cond~0; 805#L167-1 [2018-11-18 15:12:26,820 INFO L796 eck$LassoCheckResult]: Loop: 805#L167-1 assume true; 847#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 839#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 840#L71 assume !(0 != main_~p1~0); 948#L71-2 assume !(0 != main_~p2~0); 944#L75-1 assume !(0 != main_~p3~0); 940#L79-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 936#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 932#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 928#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 924#L95-1 assume !(0 != main_~p8~0); 920#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 916#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 912#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 908#L111-1 assume !(0 != main_~p1~0); 904#L117-1 assume !(0 != main_~p2~0); 901#L122-1 assume !(0 != main_~p3~0); 902#L127-1 assume !(0 != main_~p4~0); 882#L132-1 assume !(0 != main_~p5~0); 881#L137-1 assume !(0 != main_~p6~0); 870#L142-1 assume !(0 != main_~p7~0); 869#L147-1 assume !(0 != main_~p8~0); 964#L152-1 assume !(0 != main_~p9~0); 855#L157-1 assume !(0 != main_~p10~0); 852#L162-1 assume !(0 != main_~p11~0); 805#L167-1 [2018-11-18 15:12:26,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 15:12:26,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 704362764, now seen corresponding path program 1 times [2018-11-18 15:12:26,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:26,863 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-18 15:12:26,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:26,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:26,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:26,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:26,864 INFO L87 Difference]: Start difference. First operand 278 states and 430 transitions. cyclomatic complexity: 160 Second operand 3 states. [2018-11-18 15:12:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:26,887 INFO L93 Difference]: Finished difference Result 546 states and 834 transitions. [2018-11-18 15:12:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:26,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 834 transitions. [2018-11-18 15:12:26,892 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2018-11-18 15:12:26,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 546 states and 834 transitions. [2018-11-18 15:12:26,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2018-11-18 15:12:26,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2018-11-18 15:12:26,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 834 transitions. [2018-11-18 15:12:26,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:26,899 INFO L705 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-18 15:12:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 834 transitions. [2018-11-18 15:12:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-11-18 15:12:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-18 15:12:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 834 transitions. [2018-11-18 15:12:26,919 INFO L728 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-18 15:12:26,919 INFO L608 BuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2018-11-18 15:12:26,919 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:12:26,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 546 states and 834 transitions. [2018-11-18 15:12:26,921 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2018-11-18 15:12:26,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:26,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:26,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:26,922 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] [2018-11-18 15:12:26,922 INFO L794 eck$LassoCheckResult]: Stem: 1659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1635#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_~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_~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;havoc main_~cond~0; 1636#L167-1 [2018-11-18 15:12:26,922 INFO L796 eck$LassoCheckResult]: Loop: 1636#L167-1 assume true; 1819#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 1817#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 1814#L71 assume !(0 != main_~p1~0); 1815#L71-2 assume !(0 != main_~p2~0); 1799#L75-1 assume !(0 != main_~p3~0); 1801#L79-1 assume !(0 != main_~p4~0); 1783#L83-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1784#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1767#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1768#L95-1 assume !(0 != main_~p8~0); 1751#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1752#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1735#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 1736#L111-1 assume !(0 != main_~p1~0); 1853#L117-1 assume !(0 != main_~p2~0); 1851#L122-1 assume !(0 != main_~p3~0); 1847#L127-1 assume !(0 != main_~p4~0); 1844#L132-1 assume !(0 != main_~p5~0); 1840#L137-1 assume !(0 != main_~p6~0); 1836#L142-1 assume !(0 != main_~p7~0); 1834#L147-1 assume !(0 != main_~p8~0); 1832#L152-1 assume !(0 != main_~p9~0); 1827#L157-1 assume !(0 != main_~p10~0); 1824#L162-1 assume !(0 != main_~p11~0); 1636#L167-1 [2018-11-18 15:12:26,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 15:12:26,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:26,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash -984580978, now seen corresponding path program 1 times [2018-11-18 15:12:26,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:26,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:26,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:26,957 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-18 15:12:26,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:26,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:26,958 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:26,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:26,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:26,958 INFO L87 Difference]: Start difference. First operand 546 states and 834 transitions. cyclomatic complexity: 304 Second operand 3 states. [2018-11-18 15:12:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:26,982 INFO L93 Difference]: Finished difference Result 1074 states and 1618 transitions. [2018-11-18 15:12:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:26,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 1618 transitions. [2018-11-18 15:12:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2018-11-18 15:12:27,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 1074 states and 1618 transitions. [2018-11-18 15:12:27,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1074 [2018-11-18 15:12:27,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1074 [2018-11-18 15:12:27,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 1618 transitions. [2018-11-18 15:12:27,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:27,005 INFO L705 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-18 15:12:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 1618 transitions. [2018-11-18 15:12:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2018-11-18 15:12:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-11-18 15:12:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1618 transitions. [2018-11-18 15:12:27,029 INFO L728 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-18 15:12:27,029 INFO L608 BuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2018-11-18 15:12:27,029 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:12:27,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1074 states and 1618 transitions. [2018-11-18 15:12:27,033 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2018-11-18 15:12:27,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:27,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:27,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:27,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:12:27,034 INFO L794 eck$LassoCheckResult]: Stem: 3282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3260#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_~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_~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;havoc main_~cond~0; 3261#L167-1 [2018-11-18 15:12:27,034 INFO L796 eck$LassoCheckResult]: Loop: 3261#L167-1 assume true; 3632#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 3633#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 3682#L71 assume !(0 != main_~p1~0); 3679#L71-2 assume !(0 != main_~p2~0); 3678#L75-1 assume !(0 != main_~p3~0); 3675#L79-1 assume !(0 != main_~p4~0); 3676#L83-1 assume !(0 != main_~p5~0); 3674#L87-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 3671#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3520#L95-1 assume !(0 != main_~p8~0); 3521#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3512#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3509#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 3505#L111-1 assume !(0 != main_~p1~0); 3500#L117-1 assume !(0 != main_~p2~0); 3498#L122-1 assume !(0 != main_~p3~0); 3499#L127-1 assume !(0 != main_~p4~0); 3653#L132-1 assume !(0 != main_~p5~0); 3655#L137-1 assume !(0 != main_~p6~0); 3649#L142-1 assume !(0 != main_~p7~0); 3648#L147-1 assume !(0 != main_~p8~0); 3643#L152-1 assume !(0 != main_~p9~0); 3642#L157-1 assume !(0 != main_~p10~0); 3637#L162-1 assume !(0 != main_~p11~0); 3261#L167-1 [2018-11-18 15:12:27,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 15:12:27,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1316241612, now seen corresponding path program 1 times [2018-11-18 15:12:27,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:27,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:27,074 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-18 15:12:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:27,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:27,075 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:27,075 INFO L87 Difference]: Start difference. First operand 1074 states and 1618 transitions. cyclomatic complexity: 576 Second operand 3 states. [2018-11-18 15:12:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:27,136 INFO L93 Difference]: Finished difference Result 2114 states and 3138 transitions. [2018-11-18 15:12:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:27,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2114 states and 3138 transitions. [2018-11-18 15:12:27,155 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2018-11-18 15:12:27,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2114 states to 2114 states and 3138 transitions. [2018-11-18 15:12:27,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2018-11-18 15:12:27,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2018-11-18 15:12:27,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 3138 transitions. [2018-11-18 15:12:27,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:27,168 INFO L705 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-18 15:12:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 3138 transitions. [2018-11-18 15:12:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2018-11-18 15:12:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-11-18 15:12:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3138 transitions. [2018-11-18 15:12:27,203 INFO L728 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-18 15:12:27,204 INFO L608 BuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2018-11-18 15:12:27,204 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:12:27,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 3138 transitions. [2018-11-18 15:12:27,213 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2018-11-18 15:12:27,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:27,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:27,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:27,214 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] [2018-11-18 15:12:27,214 INFO L794 eck$LassoCheckResult]: Stem: 6484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6454#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_~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_~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;havoc main_~cond~0; 6455#L167-1 [2018-11-18 15:12:27,214 INFO L796 eck$LassoCheckResult]: Loop: 6455#L167-1 assume true; 6865#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 6863#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 6859#L71 assume !(0 != main_~p1~0); 6850#L71-2 assume !(0 != main_~p2~0); 6852#L75-1 assume !(0 != main_~p3~0); 6855#L79-1 assume !(0 != main_~p4~0); 6847#L83-1 assume !(0 != main_~p5~0); 6849#L87-1 assume !(0 != main_~p6~0); 6690#L91-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 6691#L95-1 assume !(0 != main_~p8~0); 6682#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6683#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6900#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 6897#L111-1 assume !(0 != main_~p1~0); 6896#L117-1 assume !(0 != main_~p2~0); 6853#L122-1 assume !(0 != main_~p3~0); 6854#L127-1 assume !(0 != main_~p4~0); 6892#L132-1 assume !(0 != main_~p5~0); 6888#L137-1 assume !(0 != main_~p6~0); 6885#L142-1 assume !(0 != main_~p7~0); 6881#L147-1 assume !(0 != main_~p8~0); 6877#L152-1 assume !(0 != main_~p9~0); 6872#L157-1 assume !(0 != main_~p10~0); 6869#L162-1 assume !(0 != main_~p11~0); 6455#L167-1 [2018-11-18 15:12:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 15:12:27,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash -272106290, now seen corresponding path program 1 times [2018-11-18 15:12:27,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:27,262 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-18 15:12:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:27,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:27,263 INFO L87 Difference]: Start difference. First operand 2114 states and 3138 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2018-11-18 15:12:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:27,344 INFO L93 Difference]: Finished difference Result 4162 states and 6082 transitions. [2018-11-18 15:12:27,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:27,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4162 states and 6082 transitions. [2018-11-18 15:12:27,371 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2018-11-18 15:12:27,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4162 states to 4162 states and 6082 transitions. [2018-11-18 15:12:27,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4162 [2018-11-18 15:12:27,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4162 [2018-11-18 15:12:27,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4162 states and 6082 transitions. [2018-11-18 15:12:27,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:27,399 INFO L705 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-18 15:12:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states and 6082 transitions. [2018-11-18 15:12:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4162. [2018-11-18 15:12:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2018-11-18 15:12:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 6082 transitions. [2018-11-18 15:12:27,473 INFO L728 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-18 15:12:27,473 INFO L608 BuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2018-11-18 15:12:27,473 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:12:27,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4162 states and 6082 transitions. [2018-11-18 15:12:27,493 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2018-11-18 15:12:27,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:27,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:27,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:27,494 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] [2018-11-18 15:12:27,494 INFO L794 eck$LassoCheckResult]: Stem: 12764#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12736#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_~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_~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;havoc main_~cond~0; 12737#L167-1 [2018-11-18 15:12:27,494 INFO L796 eck$LassoCheckResult]: Loop: 12737#L167-1 assume true; 12940#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 12938#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 12935#L71 assume !(0 != main_~p1~0); 12936#L71-2 assume !(0 != main_~p2~0); 12915#L75-1 assume !(0 != main_~p3~0); 12917#L79-1 assume !(0 != main_~p4~0); 12895#L83-1 assume !(0 != main_~p5~0); 12897#L87-1 assume !(0 != main_~p6~0); 12871#L91-1 assume !(0 != main_~p7~0); 12873#L95-1 assume !(0 != main_~p8~0); 12855#L99-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12856#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12840#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 12841#L111-1 assume !(0 != main_~p1~0); 12974#L117-1 assume !(0 != main_~p2~0); 12972#L122-1 assume !(0 != main_~p3~0); 12970#L127-1 assume !(0 != main_~p4~0); 12968#L132-1 assume !(0 != main_~p5~0); 12966#L137-1 assume !(0 != main_~p6~0); 12962#L142-1 assume !(0 != main_~p7~0); 12959#L147-1 assume !(0 != main_~p8~0); 12955#L152-1 assume !(0 != main_~p9~0); 12948#L157-1 assume !(0 != main_~p10~0); 12945#L162-1 assume !(0 != main_~p11~0); 12737#L167-1 [2018-11-18 15:12:27,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-18 15:12:27,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1293174644, now seen corresponding path program 1 times [2018-11-18 15:12:27,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:27,533 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-18 15:12:27,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:27,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:27,533 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:27,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:27,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:27,534 INFO L87 Difference]: Start difference. First operand 4162 states and 6082 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2018-11-18 15:12:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:27,598 INFO L93 Difference]: Finished difference Result 8194 states and 11778 transitions. [2018-11-18 15:12:27,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:27,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8194 states and 11778 transitions. [2018-11-18 15:12:27,631 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2018-11-18 15:12:27,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8194 states to 8194 states and 11778 transitions. [2018-11-18 15:12:27,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8194 [2018-11-18 15:12:27,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8194 [2018-11-18 15:12:27,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8194 states and 11778 transitions. [2018-11-18 15:12:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:27,676 INFO L705 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-18 15:12:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states and 11778 transitions. [2018-11-18 15:12:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8194. [2018-11-18 15:12:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8194 states. [2018-11-18 15:12:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 11778 transitions. [2018-11-18 15:12:27,798 INFO L728 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-18 15:12:27,798 INFO L608 BuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2018-11-18 15:12:27,798 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:12:27,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8194 states and 11778 transitions. [2018-11-18 15:12:27,821 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2018-11-18 15:12:27,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:27,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:27,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:27,822 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] [2018-11-18 15:12:27,822 INFO L794 eck$LassoCheckResult]: Stem: 25124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25098#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_~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_~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;havoc main_~cond~0; 25099#L167-1 [2018-11-18 15:12:27,822 INFO L796 eck$LassoCheckResult]: Loop: 25099#L167-1 assume true; 25477#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 25476#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 25474#L71 assume !(0 != main_~p1~0); 25472#L71-2 assume !(0 != main_~p2~0); 25470#L75-1 assume !(0 != main_~p3~0); 25468#L79-1 assume !(0 != main_~p4~0); 25466#L83-1 assume !(0 != main_~p5~0); 25464#L87-1 assume !(0 != main_~p6~0); 25462#L91-1 assume !(0 != main_~p7~0); 25463#L95-1 assume !(0 != main_~p8~0); 25450#L99-1 assume !(0 != main_~p9~0); 25452#L103-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 25420#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 25421#L111-1 assume !(0 != main_~p1~0); 25400#L117-1 assume !(0 != main_~p2~0); 25402#L122-1 assume !(0 != main_~p3~0); 25379#L127-1 assume !(0 != main_~p4~0); 25381#L132-1 assume !(0 != main_~p5~0); 25357#L137-1 assume !(0 != main_~p6~0); 25358#L142-1 assume !(0 != main_~p7~0); 25485#L147-1 assume !(0 != main_~p8~0); 25482#L152-1 assume !(0 != main_~p9~0); 25480#L157-1 assume !(0 != main_~p10~0); 25479#L162-1 assume !(0 != main_~p11~0); 25099#L167-1 [2018-11-18 15:12:27,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-18 15:12:27,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:27,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1990675402, now seen corresponding path program 1 times [2018-11-18 15:12:27,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:27,866 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-18 15:12:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:12:27,867 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:27,867 INFO L87 Difference]: Start difference. First operand 8194 states and 11778 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2018-11-18 15:12:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:27,956 INFO L93 Difference]: Finished difference Result 16130 states and 22786 transitions. [2018-11-18 15:12:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:27,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16130 states and 22786 transitions. [2018-11-18 15:12:28,059 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2018-11-18 15:12:28,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16130 states to 16130 states and 22786 transitions. [2018-11-18 15:12:28,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16130 [2018-11-18 15:12:28,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16130 [2018-11-18 15:12:28,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16130 states and 22786 transitions. [2018-11-18 15:12:28,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:28,120 INFO L705 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-18 15:12:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16130 states and 22786 transitions. [2018-11-18 15:12:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16130 to 16130. [2018-11-18 15:12:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16130 states. [2018-11-18 15:12:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16130 states to 16130 states and 22786 transitions. [2018-11-18 15:12:28,308 INFO L728 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-18 15:12:28,308 INFO L608 BuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2018-11-18 15:12:28,308 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:12:28,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16130 states and 22786 transitions. [2018-11-18 15:12:28,353 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2018-11-18 15:12:28,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:28,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:28,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:28,360 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] [2018-11-18 15:12:28,360 INFO L794 eck$LassoCheckResult]: Stem: 49454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49426#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_~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_~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;havoc main_~cond~0; 49427#L167-1 [2018-11-18 15:12:28,360 INFO L796 eck$LassoCheckResult]: Loop: 49427#L167-1 assume true; 49847#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 49840#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 49841#L71 assume !(0 != main_~p1~0); 49829#L71-2 assume !(0 != main_~p2~0); 49831#L75-1 assume !(0 != main_~p3~0); 49772#L79-1 assume !(0 != main_~p4~0); 49773#L83-1 assume !(0 != main_~p5~0); 49862#L87-1 assume !(0 != main_~p6~0); 49858#L91-1 assume !(0 != main_~p7~0); 49855#L95-1 assume !(0 != main_~p8~0); 49850#L99-1 assume !(0 != main_~p9~0); 49845#L103-1 assume !(0 != main_~p10~0); 49842#L107-1 assume 0 != main_~p11~0;main_~lk11~0 := 1; 49838#L111-1 assume !(0 != main_~p1~0); 49839#L117-1 assume !(0 != main_~p2~0); 50679#L122-1 assume !(0 != main_~p3~0); 49659#L127-1 assume !(0 != main_~p4~0); 49660#L132-1 assume !(0 != main_~p5~0); 49807#L137-1 assume !(0 != main_~p6~0); 49624#L142-1 assume !(0 != main_~p7~0); 49626#L147-1 assume !(0 != main_~p8~0); 49795#L152-1 assume !(0 != main_~p9~0); 49873#L157-1 assume !(0 != main_~p10~0); 49870#L162-1 assume !(0 != main_~p11~0); 49427#L167-1 [2018-11-18 15:12:28,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-18 15:12:28,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:28,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:28,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:28,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1403869388, now seen corresponding path program 1 times [2018-11-18 15:12:28,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:28,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:28,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:12:28,469 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-18 15:12:28,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:12:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:12:28,469 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:12:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:12:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:12:28,470 INFO L87 Difference]: Start difference. First operand 16130 states and 22786 transitions. cyclomatic complexity: 7168 Second operand 3 states. [2018-11-18 15:12:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:12:28,605 INFO L93 Difference]: Finished difference Result 31746 states and 44034 transitions. [2018-11-18 15:12:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:12:28,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31746 states and 44034 transitions. [2018-11-18 15:12:28,720 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2018-11-18 15:12:28,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31746 states to 31746 states and 44034 transitions. [2018-11-18 15:12:28,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31746 [2018-11-18 15:12:28,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31746 [2018-11-18 15:12:28,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31746 states and 44034 transitions. [2018-11-18 15:12:28,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:12:28,846 INFO L705 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-18 15:12:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31746 states and 44034 transitions. [2018-11-18 15:12:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31746 to 31746. [2018-11-18 15:12:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31746 states. [2018-11-18 15:12:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31746 states to 31746 states and 44034 transitions. [2018-11-18 15:12:29,315 INFO L728 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-18 15:12:29,315 INFO L608 BuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2018-11-18 15:12:29,315 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:12:29,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31746 states and 44034 transitions. [2018-11-18 15:12:29,366 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2018-11-18 15:12:29,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:12:29,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:12:29,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:12:29,367 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] [2018-11-18 15:12:29,367 INFO L794 eck$LassoCheckResult]: Stem: 97336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97309#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_~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_~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;havoc main_~cond~0; 97310#L167-1 [2018-11-18 15:12:29,367 INFO L796 eck$LassoCheckResult]: Loop: 97310#L167-1 assume true; 97615#L42-1 assume !false;main_~cond~0 := main_#t~nondet11;havoc main_#t~nondet11; 97614#L44 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0; 97612#L71 assume !(0 != main_~p1~0); 97610#L71-2 assume !(0 != main_~p2~0); 97608#L75-1 assume !(0 != main_~p3~0); 97606#L79-1 assume !(0 != main_~p4~0); 97604#L83-1 assume !(0 != main_~p5~0); 97602#L87-1 assume !(0 != main_~p6~0); 97600#L91-1 assume !(0 != main_~p7~0); 97599#L95-1 assume !(0 != main_~p8~0); 97597#L99-1 assume !(0 != main_~p9~0); 97595#L103-1 assume !(0 != main_~p10~0); 97593#L107-1 assume !(0 != main_~p11~0); 97594#L111-1 assume !(0 != main_~p1~0); 97568#L117-1 assume !(0 != main_~p2~0); 97570#L122-1 assume !(0 != main_~p3~0); 97544#L127-1 assume !(0 != main_~p4~0); 97546#L132-1 assume !(0 != main_~p5~0); 97518#L137-1 assume !(0 != main_~p6~0); 97519#L142-1 assume !(0 != main_~p7~0); 97500#L147-1 assume !(0 != main_~p8~0); 97499#L152-1 assume !(0 != main_~p9~0); 97447#L157-1 assume !(0 != main_~p10~0); 97448#L162-1 assume !(0 != main_~p11~0); 97310#L167-1 [2018-11-18 15:12:29,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-18 15:12:29,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1662034826, now seen corresponding path program 1 times [2018-11-18 15:12:29,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:29,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:12:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:12:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1438318088, now seen corresponding path program 1 times [2018-11-18 15:12:29,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:12:29,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:12:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:12:29,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:12:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:12:29,595 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 15:12:29,718 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-18 15:12:29,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:12:29 BoogieIcfgContainer [2018-11-18 15:12:29,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:12:29,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:12:29,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:12:29,807 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:12:29,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:12:26" (3/4) ... [2018-11-18 15:12:29,810 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 15:12:29,849 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e0357b0c-6792-463a-994f-b25a929a7335/bin-2019/uautomizer/witness.graphml [2018-11-18 15:12:29,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:12:29,850 INFO L168 Benchmark]: Toolchain (without parser) took 4119.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 962.4 MB in the beginning and 1.2 GB in the end (delta: -192.7 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:12:29,851 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:12:29,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.05 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:12:29,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:12:29,851 INFO L168 Benchmark]: Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:12:29,852 INFO L168 Benchmark]: RCFGBuilder took 353.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:12:29,852 INFO L168 Benchmark]: BuchiAutomizer took 3484.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -20.9 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:12:29,852 INFO L168 Benchmark]: Witness Printer took 42.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:12:29,854 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.05 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.10 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3484.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -20.9 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * Witness Printer took 42.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 31746 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 31746 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 901 SDtfs, 465 SDslu, 554 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI10 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: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28fabf20=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e77f994=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@785c1058=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f039a90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b6bb003=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10a43623=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b6857f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d5a98a8=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b9e61d9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ee143b0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e92eec7=0, p11=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a5c7da5=0, lk11=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: 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; [L40] int cond; Loop: [L42] COND TRUE 1 [L43] cond = __VERIFIER_nondet_int() [L44] COND FALSE !(cond == 0) [L47] lk1 = 0 [L49] lk2 = 0 [L51] lk3 = 0 [L53] lk4 = 0 [L55] lk5 = 0 [L57] lk6 = 0 [L59] lk7 = 0 [L61] lk8 = 0 [L63] lk9 = 0 [L65] lk10 = 0 [L67] lk11 = 0 [L71] COND FALSE !(p1 != 0) [L75] COND FALSE !(p2 != 0) [L79] COND FALSE !(p3 != 0) [L83] COND FALSE !(p4 != 0) [L87] COND FALSE !(p5 != 0) [L91] COND FALSE !(p6 != 0) [L95] COND FALSE !(p7 != 0) [L99] COND FALSE !(p8 != 0) [L103] COND FALSE !(p9 != 0) [L107] COND FALSE !(p10 != 0) [L111] COND FALSE !(p11 != 0) [L117] COND FALSE !(p1 != 0) [L122] COND FALSE !(p2 != 0) [L127] COND FALSE !(p3 != 0) [L132] COND FALSE !(p4 != 0) [L137] COND FALSE !(p5 != 0) [L142] COND FALSE !(p6 != 0) [L147] COND FALSE !(p7 != 0) [L152] COND FALSE !(p8 != 0) [L157] COND FALSE !(p9 != 0) [L162] COND FALSE !(p10 != 0) [L167] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...