./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/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 129b0578c0c64625cef50fbcfd5d128651ff3275 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-11-15 21:42:32,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:42:32,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:42:32,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:42:32,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:42:32,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:42:32,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:42:32,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:42:32,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:42:32,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:42:32,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:42:32,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:42:32,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:42:32,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:42:32,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:42:32,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:42:32,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:42:32,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:42:32,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:42:32,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:42:32,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:42:32,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:42:32,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:42:32,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:42:32,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:42:32,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:42:32,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:42:32,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:42:32,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:42:32,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:42:32,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:42:32,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:42:32,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:42:32,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:42:32,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:42:32,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:42:32,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:42:32,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:42:32,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:42:32,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:42:32,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:42:32,871 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:42:32,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:42:32,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:42:32,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:42:32,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:42:32,909 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:42:32,909 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:42:32,909 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:42:32,909 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:42:32,910 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:42:32,910 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:42:32,911 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:42:32,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:42:32,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:42:32,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:42:32,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:42:32,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:42:32,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:42:32,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:42:32,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:42:32,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:42:32,913 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:42:32,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:42:32,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:42:32,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:42:32,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:42:32,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:42:32,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:42:32,915 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:42:32,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:42:32,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:42:32,915 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:42:32,918 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:42:32,918 INFO L138 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/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2019-11-15 21:42:32,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:42:32,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:42:32,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:42:32,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:42:32,971 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:42:32,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_15-2.c [2019-11-15 21:42:33,033 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/data/0bbe398e2/8cb205b3449841d98ef417a7d8d7fe5d/FLAGfe45fcc49 [2019-11-15 21:42:33,461 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:42:33,461 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/sv-benchmarks/c/locks/test_locks_15-2.c [2019-11-15 21:42:33,470 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/data/0bbe398e2/8cb205b3449841d98ef417a7d8d7fe5d/FLAGfe45fcc49 [2019-11-15 21:42:33,871 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/data/0bbe398e2/8cb205b3449841d98ef417a7d8d7fe5d [2019-11-15 21:42:33,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:42:33,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:42:33,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:42:33,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:42:33,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:42:33,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:33" (1/1) ... [2019-11-15 21:42:33,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7184e1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:33, skipping insertion in model container [2019-11-15 21:42:33,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:33" (1/1) ... [2019-11-15 21:42:33,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:42:33,918 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:42:34,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:42:34,133 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:42:34,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:42:34,171 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:42:34,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34 WrapperNode [2019-11-15 21:42:34,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:42:34,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:42:34,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:42:34,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:42:34,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:42:34,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:42:34,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:42:34,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:42:34,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... [2019-11-15 21:42:34,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:42:34,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:42:34,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:42:34,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:42:34,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/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 [2019-11-15 21:42:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:42:34,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:42:34,790 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:42:34,790 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:42:34,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:34 BoogieIcfgContainer [2019-11-15 21:42:34,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:42:34,792 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:42:34,792 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:42:34,796 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:42:34,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:42:34,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:42:33" (1/3) ... [2019-11-15 21:42:34,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a556618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:42:34, skipping insertion in model container [2019-11-15 21:42:34,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:42:34,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:34" (2/3) ... [2019-11-15 21:42:34,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a556618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:42:34, skipping insertion in model container [2019-11-15 21:42:34,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:42:34,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:34" (3/3) ... [2019-11-15 21:42:34,802 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2019-11-15 21:42:34,861 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:42:34,861 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:42:34,861 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:42:34,863 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:42:34,863 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:42:34,863 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:42:34,863 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:42:34,864 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:42:34,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-15 21:42:34,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 21:42:34,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:34,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:34,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:34,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:34,926 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:42:34,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-15 21:42:34,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-15 21:42:34,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:34,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:34,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:34,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:34,945 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2019-11-15 21:42:34,947 INFO L793 eck$LassoCheckResult]: Loop: 9#L223-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 41#L56true 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L91-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L95-1true assume !(0 != main_~p3~0); 30#L99-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 21#L103-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 38#L107-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 43#L111-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 35#L115-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 51#L119-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 44#L123-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 48#L127-1true assume !(0 != main_~p11~0); 14#L131-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 6#L135-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 27#L139-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 32#L143-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 23#L147-1true assume !(0 != main_~p1~0); 15#L153-1true assume !(0 != main_~p2~0); 24#L158-1true assume !(0 != main_~p3~0); 53#L163-1true assume !(0 != main_~p4~0); 7#L168-1true assume !(0 != main_~p5~0); 40#L173-1true assume !(0 != main_~p6~0); 46#L178-1true assume !(0 != main_~p7~0); 29#L183-1true assume !(0 != main_~p8~0); 33#L188-1true assume !(0 != main_~p9~0); 11#L193-1true assume !(0 != main_~p10~0); 20#L198-1true assume !(0 != main_~p11~0); 50#L203-1true assume !(0 != main_~p12~0); 3#L208-1true assume !(0 != main_~p13~0); 26#L213-1true assume !(0 != main_~p14~0); 55#L218-1true assume !(0 != main_~p15~0); 9#L223-1true [2019-11-15 21:42:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:42:34,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:34,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309493036] [2019-11-15 21:42:34,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:34,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:34,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1871293818, now seen corresponding path program 1 times [2019-11-15 21:42:35,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130823513] [2019-11-15 21:42:35,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130823513] [2019-11-15 21:42:35,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270797632] [2019-11-15 21:42:35,218 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,235 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-11-15 21:42:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,270 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2019-11-15 21:42:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 189 transitions. [2019-11-15 21:42:35,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-15 21:42:35,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 94 states and 152 transitions. [2019-11-15 21:42:35,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-15 21:42:35,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-15 21:42:35,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 152 transitions. [2019-11-15 21:42:35,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:35,287 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2019-11-15 21:42:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 152 transitions. [2019-11-15 21:42:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-15 21:42:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:42:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 152 transitions. [2019-11-15 21:42:35,320 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2019-11-15 21:42:35,321 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2019-11-15 21:42:35,321 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:42:35,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 152 transitions. [2019-11-15 21:42:35,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-15 21:42:35,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:35,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:35,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:35,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:35,331 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 187#L223-1 [2019-11-15 21:42:35,332 INFO L793 eck$LassoCheckResult]: Loop: 187#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 188#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 220#L91 assume !(0 != main_~p1~0); 221#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 240#L95-1 assume !(0 != main_~p3~0); 239#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 238#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 237#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 235#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 232#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 217#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 206#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 207#L127-1 assume !(0 != main_~p11~0); 197#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 176#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 177#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 215#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 218#L147-1 assume !(0 != main_~p1~0); 222#L153-1 assume !(0 != main_~p2~0); 258#L158-1 assume !(0 != main_~p3~0); 256#L163-1 assume !(0 != main_~p4~0); 254#L168-1 assume !(0 != main_~p5~0); 252#L173-1 assume !(0 != main_~p6~0); 250#L178-1 assume !(0 != main_~p7~0); 247#L183-1 assume !(0 != main_~p8~0); 246#L188-1 assume !(0 != main_~p9~0); 244#L193-1 assume !(0 != main_~p10~0); 241#L198-1 assume !(0 != main_~p11~0); 214#L203-1 assume !(0 != main_~p12~0); 166#L208-1 assume !(0 != main_~p13~0); 168#L213-1 assume !(0 != main_~p14~0); 173#L218-1 assume !(0 != main_~p15~0); 187#L223-1 [2019-11-15 21:42:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 21:42:35,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881559302] [2019-11-15 21:42:35,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,351 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1848661564, now seen corresponding path program 1 times [2019-11-15 21:42:35,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190894508] [2019-11-15 21:42:35,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190894508] [2019-11-15 21:42:35,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801647854] [2019-11-15 21:42:35,389 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,390 INFO L87 Difference]: Start difference. First operand 94 states and 152 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-11-15 21:42:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,417 INFO L93 Difference]: Finished difference Result 185 states and 297 transitions. [2019-11-15 21:42:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 297 transitions. [2019-11-15 21:42:35,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-15 21:42:35,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 185 states and 297 transitions. [2019-11-15 21:42:35,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2019-11-15 21:42:35,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2019-11-15 21:42:35,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 297 transitions. [2019-11-15 21:42:35,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:35,431 INFO L688 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2019-11-15 21:42:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 297 transitions. [2019-11-15 21:42:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-15 21:42:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 21:42:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 297 transitions. [2019-11-15 21:42:35,445 INFO L711 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2019-11-15 21:42:35,445 INFO L591 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2019-11-15 21:42:35,445 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:42:35,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 297 transitions. [2019-11-15 21:42:35,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-15 21:42:35,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:35,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:35,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:35,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:35,450 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 513#L223-1 [2019-11-15 21:42:35,450 INFO L793 eck$LassoCheckResult]: Loop: 513#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 550#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 551#L91 assume !(0 != main_~p1~0); 573#L91-2 assume !(0 != main_~p2~0); 474#L95-1 assume !(0 != main_~p3~0); 475#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 541#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 542#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 537#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 538#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 514#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 495#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 496#L127-1 assume !(0 != main_~p11~0); 482#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 483#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 509#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 510#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 519#L147-1 assume !(0 != main_~p1~0); 520#L153-1 assume !(0 != main_~p2~0); 553#L158-1 assume !(0 != main_~p3~0); 614#L163-1 assume !(0 != main_~p4~0); 612#L168-1 assume !(0 != main_~p5~0); 606#L173-1 assume !(0 != main_~p6~0); 602#L178-1 assume !(0 != main_~p7~0); 597#L183-1 assume !(0 != main_~p8~0); 594#L188-1 assume !(0 != main_~p9~0); 590#L193-1 assume !(0 != main_~p10~0); 571#L198-1 assume !(0 != main_~p11~0); 570#L203-1 assume !(0 != main_~p12~0); 568#L208-1 assume !(0 != main_~p13~0); 567#L213-1 assume !(0 != main_~p14~0); 562#L218-1 assume !(0 != main_~p15~0); 513#L223-1 [2019-11-15 21:42:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 21:42:35,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768818187] [2019-11-15 21:42:35,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,462 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -462458170, now seen corresponding path program 1 times [2019-11-15 21:42:35,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040518001] [2019-11-15 21:42:35,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040518001] [2019-11-15 21:42:35,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673834079] [2019-11-15 21:42:35,515 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,516 INFO L87 Difference]: Start difference. First operand 185 states and 297 transitions. cyclomatic complexity: 116 Second operand 3 states. [2019-11-15 21:42:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,555 INFO L93 Difference]: Finished difference Result 365 states and 581 transitions. [2019-11-15 21:42:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 581 transitions. [2019-11-15 21:42:35,562 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-15 21:42:35,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 581 transitions. [2019-11-15 21:42:35,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-11-15 21:42:35,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2019-11-15 21:42:35,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 581 transitions. [2019-11-15 21:42:35,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:35,585 INFO L688 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2019-11-15 21:42:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 581 transitions. [2019-11-15 21:42:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-15 21:42:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-15 21:42:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 581 transitions. [2019-11-15 21:42:35,614 INFO L711 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2019-11-15 21:42:35,614 INFO L591 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2019-11-15 21:42:35,614 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:42:35,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 581 transitions. [2019-11-15 21:42:35,617 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-15 21:42:35,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:35,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:35,618 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:35,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:35,619 INFO L791 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1061#L223-1 [2019-11-15 21:42:35,619 INFO L793 eck$LassoCheckResult]: Loop: 1061#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1135#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1130#L91 assume !(0 != main_~p1~0); 1122#L91-2 assume !(0 != main_~p2~0); 1118#L95-1 assume !(0 != main_~p3~0); 1111#L99-1 assume !(0 != main_~p4~0); 1112#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1252#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1251#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1250#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1249#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1248#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1247#L127-1 assume !(0 != main_~p11~0); 1246#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1243#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1242#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1074#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1075#L147-1 assume !(0 != main_~p1~0); 1203#L153-1 assume !(0 != main_~p2~0); 1204#L158-1 assume !(0 != main_~p3~0); 1261#L163-1 assume !(0 != main_~p4~0); 1258#L168-1 assume !(0 != main_~p5~0); 1256#L173-1 assume !(0 != main_~p6~0); 1216#L178-1 assume !(0 != main_~p7~0); 1205#L183-1 assume !(0 != main_~p8~0); 1174#L188-1 assume !(0 != main_~p9~0); 1172#L193-1 assume !(0 != main_~p10~0); 1165#L198-1 assume !(0 != main_~p11~0); 1160#L203-1 assume !(0 != main_~p12~0); 1152#L208-1 assume !(0 != main_~p13~0); 1150#L213-1 assume !(0 != main_~p14~0); 1148#L218-1 assume !(0 != main_~p15~0); 1061#L223-1 [2019-11-15 21:42:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-15 21:42:35,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621147465] [2019-11-15 21:42:35,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1460769864, now seen corresponding path program 1 times [2019-11-15 21:42:35,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268087965] [2019-11-15 21:42:35,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268087965] [2019-11-15 21:42:35,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562052313] [2019-11-15 21:42:35,661 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,662 INFO L87 Difference]: Start difference. First operand 365 states and 581 transitions. cyclomatic complexity: 224 Second operand 3 states. [2019-11-15 21:42:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,680 INFO L93 Difference]: Finished difference Result 721 states and 1137 transitions. [2019-11-15 21:42:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1137 transitions. [2019-11-15 21:42:35,691 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-15 21:42:35,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1137 transitions. [2019-11-15 21:42:35,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2019-11-15 21:42:35,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2019-11-15 21:42:35,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1137 transitions. [2019-11-15 21:42:35,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:35,701 INFO L688 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2019-11-15 21:42:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1137 transitions. [2019-11-15 21:42:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-11-15 21:42:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-15 21:42:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1137 transitions. [2019-11-15 21:42:35,722 INFO L711 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2019-11-15 21:42:35,723 INFO L591 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2019-11-15 21:42:35,723 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:42:35,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 1137 transitions. [2019-11-15 21:42:35,728 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-15 21:42:35,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:35,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:35,729 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:35,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:35,730 INFO L791 eck$LassoCheckResult]: Stem: 2150#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2151#L223-1 [2019-11-15 21:42:35,730 INFO L793 eck$LassoCheckResult]: Loop: 2151#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2200#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2419#L91 assume !(0 != main_~p1~0); 2415#L91-2 assume !(0 != main_~p2~0); 2413#L95-1 assume !(0 != main_~p3~0); 2412#L99-1 assume !(0 != main_~p4~0); 2409#L103-1 assume !(0 != main_~p5~0); 2407#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2405#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2403#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2401#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2399#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2397#L127-1 assume !(0 != main_~p11~0); 2395#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2393#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2391#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2389#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2387#L147-1 assume !(0 != main_~p1~0); 2352#L153-1 assume !(0 != main_~p2~0); 2349#L158-1 assume !(0 != main_~p3~0); 2341#L163-1 assume !(0 != main_~p4~0); 2333#L168-1 assume !(0 != main_~p5~0); 2331#L173-1 assume !(0 != main_~p6~0); 2286#L178-1 assume !(0 != main_~p7~0); 2280#L183-1 assume !(0 != main_~p8~0); 2270#L188-1 assume !(0 != main_~p9~0); 2269#L193-1 assume !(0 != main_~p10~0); 2260#L198-1 assume !(0 != main_~p11~0); 2261#L203-1 assume !(0 != main_~p12~0); 2426#L208-1 assume !(0 != main_~p13~0); 2215#L213-1 assume !(0 != main_~p14~0); 2214#L218-1 assume !(0 != main_~p15~0); 2151#L223-1 [2019-11-15 21:42:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-15 21:42:35,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174644459] [2019-11-15 21:42:35,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1522809478, now seen corresponding path program 1 times [2019-11-15 21:42:35,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490499293] [2019-11-15 21:42:35,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490499293] [2019-11-15 21:42:35,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349191386] [2019-11-15 21:42:35,787 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,788 INFO L87 Difference]: Start difference. First operand 721 states and 1137 transitions. cyclomatic complexity: 432 Second operand 3 states. [2019-11-15 21:42:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,811 INFO L93 Difference]: Finished difference Result 1425 states and 2225 transitions. [2019-11-15 21:42:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1425 states and 2225 transitions. [2019-11-15 21:42:35,825 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-15 21:42:35,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1425 states to 1425 states and 2225 transitions. [2019-11-15 21:42:35,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1425 [2019-11-15 21:42:35,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1425 [2019-11-15 21:42:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 2225 transitions. [2019-11-15 21:42:35,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:35,842 INFO L688 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2019-11-15 21:42:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 2225 transitions. [2019-11-15 21:42:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2019-11-15 21:42:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-11-15 21:42:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2225 transitions. [2019-11-15 21:42:35,873 INFO L711 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2019-11-15 21:42:35,873 INFO L591 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2019-11-15 21:42:35,873 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:42:35,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 2225 transitions. [2019-11-15 21:42:35,882 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-15 21:42:35,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:35,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:35,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:35,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:35,883 INFO L791 eck$LassoCheckResult]: Stem: 4308#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4309#L223-1 [2019-11-15 21:42:35,883 INFO L793 eck$LassoCheckResult]: Loop: 4309#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4372#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4373#L91 assume !(0 != main_~p1~0); 4568#L91-2 assume !(0 != main_~p2~0); 4567#L95-1 assume !(0 != main_~p3~0); 4565#L99-1 assume !(0 != main_~p4~0); 4561#L103-1 assume !(0 != main_~p5~0); 4557#L107-1 assume !(0 != main_~p6~0); 4555#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4553#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4551#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4549#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4547#L127-1 assume !(0 != main_~p11~0); 4545#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4543#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4541#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4539#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4536#L147-1 assume !(0 != main_~p1~0); 4537#L153-1 assume !(0 != main_~p2~0); 4531#L158-1 assume !(0 != main_~p3~0); 4530#L163-1 assume !(0 != main_~p4~0); 4477#L168-1 assume !(0 != main_~p5~0); 4479#L173-1 assume !(0 != main_~p6~0); 4473#L178-1 assume !(0 != main_~p7~0); 4472#L183-1 assume !(0 != main_~p8~0); 4467#L188-1 assume !(0 != main_~p9~0); 4466#L193-1 assume !(0 != main_~p10~0); 4459#L198-1 assume !(0 != main_~p11~0); 4460#L203-1 assume !(0 != main_~p12~0); 4454#L208-1 assume !(0 != main_~p13~0); 4453#L213-1 assume !(0 != main_~p14~0); 4382#L218-1 assume !(0 != main_~p15~0); 4309#L223-1 [2019-11-15 21:42:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-15 21:42:35,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721493881] [2019-11-15 21:42:35,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:35,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1663358088, now seen corresponding path program 1 times [2019-11-15 21:42:35,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:35,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237876499] [2019-11-15 21:42:35,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:35,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:35,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237876499] [2019-11-15 21:42:35,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:35,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:35,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870269480] [2019-11-15 21:42:35,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:35,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:35,938 INFO L87 Difference]: Start difference. First operand 1425 states and 2225 transitions. cyclomatic complexity: 832 Second operand 3 states. [2019-11-15 21:42:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:35,968 INFO L93 Difference]: Finished difference Result 2817 states and 4353 transitions. [2019-11-15 21:42:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:35,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2817 states and 4353 transitions. [2019-11-15 21:42:35,995 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-15 21:42:36,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2817 states to 2817 states and 4353 transitions. [2019-11-15 21:42:36,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2817 [2019-11-15 21:42:36,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2817 [2019-11-15 21:42:36,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2817 states and 4353 transitions. [2019-11-15 21:42:36,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:36,024 INFO L688 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2019-11-15 21:42:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states and 4353 transitions. [2019-11-15 21:42:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-11-15 21:42:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-11-15 21:42:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4353 transitions. [2019-11-15 21:42:36,081 INFO L711 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2019-11-15 21:42:36,082 INFO L591 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2019-11-15 21:42:36,082 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:42:36,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2817 states and 4353 transitions. [2019-11-15 21:42:36,100 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-15 21:42:36,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:36,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:36,101 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:36,101 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:36,101 INFO L791 eck$LassoCheckResult]: Stem: 8559#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8560#L223-1 [2019-11-15 21:42:36,101 INFO L793 eck$LassoCheckResult]: Loop: 8560#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8643#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8641#L91 assume !(0 != main_~p1~0); 8637#L91-2 assume !(0 != main_~p2~0); 8635#L95-1 assume !(0 != main_~p3~0); 8631#L99-1 assume !(0 != main_~p4~0); 8627#L103-1 assume !(0 != main_~p5~0); 8623#L107-1 assume !(0 != main_~p6~0); 8619#L111-1 assume !(0 != main_~p7~0); 8617#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8615#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8613#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8611#L127-1 assume !(0 != main_~p11~0); 8609#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8607#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8605#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8603#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8600#L147-1 assume !(0 != main_~p1~0); 8601#L153-1 assume !(0 != main_~p2~0); 8695#L158-1 assume !(0 != main_~p3~0); 8690#L163-1 assume !(0 != main_~p4~0); 8686#L168-1 assume !(0 != main_~p5~0); 8682#L173-1 assume !(0 != main_~p6~0); 8678#L178-1 assume !(0 != main_~p7~0); 8674#L183-1 assume !(0 != main_~p8~0); 8671#L188-1 assume !(0 != main_~p9~0); 8667#L193-1 assume !(0 != main_~p10~0); 8662#L198-1 assume !(0 != main_~p11~0); 8659#L203-1 assume !(0 != main_~p12~0); 8655#L208-1 assume !(0 != main_~p13~0); 8651#L213-1 assume !(0 != main_~p14~0); 8647#L218-1 assume !(0 != main_~p15~0); 8560#L223-1 [2019-11-15 21:42:36,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:36,102 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-15 21:42:36,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:36,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140772110] [2019-11-15 21:42:36,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:36,110 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1529344582, now seen corresponding path program 1 times [2019-11-15 21:42:36,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:36,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561727544] [2019-11-15 21:42:36,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:36,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561727544] [2019-11-15 21:42:36,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:36,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:36,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568514226] [2019-11-15 21:42:36,138 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:36,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:36,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:36,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:36,138 INFO L87 Difference]: Start difference. First operand 2817 states and 4353 transitions. cyclomatic complexity: 1600 Second operand 3 states. [2019-11-15 21:42:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:36,184 INFO L93 Difference]: Finished difference Result 5569 states and 8513 transitions. [2019-11-15 21:42:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:36,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5569 states and 8513 transitions. [2019-11-15 21:42:36,228 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-15 21:42:36,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5569 states to 5569 states and 8513 transitions. [2019-11-15 21:42:36,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5569 [2019-11-15 21:42:36,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5569 [2019-11-15 21:42:36,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5569 states and 8513 transitions. [2019-11-15 21:42:36,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:36,287 INFO L688 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2019-11-15 21:42:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states and 8513 transitions. [2019-11-15 21:42:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5569. [2019-11-15 21:42:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-11-15 21:42:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8513 transitions. [2019-11-15 21:42:36,415 INFO L711 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2019-11-15 21:42:36,415 INFO L591 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2019-11-15 21:42:36,415 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:42:36,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5569 states and 8513 transitions. [2019-11-15 21:42:36,441 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-15 21:42:36,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:36,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:36,443 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:36,443 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:36,444 INFO L791 eck$LassoCheckResult]: Stem: 16945#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 16946#L223-1 [2019-11-15 21:42:36,444 INFO L793 eck$LassoCheckResult]: Loop: 16946#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17062#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17058#L91 assume !(0 != main_~p1~0); 17051#L91-2 assume !(0 != main_~p2~0); 17046#L95-1 assume !(0 != main_~p3~0); 17039#L99-1 assume !(0 != main_~p4~0); 17031#L103-1 assume !(0 != main_~p5~0); 17023#L107-1 assume !(0 != main_~p6~0); 17015#L111-1 assume !(0 != main_~p7~0); 17009#L115-1 assume !(0 != main_~p8~0); 17004#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 17005#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16998#L127-1 assume !(0 != main_~p11~0); 16999#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16992#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16993#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16984#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 16985#L147-1 assume !(0 != main_~p1~0); 17141#L153-1 assume !(0 != main_~p2~0); 17133#L158-1 assume !(0 != main_~p3~0); 17112#L163-1 assume !(0 != main_~p4~0); 17108#L168-1 assume !(0 != main_~p5~0); 17106#L173-1 assume !(0 != main_~p6~0); 17104#L178-1 assume !(0 != main_~p7~0); 17102#L183-1 assume !(0 != main_~p8~0); 17101#L188-1 assume !(0 != main_~p9~0); 17099#L193-1 assume !(0 != main_~p10~0); 17096#L198-1 assume !(0 != main_~p11~0); 17095#L203-1 assume !(0 != main_~p12~0); 17093#L208-1 assume !(0 != main_~p13~0); 17089#L213-1 assume !(0 != main_~p14~0); 17071#L218-1 assume !(0 != main_~p15~0); 16946#L223-1 [2019-11-15 21:42:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-15 21:42:36,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:36,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995408876] [2019-11-15 21:42:36,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:36,457 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash -276093752, now seen corresponding path program 1 times [2019-11-15 21:42:36,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:36,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009098794] [2019-11-15 21:42:36,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:36,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009098794] [2019-11-15 21:42:36,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:36,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:36,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299295426] [2019-11-15 21:42:36,479 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:36,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:36,480 INFO L87 Difference]: Start difference. First operand 5569 states and 8513 transitions. cyclomatic complexity: 3072 Second operand 3 states. [2019-11-15 21:42:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:36,552 INFO L93 Difference]: Finished difference Result 11009 states and 16641 transitions. [2019-11-15 21:42:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:36,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11009 states and 16641 transitions. [2019-11-15 21:42:36,612 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-15 21:42:36,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11009 states to 11009 states and 16641 transitions. [2019-11-15 21:42:36,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11009 [2019-11-15 21:42:36,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11009 [2019-11-15 21:42:36,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11009 states and 16641 transitions. [2019-11-15 21:42:36,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:36,703 INFO L688 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2019-11-15 21:42:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states and 16641 transitions. [2019-11-15 21:42:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11009. [2019-11-15 21:42:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11009 states. [2019-11-15 21:42:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11009 states to 11009 states and 16641 transitions. [2019-11-15 21:42:36,988 INFO L711 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2019-11-15 21:42:36,988 INFO L591 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2019-11-15 21:42:36,988 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:42:36,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11009 states and 16641 transitions. [2019-11-15 21:42:37,027 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-15 21:42:37,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:37,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:37,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:37,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:37,028 INFO L791 eck$LassoCheckResult]: Stem: 33534#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 33535#L223-1 [2019-11-15 21:42:37,028 INFO L793 eck$LassoCheckResult]: Loop: 33535#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 33895#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33893#L91 assume !(0 != main_~p1~0); 33890#L91-2 assume !(0 != main_~p2~0); 33888#L95-1 assume !(0 != main_~p3~0); 33884#L99-1 assume !(0 != main_~p4~0); 33880#L103-1 assume !(0 != main_~p5~0); 33877#L107-1 assume !(0 != main_~p6~0); 33878#L111-1 assume !(0 != main_~p7~0); 33857#L115-1 assume !(0 != main_~p8~0); 33859#L119-1 assume !(0 != main_~p9~0); 33841#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 33842#L127-1 assume !(0 != main_~p11~0); 33827#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33828#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33811#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33812#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33798#L147-1 assume !(0 != main_~p1~0); 33799#L153-1 assume !(0 != main_~p2~0); 33710#L158-1 assume !(0 != main_~p3~0); 33709#L163-1 assume !(0 != main_~p4~0); 33696#L168-1 assume !(0 != main_~p5~0); 33698#L173-1 assume !(0 != main_~p6~0); 33918#L178-1 assume !(0 != main_~p7~0); 33916#L183-1 assume !(0 != main_~p8~0); 33914#L188-1 assume !(0 != main_~p9~0); 33912#L193-1 assume !(0 != main_~p10~0); 33908#L198-1 assume !(0 != main_~p11~0); 33906#L203-1 assume !(0 != main_~p12~0); 33903#L208-1 assume !(0 != main_~p13~0); 33900#L213-1 assume !(0 != main_~p14~0); 33897#L218-1 assume !(0 != main_~p15~0); 33535#L223-1 [2019-11-15 21:42:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-15 21:42:37,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:37,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848355623] [2019-11-15 21:42:37,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:37,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash -57239034, now seen corresponding path program 1 times [2019-11-15 21:42:37,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:37,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161375291] [2019-11-15 21:42:37,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:37,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161375291] [2019-11-15 21:42:37,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:37,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:37,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465128614] [2019-11-15 21:42:37,055 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:37,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:37,055 INFO L87 Difference]: Start difference. First operand 11009 states and 16641 transitions. cyclomatic complexity: 5888 Second operand 3 states. [2019-11-15 21:42:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:37,120 INFO L93 Difference]: Finished difference Result 21761 states and 32513 transitions. [2019-11-15 21:42:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:37,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21761 states and 32513 transitions. [2019-11-15 21:42:37,215 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-15 21:42:37,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21761 states to 21761 states and 32513 transitions. [2019-11-15 21:42:37,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21761 [2019-11-15 21:42:37,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21761 [2019-11-15 21:42:37,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21761 states and 32513 transitions. [2019-11-15 21:42:37,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:37,319 INFO L688 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2019-11-15 21:42:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21761 states and 32513 transitions. [2019-11-15 21:42:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21761 to 21761. [2019-11-15 21:42:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2019-11-15 21:42:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 32513 transitions. [2019-11-15 21:42:37,649 INFO L711 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2019-11-15 21:42:37,649 INFO L591 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2019-11-15 21:42:37,649 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:42:37,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21761 states and 32513 transitions. [2019-11-15 21:42:37,714 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-15 21:42:37,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:37,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:37,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:37,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:37,716 INFO L791 eck$LassoCheckResult]: Stem: 66307#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 66308#L223-1 [2019-11-15 21:42:37,716 INFO L793 eck$LassoCheckResult]: Loop: 66308#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 67709#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 67710#L91 assume !(0 != main_~p1~0); 67665#L91-2 assume !(0 != main_~p2~0); 67667#L95-1 assume !(0 != main_~p3~0); 67645#L99-1 assume !(0 != main_~p4~0); 67647#L103-1 assume !(0 != main_~p5~0); 67621#L107-1 assume !(0 != main_~p6~0); 67623#L111-1 assume !(0 != main_~p7~0); 67870#L115-1 assume !(0 != main_~p8~0); 67867#L119-1 assume !(0 != main_~p9~0); 67864#L123-1 assume !(0 != main_~p10~0); 67862#L127-1 assume !(0 != main_~p11~0); 67858#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 67854#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 67850#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 67845#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 67838#L147-1 assume !(0 != main_~p1~0); 67830#L153-1 assume !(0 != main_~p2~0); 67821#L158-1 assume !(0 != main_~p3~0); 67812#L163-1 assume !(0 != main_~p4~0); 67806#L168-1 assume !(0 != main_~p5~0); 67776#L173-1 assume !(0 != main_~p6~0); 67778#L178-1 assume !(0 != main_~p7~0); 67745#L183-1 assume !(0 != main_~p8~0); 67746#L188-1 assume !(0 != main_~p9~0); 67796#L193-1 assume !(0 != main_~p10~0); 67781#L198-1 assume !(0 != main_~p11~0); 67782#L203-1 assume !(0 != main_~p12~0); 67741#L208-1 assume !(0 != main_~p13~0); 67740#L213-1 assume !(0 != main_~p14~0); 67724#L218-1 assume !(0 != main_~p15~0); 66308#L223-1 [2019-11-15 21:42:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-15 21:42:37,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:37,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008096277] [2019-11-15 21:42:37,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:37,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash 365462792, now seen corresponding path program 1 times [2019-11-15 21:42:37,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:37,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339385667] [2019-11-15 21:42:37,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:37,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:37,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339385667] [2019-11-15 21:42:37,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:37,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:37,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490578442] [2019-11-15 21:42:37,740 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:37,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:37,741 INFO L87 Difference]: Start difference. First operand 21761 states and 32513 transitions. cyclomatic complexity: 11264 Second operand 3 states. [2019-11-15 21:42:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:37,852 INFO L93 Difference]: Finished difference Result 43009 states and 63489 transitions. [2019-11-15 21:42:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:37,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43009 states and 63489 transitions. [2019-11-15 21:42:38,060 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-15 21:42:38,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43009 states to 43009 states and 63489 transitions. [2019-11-15 21:42:38,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43009 [2019-11-15 21:42:38,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43009 [2019-11-15 21:42:38,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43009 states and 63489 transitions. [2019-11-15 21:42:38,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:38,281 INFO L688 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2019-11-15 21:42:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43009 states and 63489 transitions. [2019-11-15 21:42:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43009 to 43009. [2019-11-15 21:42:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-11-15 21:42:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 63489 transitions. [2019-11-15 21:42:39,025 INFO L711 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2019-11-15 21:42:39,025 INFO L591 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2019-11-15 21:42:39,025 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:42:39,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43009 states and 63489 transitions. [2019-11-15 21:42:39,138 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-15 21:42:39,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:39,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:39,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:39,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:39,139 INFO L791 eck$LassoCheckResult]: Stem: 131089#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 131090#L223-1 [2019-11-15 21:42:39,139 INFO L793 eck$LassoCheckResult]: Loop: 131090#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 131728#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131722#L91 assume !(0 != main_~p1~0); 131714#L91-2 assume !(0 != main_~p2~0); 131708#L95-1 assume !(0 != main_~p3~0); 131702#L99-1 assume !(0 != main_~p4~0); 131694#L103-1 assume !(0 != main_~p5~0); 131687#L107-1 assume !(0 != main_~p6~0); 131681#L111-1 assume !(0 != main_~p7~0); 131683#L115-1 assume !(0 != main_~p8~0); 131856#L119-1 assume !(0 != main_~p9~0); 131849#L123-1 assume !(0 != main_~p10~0); 131843#L127-1 assume !(0 != main_~p11~0); 131835#L131-1 assume !(0 != main_~p12~0); 131828#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 131821#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131816#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131812#L147-1 assume !(0 != main_~p1~0); 131804#L153-1 assume !(0 != main_~p2~0); 131800#L158-1 assume !(0 != main_~p3~0); 131794#L163-1 assume !(0 != main_~p4~0); 131783#L168-1 assume !(0 != main_~p5~0); 131775#L173-1 assume !(0 != main_~p6~0); 131765#L178-1 assume !(0 != main_~p7~0); 131759#L183-1 assume !(0 != main_~p8~0); 131753#L188-1 assume !(0 != main_~p9~0); 131751#L193-1 assume !(0 != main_~p10~0); 131749#L198-1 assume !(0 != main_~p11~0); 131747#L203-1 assume !(0 != main_~p12~0); 131744#L208-1 assume !(0 != main_~p13~0); 131742#L213-1 assume !(0 != main_~p14~0); 131738#L218-1 assume !(0 != main_~p15~0); 131090#L223-1 [2019-11-15 21:42:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-15 21:42:39,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:39,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181048820] [2019-11-15 21:42:39,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:39,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:39,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1323480950, now seen corresponding path program 1 times [2019-11-15 21:42:39,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:39,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304673647] [2019-11-15 21:42:39,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:39,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:39,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:39,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304673647] [2019-11-15 21:42:39,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:39,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:39,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787906075] [2019-11-15 21:42:39,198 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:39,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:39,198 INFO L87 Difference]: Start difference. First operand 43009 states and 63489 transitions. cyclomatic complexity: 21504 Second operand 3 states. [2019-11-15 21:42:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:39,367 INFO L93 Difference]: Finished difference Result 84993 states and 123905 transitions. [2019-11-15 21:42:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:39,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84993 states and 123905 transitions. [2019-11-15 21:42:39,980 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-15 21:42:40,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84993 states to 84993 states and 123905 transitions. [2019-11-15 21:42:40,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84993 [2019-11-15 21:42:40,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84993 [2019-11-15 21:42:40,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84993 states and 123905 transitions. [2019-11-15 21:42:40,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:40,344 INFO L688 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2019-11-15 21:42:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84993 states and 123905 transitions. [2019-11-15 21:42:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84993 to 84993. [2019-11-15 21:42:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84993 states. [2019-11-15 21:42:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84993 states to 84993 states and 123905 transitions. [2019-11-15 21:42:41,484 INFO L711 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2019-11-15 21:42:41,484 INFO L591 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2019-11-15 21:42:41,484 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:42:41,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84993 states and 123905 transitions. [2019-11-15 21:42:41,653 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-15 21:42:41,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:41,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:41,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:41,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:41,655 INFO L791 eck$LassoCheckResult]: Stem: 259099#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 259100#L223-1 [2019-11-15 21:42:41,655 INFO L793 eck$LassoCheckResult]: Loop: 259100#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 260022#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 260019#L91 assume !(0 != main_~p1~0); 260015#L91-2 assume !(0 != main_~p2~0); 260012#L95-1 assume !(0 != main_~p3~0); 260009#L99-1 assume !(0 != main_~p4~0); 260005#L103-1 assume !(0 != main_~p5~0); 260001#L107-1 assume !(0 != main_~p6~0); 259997#L111-1 assume !(0 != main_~p7~0); 259993#L115-1 assume !(0 != main_~p8~0); 259989#L119-1 assume !(0 != main_~p9~0); 259986#L123-1 assume !(0 != main_~p10~0); 259938#L127-1 assume !(0 != main_~p11~0); 259939#L131-1 assume !(0 != main_~p12~0); 260100#L135-1 assume !(0 != main_~p13~0); 260099#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260096#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 260093#L147-1 assume !(0 != main_~p1~0); 260082#L153-1 assume !(0 != main_~p2~0); 260078#L158-1 assume !(0 != main_~p3~0); 260072#L163-1 assume !(0 != main_~p4~0); 260067#L168-1 assume !(0 != main_~p5~0); 260061#L173-1 assume !(0 != main_~p6~0); 260055#L178-1 assume !(0 != main_~p7~0); 260049#L183-1 assume !(0 != main_~p8~0); 260045#L188-1 assume !(0 != main_~p9~0); 260044#L193-1 assume !(0 != main_~p10~0); 260040#L198-1 assume !(0 != main_~p11~0); 260036#L203-1 assume !(0 != main_~p12~0); 260034#L208-1 assume !(0 != main_~p13~0); 260031#L213-1 assume !(0 != main_~p14~0); 260027#L218-1 assume !(0 != main_~p15~0); 259100#L223-1 [2019-11-15 21:42:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-15 21:42:41,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:41,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889846613] [2019-11-15 21:42:41,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:41,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:41,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:41,661 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash 977341640, now seen corresponding path program 1 times [2019-11-15 21:42:41,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:41,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933952961] [2019-11-15 21:42:41,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:41,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:41,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:41,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933952961] [2019-11-15 21:42:41,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:41,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:42:41,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631037913] [2019-11-15 21:42:41,688 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:41,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:41,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:41,688 INFO L87 Difference]: Start difference. First operand 84993 states and 123905 transitions. cyclomatic complexity: 40960 Second operand 3 states. [2019-11-15 21:42:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:42,049 INFO L93 Difference]: Finished difference Result 167937 states and 241665 transitions. [2019-11-15 21:42:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:42,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167937 states and 241665 transitions. [2019-11-15 21:42:42,567 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2019-11-15 21:42:43,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167937 states to 167937 states and 241665 transitions. [2019-11-15 21:42:43,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167937 [2019-11-15 21:42:43,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167937 [2019-11-15 21:42:43,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167937 states and 241665 transitions. [2019-11-15 21:42:43,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:43,169 INFO L688 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2019-11-15 21:42:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167937 states and 241665 transitions. [2019-11-15 21:42:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167937 to 167937. [2019-11-15 21:42:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167937 states. [2019-11-15 21:42:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167937 states to 167937 states and 241665 transitions. [2019-11-15 21:42:51,562 INFO L711 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2019-11-15 21:42:51,563 INFO L591 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2019-11-15 21:42:51,563 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 21:42:51,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167937 states and 241665 transitions. [2019-11-15 21:42:51,848 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2019-11-15 21:42:51,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:42:51,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:42:51,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:42:51,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:42:51,850 INFO L791 eck$LassoCheckResult]: Stem: 512034#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 512035#L223-1 [2019-11-15 21:42:51,851 INFO L793 eck$LassoCheckResult]: Loop: 512035#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 512210#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 512206#L91 assume !(0 != main_~p1~0); 512199#L91-2 assume !(0 != main_~p2~0); 512194#L95-1 assume !(0 != main_~p3~0); 512187#L99-1 assume !(0 != main_~p4~0); 512179#L103-1 assume !(0 != main_~p5~0); 512171#L107-1 assume !(0 != main_~p6~0); 512163#L111-1 assume !(0 != main_~p7~0); 512155#L115-1 assume !(0 != main_~p8~0); 512147#L119-1 assume !(0 != main_~p9~0); 512139#L123-1 assume !(0 != main_~p10~0); 512134#L127-1 assume !(0 != main_~p11~0); 512127#L131-1 assume !(0 != main_~p12~0); 512119#L135-1 assume !(0 != main_~p13~0); 512113#L139-1 assume !(0 != main_~p14~0); 512107#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 512108#L147-1 assume !(0 != main_~p1~0); 512287#L153-1 assume !(0 != main_~p2~0); 512318#L158-1 assume !(0 != main_~p3~0); 512313#L163-1 assume !(0 != main_~p4~0); 512309#L168-1 assume !(0 != main_~p5~0); 512305#L173-1 assume !(0 != main_~p6~0); 512301#L178-1 assume !(0 != main_~p7~0); 512297#L183-1 assume !(0 != main_~p8~0); 512293#L188-1 assume !(0 != main_~p9~0); 512289#L193-1 assume !(0 != main_~p10~0); 512244#L198-1 assume !(0 != main_~p11~0); 512236#L203-1 assume !(0 != main_~p12~0); 512229#L208-1 assume !(0 != main_~p13~0); 512228#L213-1 assume !(0 != main_~p14~0); 512219#L218-1 assume !(0 != main_~p15~0); 512035#L223-1 [2019-11-15 21:42:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 13 times [2019-11-15 21:42:51,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:51,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656299698] [2019-11-15 21:42:51,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:51,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:51,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:42:51,857 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:42:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:42:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -611006262, now seen corresponding path program 1 times [2019-11-15 21:42:51,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:42:51,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569730554] [2019-11-15 21:42:51,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:51,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:42:51,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:42:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:42:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:42:51,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569730554] [2019-11-15 21:42:51,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:42:51,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:42:51,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410238697] [2019-11-15 21:42:51,878 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:42:51,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:42:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:42:51,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:42:51,879 INFO L87 Difference]: Start difference. First operand 167937 states and 241665 transitions. cyclomatic complexity: 77824 Second operand 3 states. [2019-11-15 21:42:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:42:52,460 INFO L93 Difference]: Finished difference Result 331777 states and 471041 transitions. [2019-11-15 21:42:52,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:42:52,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331777 states and 471041 transitions. [2019-11-15 21:42:53,414 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2019-11-15 21:42:54,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331777 states to 331777 states and 471041 transitions. [2019-11-15 21:42:54,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331777 [2019-11-15 21:42:54,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331777 [2019-11-15 21:42:54,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331777 states and 471041 transitions. [2019-11-15 21:42:54,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:42:54,351 INFO L688 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2019-11-15 21:42:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331777 states and 471041 transitions. [2019-11-15 21:42:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331777 to 331777. [2019-11-15 21:42:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331777 states. [2019-11-15 21:42:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331777 states to 331777 states and 471041 transitions. [2019-11-15 21:42:59,776 INFO L711 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2019-11-15 21:42:59,776 INFO L591 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2019-11-15 21:42:59,776 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 21:42:59,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331777 states and 471041 transitions. [2019-11-15 21:43:00,513 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2019-11-15 21:43:00,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:00,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:00,516 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:43:00,516 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:00,516 INFO L791 eck$LassoCheckResult]: Stem: 1011747#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1011748#L223-1 [2019-11-15 21:43:00,516 INFO L793 eck$LassoCheckResult]: Loop: 1011748#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1011946#L56 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;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1011943#L91 assume !(0 != main_~p1~0); 1011940#L91-2 assume !(0 != main_~p2~0); 1011937#L95-1 assume !(0 != main_~p3~0); 1011933#L99-1 assume !(0 != main_~p4~0); 1011930#L103-1 assume !(0 != main_~p5~0); 1011926#L107-1 assume !(0 != main_~p6~0); 1011922#L111-1 assume !(0 != main_~p7~0); 1011918#L115-1 assume !(0 != main_~p8~0); 1011914#L119-1 assume !(0 != main_~p9~0); 1011910#L123-1 assume !(0 != main_~p10~0); 1011907#L127-1 assume !(0 != main_~p11~0); 1011903#L131-1 assume !(0 != main_~p12~0); 1011900#L135-1 assume !(0 != main_~p13~0); 1011832#L139-1 assume !(0 != main_~p14~0); 1011822#L143-1 assume !(0 != main_~p15~0); 1011823#L147-1 assume !(0 != main_~p1~0); 1012019#L153-1 assume !(0 != main_~p2~0); 1012015#L158-1 assume !(0 != main_~p3~0); 1012009#L163-1 assume !(0 != main_~p4~0); 1012003#L168-1 assume !(0 != main_~p5~0); 1011997#L173-1 assume !(0 != main_~p6~0); 1011991#L178-1 assume !(0 != main_~p7~0); 1011985#L183-1 assume !(0 != main_~p8~0); 1011979#L188-1 assume !(0 != main_~p9~0); 1011973#L193-1 assume !(0 != main_~p10~0); 1011967#L198-1 assume !(0 != main_~p11~0); 1011962#L203-1 assume !(0 != main_~p12~0); 1011956#L208-1 assume !(0 != main_~p13~0); 1011951#L213-1 assume !(0 != main_~p14~0); 1011949#L218-1 assume !(0 != main_~p15~0); 1011748#L223-1 [2019-11-15 21:43:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:00,517 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 14 times [2019-11-15 21:43:00,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:00,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637011398] [2019-11-15 21:43:00,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1632074616, now seen corresponding path program 1 times [2019-11-15 21:43:00,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:00,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093608285] [2019-11-15 21:43:00,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,537 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash -606582617, now seen corresponding path program 1 times [2019-11-15 21:43:00,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:00,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872288277] [2019-11-15 21:43:00,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,551 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:00,676 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:43:00,810 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:43:00,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:43:00 BoogieIcfgContainer [2019-11-15 21:43:00,925 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:43:00,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:43:00,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:43:00,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:43:00,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:42:34" (3/4) ... [2019-11-15 21:43:00,931 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:43:01,012 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f0e343f4-cba4-44da-99a3-0f1007acfecb/bin/uautomizer/witness.graphml [2019-11-15 21:43:01,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:43:01,014 INFO L168 Benchmark]: Toolchain (without parser) took 27138.75 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 945.1 MB in the beginning and 1.7 GB in the end (delta: -801.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,016 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:01,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:01,017 INFO L168 Benchmark]: Boogie Preprocessor took 26.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,017 INFO L168 Benchmark]: RCFGBuilder took 555.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,018 INFO L168 Benchmark]: BuchiAutomizer took 26133.26 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -693.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,018 INFO L168 Benchmark]: Witness Printer took 86.82 ms. Allocated memory is still 4.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:01,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 555.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26133.26 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -693.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 86.82 ms. Allocated memory is still 4.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331777 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.0s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 16.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 4.3s Buchi closure took 0.3s. Biggest automaton had 331777 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1517 SDtfs, 799 SDslu, 954 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 54]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1607c39e=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28130727=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f7c53a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ad056a=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@488ed485=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3667293d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d71513d=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ed4175c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79ee0f9c=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@434185a7=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@275e5e8f=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@370a6e29=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ece019e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73f2bebd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c534f3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4283d91e=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND FALSE !(p14 != 0) [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND FALSE !(p2 != 0) [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND FALSE !(p14 != 0) [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...