./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12.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_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-16 00:39:54,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:39:54,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:39:54,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:39:54,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:39:54,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:39:54,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:39:54,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:39:54,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:39:54,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:39:54,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:39:54,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:39:54,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:39:54,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:39:54,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:39:54,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:39:54,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:39:54,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:39:54,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:39:54,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:39:54,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:39:54,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:39:54,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:39:54,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:39:54,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:39:54,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:39:54,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:39:54,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:39:54,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:39:54,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:39:54,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:39:54,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:39:54,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:39:54,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:39:54,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:39:54,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:39:54,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:39:54,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:39:54,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:39:54,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:39:54,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:39:54,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:39:54,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:39:54,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:39:54,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:39:54,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:39:54,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:39:54,232 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:39:54,233 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:39:54,233 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:39:54,233 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:39:54,234 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:39:54,235 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:39:54,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:39:54,236 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:39:54,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:39:54,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:39:54,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:39:54,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:39:54,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:39:54,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:39:54,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:39:54,238 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:39:54,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:39:54,238 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:39:54,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:39:54,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:39:54,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:39:54,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:39:54,240 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:39:54,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:39:54,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:39:54,242 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:39:54,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:39:54,246 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_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-11-16 00:39:54,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:39:54,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:39:54,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:39:54,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:39:54,308 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:39:54,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-11-16 00:39:54,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/data/b7ca08147/254bb249b570436f9962158a1774c510/FLAG20d9b8a9d [2019-11-16 00:39:54,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:39:54,804 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/sv-benchmarks/c/locks/test_locks_12.c [2019-11-16 00:39:54,816 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/data/b7ca08147/254bb249b570436f9962158a1774c510/FLAG20d9b8a9d [2019-11-16 00:39:55,133 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/data/b7ca08147/254bb249b570436f9962158a1774c510 [2019-11-16 00:39:55,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:39:55,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:39:55,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:55,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:39:55,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:39:55,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6720d9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55, skipping insertion in model container [2019-11-16 00:39:55,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:39:55,196 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:39:55,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:55,561 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:39:55,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:55,638 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:39:55,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55 WrapperNode [2019-11-16 00:39:55,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:55,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:55,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:39:55,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:39:55,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:55,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:39:55,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:39:55,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:39:55,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... [2019-11-16 00:39:55,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:39:55,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:39:55,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:39:55,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:39:55,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/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-16 00:39:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:39:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:39:56,130 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:39:56,130 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:39:56,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:56 BoogieIcfgContainer [2019-11-16 00:39:56,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:39:56,133 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:39:56,133 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:39:56,137 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:39:56,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:56,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:39:55" (1/3) ... [2019-11-16 00:39:56,139 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64944cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:56, skipping insertion in model container [2019-11-16 00:39:56,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:56,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:55" (2/3) ... [2019-11-16 00:39:56,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64944cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:56, skipping insertion in model container [2019-11-16 00:39:56,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:56,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:56" (3/3) ... [2019-11-16 00:39:56,142 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2019-11-16 00:39:56,238 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:39:56,238 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:39:56,238 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:39:56,238 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:39:56,238 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:39:56,239 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:39:56,239 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:39:56,239 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:39:56,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-16 00:39:56,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-16 00:39:56,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:56,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:56,290 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:56,290 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] [2019-11-16 00:39:56,290 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:39:56,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-16 00:39:56,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-16 00:39:56,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:56,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:56,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:56,296 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] [2019-11-16 00:39:56,304 INFO L791 eck$LassoCheckResult]: Stem: 39#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_~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_~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;havoc main_~cond~0; 14#L181-1true [2019-11-16 00:39:56,305 INFO L793 eck$LassoCheckResult]: Loop: 14#L181-1true assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L47true 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; 22#L76true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L76-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 4#L80-1true assume !(0 != main_~p3~0); 11#L84-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 44#L88-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L92-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 15#L96-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 28#L100-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 8#L104-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 41#L108-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 30#L112-1true assume !(0 != main_~p11~0); 37#L116-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 24#L120-1true assume !(0 != main_~p1~0); 9#L126-1true assume !(0 != main_~p2~0); 25#L131-1true assume !(0 != main_~p3~0); 35#L136-1true assume !(0 != main_~p4~0); 42#L141-1true assume !(0 != main_~p5~0); 6#L146-1true assume !(0 != main_~p6~0); 20#L151-1true assume !(0 != main_~p7~0); 34#L156-1true assume !(0 != main_~p8~0); 40#L161-1true assume !(0 != main_~p9~0); 5#L166-1true assume !(0 != main_~p10~0); 18#L171-1true assume !(0 != main_~p11~0); 31#L176-1true assume !(0 != main_~p12~0); 14#L181-1true [2019-11-16 00:39:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:39:56,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662466503] [2019-11-16 00:39:56,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash -708087768, now seen corresponding path program 1 times [2019-11-16 00:39:56,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099233956] [2019-11-16 00:39:56,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:56,545 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-16 00:39:56,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099233956] [2019-11-16 00:39:56,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:56,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:56,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814267556] [2019-11-16 00:39:56,557 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:56,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:56,577 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-11-16 00:39:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:56,659 INFO L93 Difference]: Finished difference Result 86 states and 153 transitions. [2019-11-16 00:39:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:56,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 153 transitions. [2019-11-16 00:39:56,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-11-16 00:39:56,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 76 states and 122 transitions. [2019-11-16 00:39:56,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2019-11-16 00:39:56,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-16 00:39:56,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 122 transitions. [2019-11-16 00:39:56,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:56,690 INFO L688 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2019-11-16 00:39:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 122 transitions. [2019-11-16 00:39:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-16 00:39:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-16 00:39:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2019-11-16 00:39:56,725 INFO L711 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2019-11-16 00:39:56,725 INFO L591 BuchiCegarLoop]: Abstraction has 76 states and 122 transitions. [2019-11-16 00:39:56,725 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:39:56,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 122 transitions. [2019-11-16 00:39:56,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-11-16 00:39:56,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:56,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:56,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:56,730 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] [2019-11-16 00:39:56,731 INFO L791 eck$LassoCheckResult]: Stem: 182#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_~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_~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;havoc main_~cond~0; 161#L181-1 [2019-11-16 00:39:56,731 INFO L793 eck$LassoCheckResult]: Loop: 161#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 139#L47 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; 140#L76 assume !(0 != main_~p1~0); 184#L76-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 214#L80-1 assume !(0 != main_~p3~0); 213#L84-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 212#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 211#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 210#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 209#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 208#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 207#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 206#L112-1 assume !(0 != main_~p11~0); 205#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 204#L120-1 assume !(0 != main_~p1~0); 153#L126-1 assume !(0 != main_~p2~0); 155#L131-1 assume !(0 != main_~p3~0); 201#L136-1 assume !(0 != main_~p4~0); 199#L141-1 assume !(0 != main_~p5~0); 197#L146-1 assume !(0 != main_~p6~0); 168#L151-1 assume !(0 != main_~p7~0); 157#L156-1 assume !(0 != main_~p8~0); 183#L161-1 assume !(0 != main_~p9~0); 143#L166-1 assume !(0 != main_~p10~0); 144#L171-1 assume !(0 != main_~p11~0); 147#L176-1 assume !(0 != main_~p12~0); 161#L181-1 [2019-11-16 00:39:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:39:56,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836780370] [2019-11-16 00:39:56,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,748 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash -842101274, now seen corresponding path program 1 times [2019-11-16 00:39:56,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136027666] [2019-11-16 00:39:56,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:56,801 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-16 00:39:56,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136027666] [2019-11-16 00:39:56,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:56,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:56,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868666510] [2019-11-16 00:39:56,803 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:56,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:56,804 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. cyclomatic complexity: 48 Second operand 3 states. [2019-11-16 00:39:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:56,831 INFO L93 Difference]: Finished difference Result 149 states and 237 transitions. [2019-11-16 00:39:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:56,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 237 transitions. [2019-11-16 00:39:56,838 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2019-11-16 00:39:56,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 237 transitions. [2019-11-16 00:39:56,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2019-11-16 00:39:56,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-16 00:39:56,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 237 transitions. [2019-11-16 00:39:56,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:56,845 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2019-11-16 00:39:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 237 transitions. [2019-11-16 00:39:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-16 00:39:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:39:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 237 transitions. [2019-11-16 00:39:56,862 INFO L711 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2019-11-16 00:39:56,862 INFO L591 BuchiCegarLoop]: Abstraction has 149 states and 237 transitions. [2019-11-16 00:39:56,863 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:39:56,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 237 transitions. [2019-11-16 00:39:56,868 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2019-11-16 00:39:56,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:56,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:56,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:56,869 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] [2019-11-16 00:39:56,874 INFO L791 eck$LassoCheckResult]: Stem: 412#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_~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_~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;havoc main_~cond~0; 413#L181-1 [2019-11-16 00:39:56,874 INFO L793 eck$LassoCheckResult]: Loop: 413#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 435#L47 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; 433#L76 assume !(0 != main_~p1~0); 431#L76-2 assume !(0 != main_~p2~0); 430#L80-1 assume !(0 != main_~p3~0); 429#L84-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 428#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 427#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 426#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 425#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 424#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 423#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 422#L112-1 assume !(0 != main_~p11~0); 420#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 418#L120-1 assume !(0 != main_~p1~0); 419#L126-1 assume !(0 != main_~p2~0); 455#L131-1 assume !(0 != main_~p3~0); 453#L136-1 assume !(0 != main_~p4~0); 451#L141-1 assume !(0 != main_~p5~0); 449#L146-1 assume !(0 != main_~p6~0); 447#L151-1 assume !(0 != main_~p7~0); 445#L156-1 assume !(0 != main_~p8~0); 443#L161-1 assume !(0 != main_~p9~0); 441#L166-1 assume !(0 != main_~p10~0); 439#L171-1 assume !(0 != main_~p11~0); 437#L176-1 assume !(0 != main_~p12~0); 413#L181-1 [2019-11-16 00:39:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-16 00:39:56,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844517256] [2019-11-16 00:39:56,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:56,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1647427688, now seen corresponding path program 1 times [2019-11-16 00:39:56,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:56,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546599756] [2019-11-16 00:39:56,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:56,944 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-16 00:39:56,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546599756] [2019-11-16 00:39:56,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:56,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:56,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442633004] [2019-11-16 00:39:56,945 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:56,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:56,946 INFO L87 Difference]: Start difference. First operand 149 states and 237 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-16 00:39:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:56,975 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2019-11-16 00:39:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:56,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 461 transitions. [2019-11-16 00:39:56,980 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2019-11-16 00:39:56,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 461 transitions. [2019-11-16 00:39:56,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2019-11-16 00:39:56,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2019-11-16 00:39:56,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 461 transitions. [2019-11-16 00:39:56,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:56,989 INFO L688 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2019-11-16 00:39:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 461 transitions. [2019-11-16 00:39:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-16 00:39:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-16 00:39:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 461 transitions. [2019-11-16 00:39:57,011 INFO L711 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2019-11-16 00:39:57,011 INFO L591 BuchiCegarLoop]: Abstraction has 293 states and 461 transitions. [2019-11-16 00:39:57,011 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:39:57,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 461 transitions. [2019-11-16 00:39:57,014 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2019-11-16 00:39:57,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:57,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:57,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:57,016 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] [2019-11-16 00:39:57,016 INFO L791 eck$LassoCheckResult]: Stem: 863#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_~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_~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;havoc main_~cond~0; 864#L181-1 [2019-11-16 00:39:57,016 INFO L793 eck$LassoCheckResult]: Loop: 864#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 906#L47 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; 903#L76 assume !(0 != main_~p1~0); 900#L76-2 assume !(0 != main_~p2~0); 898#L80-1 assume !(0 != main_~p3~0); 895#L84-1 assume !(0 != main_~p4~0); 893#L88-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 891#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 889#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 887#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 885#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 883#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 881#L112-1 assume !(0 != main_~p11~0); 879#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 876#L120-1 assume !(0 != main_~p1~0); 877#L126-1 assume !(0 != main_~p2~0); 945#L131-1 assume !(0 != main_~p3~0); 940#L136-1 assume !(0 != main_~p4~0); 937#L141-1 assume !(0 != main_~p5~0); 933#L146-1 assume !(0 != main_~p6~0); 929#L151-1 assume !(0 != main_~p7~0); 925#L156-1 assume !(0 != main_~p8~0); 921#L161-1 assume !(0 != main_~p9~0); 917#L166-1 assume !(0 != main_~p10~0); 913#L171-1 assume !(0 != main_~p11~0); 910#L176-1 assume !(0 != main_~p12~0); 864#L181-1 [2019-11-16 00:39:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-16 00:39:57,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907671554] [2019-11-16 00:39:57,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2070129514, now seen corresponding path program 1 times [2019-11-16 00:39:57,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276312916] [2019-11-16 00:39:57,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:57,062 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-16 00:39:57,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276312916] [2019-11-16 00:39:57,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:57,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948104494] [2019-11-16 00:39:57,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:57,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:57,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:57,065 INFO L87 Difference]: Start difference. First operand 293 states and 461 transitions. cyclomatic complexity: 176 Second operand 3 states. [2019-11-16 00:39:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:57,096 INFO L93 Difference]: Finished difference Result 577 states and 897 transitions. [2019-11-16 00:39:57,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:57,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 897 transitions. [2019-11-16 00:39:57,104 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2019-11-16 00:39:57,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 897 transitions. [2019-11-16 00:39:57,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2019-11-16 00:39:57,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2019-11-16 00:39:57,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 897 transitions. [2019-11-16 00:39:57,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:57,121 INFO L688 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2019-11-16 00:39:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 897 transitions. [2019-11-16 00:39:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-11-16 00:39:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-16 00:39:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 897 transitions. [2019-11-16 00:39:57,175 INFO L711 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2019-11-16 00:39:57,175 INFO L591 BuchiCegarLoop]: Abstraction has 577 states and 897 transitions. [2019-11-16 00:39:57,175 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:39:57,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 577 states and 897 transitions. [2019-11-16 00:39:57,180 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2019-11-16 00:39:57,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:57,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:57,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:57,181 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] [2019-11-16 00:39:57,181 INFO L791 eck$LassoCheckResult]: Stem: 1741#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_~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_~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;havoc main_~cond~0; 1742#L181-1 [2019-11-16 00:39:57,182 INFO L793 eck$LassoCheckResult]: Loop: 1742#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 1812#L47 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; 1809#L76 assume !(0 != main_~p1~0); 1805#L76-2 assume !(0 != main_~p2~0); 1802#L80-1 assume !(0 != main_~p3~0); 1799#L84-1 assume !(0 != main_~p4~0); 1794#L88-1 assume !(0 != main_~p5~0); 1788#L92-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1789#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1780#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1781#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1772#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1773#L112-1 assume !(0 != main_~p11~0); 1765#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1766#L120-1 assume !(0 != main_~p1~0); 1853#L126-1 assume !(0 != main_~p2~0); 1850#L131-1 assume !(0 != main_~p3~0); 1845#L136-1 assume !(0 != main_~p4~0); 1843#L141-1 assume !(0 != main_~p5~0); 1841#L146-1 assume !(0 != main_~p6~0); 1837#L151-1 assume !(0 != main_~p7~0); 1833#L156-1 assume !(0 != main_~p8~0); 1829#L161-1 assume !(0 != main_~p9~0); 1825#L166-1 assume !(0 != main_~p10~0); 1821#L171-1 assume !(0 != main_~p11~0); 1817#L176-1 assume !(0 != main_~p12~0); 1742#L181-1 [2019-11-16 00:39:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-16 00:39:57,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294447775] [2019-11-16 00:39:57,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,194 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1252481064, now seen corresponding path program 1 times [2019-11-16 00:39:57,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380646325] [2019-11-16 00:39:57,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:57,225 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-16 00:39:57,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380646325] [2019-11-16 00:39:57,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:57,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007146692] [2019-11-16 00:39:57,227 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:57,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:57,228 INFO L87 Difference]: Start difference. First operand 577 states and 897 transitions. cyclomatic complexity: 336 Second operand 3 states. [2019-11-16 00:39:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:57,251 INFO L93 Difference]: Finished difference Result 1137 states and 1745 transitions. [2019-11-16 00:39:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:57,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1745 transitions. [2019-11-16 00:39:57,265 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2019-11-16 00:39:57,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1745 transitions. [2019-11-16 00:39:57,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2019-11-16 00:39:57,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2019-11-16 00:39:57,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1745 transitions. [2019-11-16 00:39:57,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:57,282 INFO L688 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2019-11-16 00:39:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1745 transitions. [2019-11-16 00:39:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2019-11-16 00:39:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2019-11-16 00:39:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1745 transitions. [2019-11-16 00:39:57,315 INFO L711 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2019-11-16 00:39:57,315 INFO L591 BuchiCegarLoop]: Abstraction has 1137 states and 1745 transitions. [2019-11-16 00:39:57,316 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:39:57,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1137 states and 1745 transitions. [2019-11-16 00:39:57,325 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2019-11-16 00:39:57,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:57,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:57,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:57,326 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] [2019-11-16 00:39:57,326 INFO L791 eck$LassoCheckResult]: Stem: 3455#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_~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_~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;havoc main_~cond~0; 3456#L181-1 [2019-11-16 00:39:57,326 INFO L793 eck$LassoCheckResult]: Loop: 3456#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 3520#L47 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; 3517#L76 assume !(0 != main_~p1~0); 3514#L76-2 assume !(0 != main_~p2~0); 3511#L80-1 assume !(0 != main_~p3~0); 3507#L84-1 assume !(0 != main_~p4~0); 3503#L88-1 assume !(0 != main_~p5~0); 3500#L92-1 assume !(0 != main_~p6~0); 3498#L96-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3496#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3494#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3492#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3490#L112-1 assume !(0 != main_~p11~0); 3488#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3485#L120-1 assume !(0 != main_~p1~0); 3486#L126-1 assume !(0 != main_~p2~0); 3559#L131-1 assume !(0 != main_~p3~0); 3554#L136-1 assume !(0 != main_~p4~0); 3550#L141-1 assume !(0 != main_~p5~0); 3546#L146-1 assume !(0 != main_~p6~0); 3543#L151-1 assume !(0 != main_~p7~0); 3539#L156-1 assume !(0 != main_~p8~0); 3535#L161-1 assume !(0 != main_~p9~0); 3531#L166-1 assume !(0 != main_~p10~0); 3527#L171-1 assume !(0 != main_~p11~0); 3524#L176-1 assume !(0 != main_~p12~0); 3456#L181-1 [2019-11-16 00:39:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-16 00:39:57,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690716556] [2019-11-16 00:39:57,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -436462678, now seen corresponding path program 1 times [2019-11-16 00:39:57,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100999156] [2019-11-16 00:39:57,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:57,368 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-16 00:39:57,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100999156] [2019-11-16 00:39:57,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:57,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806195934] [2019-11-16 00:39:57,370 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:57,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:57,371 INFO L87 Difference]: Start difference. First operand 1137 states and 1745 transitions. cyclomatic complexity: 640 Second operand 3 states. [2019-11-16 00:39:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:57,400 INFO L93 Difference]: Finished difference Result 2241 states and 3393 transitions. [2019-11-16 00:39:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:57,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2241 states and 3393 transitions. [2019-11-16 00:39:57,429 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2019-11-16 00:39:57,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2241 states to 2241 states and 3393 transitions. [2019-11-16 00:39:57,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2241 [2019-11-16 00:39:57,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2241 [2019-11-16 00:39:57,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2241 states and 3393 transitions. [2019-11-16 00:39:57,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:57,460 INFO L688 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2019-11-16 00:39:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states and 3393 transitions. [2019-11-16 00:39:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2019-11-16 00:39:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2019-11-16 00:39:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3393 transitions. [2019-11-16 00:39:57,527 INFO L711 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2019-11-16 00:39:57,527 INFO L591 BuchiCegarLoop]: Abstraction has 2241 states and 3393 transitions. [2019-11-16 00:39:57,528 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:39:57,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2241 states and 3393 transitions. [2019-11-16 00:39:57,545 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2019-11-16 00:39:57,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:57,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:57,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:57,547 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] [2019-11-16 00:39:57,547 INFO L791 eck$LassoCheckResult]: Stem: 6841#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_~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_~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;havoc main_~cond~0; 6842#L181-1 [2019-11-16 00:39:57,547 INFO L793 eck$LassoCheckResult]: Loop: 6842#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 6923#L47 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; 6920#L76 assume !(0 != main_~p1~0); 6916#L76-2 assume !(0 != main_~p2~0); 6913#L80-1 assume !(0 != main_~p3~0); 6910#L84-1 assume !(0 != main_~p4~0); 6906#L88-1 assume !(0 != main_~p5~0); 6902#L92-1 assume !(0 != main_~p6~0); 6897#L96-1 assume !(0 != main_~p7~0); 6891#L100-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6892#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6883#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6884#L112-1 assume !(0 != main_~p11~0); 6876#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 6877#L120-1 assume !(0 != main_~p1~0); 6964#L126-1 assume !(0 != main_~p2~0); 6961#L131-1 assume !(0 != main_~p3~0); 6956#L136-1 assume !(0 != main_~p4~0); 6952#L141-1 assume !(0 != main_~p5~0); 6948#L146-1 assume !(0 != main_~p6~0); 6946#L151-1 assume !(0 != main_~p7~0); 6944#L156-1 assume !(0 != main_~p8~0); 6940#L161-1 assume !(0 != main_~p9~0); 6936#L166-1 assume !(0 != main_~p10~0); 6932#L171-1 assume !(0 != main_~p11~0); 6928#L176-1 assume !(0 != main_~p12~0); 6842#L181-1 [2019-11-16 00:39:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-16 00:39:57,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119975266] [2019-11-16 00:39:57,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1864359912, now seen corresponding path program 1 times [2019-11-16 00:39:57,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127060081] [2019-11-16 00:39:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:57,630 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-16 00:39:57,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127060081] [2019-11-16 00:39:57,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:57,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453890733] [2019-11-16 00:39:57,631 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:57,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:57,632 INFO L87 Difference]: Start difference. First operand 2241 states and 3393 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2019-11-16 00:39:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:57,694 INFO L93 Difference]: Finished difference Result 4417 states and 6593 transitions. [2019-11-16 00:39:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:57,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4417 states and 6593 transitions. [2019-11-16 00:39:57,754 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2019-11-16 00:39:57,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4417 states to 4417 states and 6593 transitions. [2019-11-16 00:39:57,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4417 [2019-11-16 00:39:57,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4417 [2019-11-16 00:39:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4417 states and 6593 transitions. [2019-11-16 00:39:57,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:57,817 INFO L688 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2019-11-16 00:39:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states and 6593 transitions. [2019-11-16 00:39:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 4417. [2019-11-16 00:39:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-16 00:39:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 6593 transitions. [2019-11-16 00:39:57,942 INFO L711 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2019-11-16 00:39:57,942 INFO L591 BuchiCegarLoop]: Abstraction has 4417 states and 6593 transitions. [2019-11-16 00:39:57,942 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:39:57,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4417 states and 6593 transitions. [2019-11-16 00:39:57,974 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2019-11-16 00:39:57,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:57,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:57,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:57,977 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] [2019-11-16 00:39:57,978 INFO L791 eck$LassoCheckResult]: Stem: 13513#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_~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_~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;havoc main_~cond~0; 13514#L181-1 [2019-11-16 00:39:57,979 INFO L793 eck$LassoCheckResult]: Loop: 13514#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 13625#L47 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; 13620#L76 assume !(0 != main_~p1~0); 13612#L76-2 assume !(0 != main_~p2~0); 13605#L80-1 assume !(0 != main_~p3~0); 13600#L84-1 assume !(0 != main_~p4~0); 13592#L88-1 assume !(0 != main_~p5~0); 13584#L92-1 assume !(0 != main_~p6~0); 13577#L96-1 assume !(0 != main_~p7~0); 13568#L100-1 assume !(0 != main_~p8~0); 13569#L104-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 13706#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 13700#L112-1 assume !(0 != main_~p11~0); 13686#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 13684#L120-1 assume !(0 != main_~p1~0); 13682#L126-1 assume !(0 != main_~p2~0); 13679#L131-1 assume !(0 != main_~p3~0); 13674#L136-1 assume !(0 != main_~p4~0); 13670#L141-1 assume !(0 != main_~p5~0); 13666#L146-1 assume !(0 != main_~p6~0); 13663#L151-1 assume !(0 != main_~p7~0); 13661#L156-1 assume !(0 != main_~p8~0); 13660#L161-1 assume !(0 != main_~p9~0); 13658#L166-1 assume !(0 != main_~p10~0); 13656#L171-1 assume !(0 != main_~p11~0); 13636#L176-1 assume !(0 != main_~p12~0); 13514#L181-1 [2019-11-16 00:39:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-16 00:39:57,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:57,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945149733] [2019-11-16 00:39:57,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:57,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:58,003 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash 276012010, now seen corresponding path program 1 times [2019-11-16 00:39:58,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:58,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134586968] [2019-11-16 00:39:58,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:58,035 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-16 00:39:58,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134586968] [2019-11-16 00:39:58,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:58,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:58,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841089656] [2019-11-16 00:39:58,036 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:58,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:58,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:58,037 INFO L87 Difference]: Start difference. First operand 4417 states and 6593 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2019-11-16 00:39:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:58,110 INFO L93 Difference]: Finished difference Result 8705 states and 12801 transitions. [2019-11-16 00:39:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:58,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8705 states and 12801 transitions. [2019-11-16 00:39:58,178 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2019-11-16 00:39:58,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8705 states to 8705 states and 12801 transitions. [2019-11-16 00:39:58,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8705 [2019-11-16 00:39:58,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8705 [2019-11-16 00:39:58,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8705 states and 12801 transitions. [2019-11-16 00:39:58,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:58,288 INFO L688 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2019-11-16 00:39:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states and 12801 transitions. [2019-11-16 00:39:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8705. [2019-11-16 00:39:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8705 states. [2019-11-16 00:39:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8705 states to 8705 states and 12801 transitions. [2019-11-16 00:39:58,569 INFO L711 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2019-11-16 00:39:58,569 INFO L591 BuchiCegarLoop]: Abstraction has 8705 states and 12801 transitions. [2019-11-16 00:39:58,569 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:39:58,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8705 states and 12801 transitions. [2019-11-16 00:39:58,605 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2019-11-16 00:39:58,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:58,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:58,610 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:58,610 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] [2019-11-16 00:39:58,610 INFO L791 eck$LassoCheckResult]: Stem: 26637#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_~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_~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;havoc main_~cond~0; 26638#L181-1 [2019-11-16 00:39:58,611 INFO L793 eck$LassoCheckResult]: Loop: 26638#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 26741#L47 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; 26737#L76 assume !(0 != main_~p1~0); 26735#L76-2 assume !(0 != main_~p2~0); 26733#L80-1 assume !(0 != main_~p3~0); 26729#L84-1 assume !(0 != main_~p4~0); 26725#L88-1 assume !(0 != main_~p5~0); 26721#L92-1 assume !(0 != main_~p6~0); 26717#L96-1 assume !(0 != main_~p7~0); 26713#L100-1 assume !(0 != main_~p8~0); 26709#L104-1 assume !(0 != main_~p9~0); 26707#L108-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 26705#L112-1 assume !(0 != main_~p11~0); 26703#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 26699#L120-1 assume !(0 != main_~p1~0); 26697#L126-1 assume !(0 != main_~p2~0); 26691#L131-1 assume !(0 != main_~p3~0); 26690#L136-1 assume !(0 != main_~p4~0); 26772#L141-1 assume !(0 != main_~p5~0); 26768#L146-1 assume !(0 != main_~p6~0); 26764#L151-1 assume !(0 != main_~p7~0); 26760#L156-1 assume !(0 != main_~p8~0); 26756#L161-1 assume !(0 != main_~p9~0); 26753#L166-1 assume !(0 != main_~p10~0); 26749#L171-1 assume !(0 != main_~p11~0); 26745#L176-1 assume !(0 != main_~p12~0); 26638#L181-1 [2019-11-16 00:39:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-16 00:39:58,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:58,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322978867] [2019-11-16 00:39:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:58,632 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -745056344, now seen corresponding path program 1 times [2019-11-16 00:39:58,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:58,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728004988] [2019-11-16 00:39:58,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:58,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:58,676 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-16 00:39:58,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728004988] [2019-11-16 00:39:58,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:58,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:58,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65006056] [2019-11-16 00:39:58,677 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:58,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:58,678 INFO L87 Difference]: Start difference. First operand 8705 states and 12801 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2019-11-16 00:39:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:58,778 INFO L93 Difference]: Finished difference Result 17153 states and 24833 transitions. [2019-11-16 00:39:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:58,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17153 states and 24833 transitions. [2019-11-16 00:39:58,883 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2019-11-16 00:39:58,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17153 states to 17153 states and 24833 transitions. [2019-11-16 00:39:58,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17153 [2019-11-16 00:39:59,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17153 [2019-11-16 00:39:59,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17153 states and 24833 transitions. [2019-11-16 00:39:59,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:59,029 INFO L688 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2019-11-16 00:39:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17153 states and 24833 transitions. [2019-11-16 00:39:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17153 to 17153. [2019-11-16 00:39:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17153 states. [2019-11-16 00:39:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17153 states to 17153 states and 24833 transitions. [2019-11-16 00:39:59,362 INFO L711 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2019-11-16 00:39:59,362 INFO L591 BuchiCegarLoop]: Abstraction has 17153 states and 24833 transitions. [2019-11-16 00:39:59,364 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:39:59,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17153 states and 24833 transitions. [2019-11-16 00:39:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2019-11-16 00:39:59,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:59,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:59,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:39:59,442 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] [2019-11-16 00:39:59,442 INFO L791 eck$LassoCheckResult]: Stem: 52502#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_~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_~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;havoc main_~cond~0; 52503#L181-1 [2019-11-16 00:39:59,444 INFO L793 eck$LassoCheckResult]: Loop: 52503#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 52618#L47 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; 52614#L76 assume !(0 != main_~p1~0); 52612#L76-2 assume !(0 != main_~p2~0); 52610#L80-1 assume !(0 != main_~p3~0); 52606#L84-1 assume !(0 != main_~p4~0); 52602#L88-1 assume !(0 != main_~p5~0); 52598#L92-1 assume !(0 != main_~p6~0); 52594#L96-1 assume !(0 != main_~p7~0); 52590#L100-1 assume !(0 != main_~p8~0); 52586#L104-1 assume !(0 != main_~p9~0); 52582#L108-1 assume !(0 != main_~p10~0); 52580#L112-1 assume !(0 != main_~p11~0); 52578#L116-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 52574#L120-1 assume !(0 != main_~p1~0); 52572#L126-1 assume !(0 != main_~p2~0); 52566#L131-1 assume !(0 != main_~p3~0); 52565#L136-1 assume !(0 != main_~p4~0); 52649#L141-1 assume !(0 != main_~p5~0); 52645#L146-1 assume !(0 != main_~p6~0); 52641#L151-1 assume !(0 != main_~p7~0); 52637#L156-1 assume !(0 != main_~p8~0); 52633#L161-1 assume !(0 != main_~p9~0); 52629#L166-1 assume !(0 != main_~p10~0); 52626#L171-1 assume !(0 != main_~p11~0); 52622#L176-1 assume !(0 != main_~p12~0); 52503#L181-1 [2019-11-16 00:39:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-16 00:39:59,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:59,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8001899] [2019-11-16 00:39:59,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:59,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:59,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:59,464 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2024920022, now seen corresponding path program 1 times [2019-11-16 00:39:59,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:59,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178178223] [2019-11-16 00:39:59,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:59,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:59,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:59,501 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-16 00:39:59,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178178223] [2019-11-16 00:39:59,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:59,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:39:59,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120669637] [2019-11-16 00:39:59,503 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:59,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:59,503 INFO L87 Difference]: Start difference. First operand 17153 states and 24833 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2019-11-16 00:39:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:59,726 INFO L93 Difference]: Finished difference Result 33793 states and 48129 transitions. [2019-11-16 00:39:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:59,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33793 states and 48129 transitions. [2019-11-16 00:39:59,903 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2019-11-16 00:40:00,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33793 states to 33793 states and 48129 transitions. [2019-11-16 00:40:00,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33793 [2019-11-16 00:40:00,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33793 [2019-11-16 00:40:00,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33793 states and 48129 transitions. [2019-11-16 00:40:00,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:40:00,073 INFO L688 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2019-11-16 00:40:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33793 states and 48129 transitions. [2019-11-16 00:40:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33793 to 33793. [2019-11-16 00:40:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33793 states. [2019-11-16 00:40:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33793 states to 33793 states and 48129 transitions. [2019-11-16 00:40:00,679 INFO L711 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2019-11-16 00:40:00,680 INFO L591 BuchiCegarLoop]: Abstraction has 33793 states and 48129 transitions. [2019-11-16 00:40:00,680 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:40:00,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33793 states and 48129 transitions. [2019-11-16 00:40:00,812 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2019-11-16 00:40:00,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:40:00,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:40:00,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:40:00,814 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] [2019-11-16 00:40:00,814 INFO L791 eck$LassoCheckResult]: Stem: 103453#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_~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_~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;havoc main_~cond~0; 103454#L181-1 [2019-11-16 00:40:00,814 INFO L793 eck$LassoCheckResult]: Loop: 103454#L181-1 assume !false;main_~cond~0 := main_#t~nondet12;havoc main_#t~nondet12; 103573#L47 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; 103569#L76 assume !(0 != main_~p1~0); 103567#L76-2 assume !(0 != main_~p2~0); 103565#L80-1 assume !(0 != main_~p3~0); 103561#L84-1 assume !(0 != main_~p4~0); 103557#L88-1 assume !(0 != main_~p5~0); 103553#L92-1 assume !(0 != main_~p6~0); 103549#L96-1 assume !(0 != main_~p7~0); 103545#L100-1 assume !(0 != main_~p8~0); 103541#L104-1 assume !(0 != main_~p9~0); 103537#L108-1 assume !(0 != main_~p10~0); 103535#L112-1 assume !(0 != main_~p11~0); 103531#L116-1 assume !(0 != main_~p12~0); 103527#L120-1 assume !(0 != main_~p1~0); 103525#L126-1 assume !(0 != main_~p2~0); 103519#L131-1 assume !(0 != main_~p3~0); 103518#L136-1 assume !(0 != main_~p4~0); 103604#L141-1 assume !(0 != main_~p5~0); 103600#L146-1 assume !(0 != main_~p6~0); 103596#L151-1 assume !(0 != main_~p7~0); 103592#L156-1 assume !(0 != main_~p8~0); 103588#L161-1 assume !(0 != main_~p9~0); 103584#L166-1 assume !(0 != main_~p10~0); 103581#L171-1 assume !(0 != main_~p11~0); 103576#L176-1 assume !(0 != main_~p12~0); 103454#L181-1 [2019-11-16 00:40:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-16 00:40:00,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:00,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963053200] [2019-11-16 00:40:00,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1683241260, now seen corresponding path program 1 times [2019-11-16 00:40:00,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:00,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769437920] [2019-11-16 00:40:00,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,870 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1428504715, now seen corresponding path program 1 times [2019-11-16 00:40:00,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:00,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321312861] [2019-11-16 00:40:00,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:00,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:40:00,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:40:01,031 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:40:01,288 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:40:01,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:40:01 BoogieIcfgContainer [2019-11-16 00:40:01,384 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:40:01,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:40:01,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:40:01,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:40:01,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:56" (3/4) ... [2019-11-16 00:40:01,390 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:40:01,490 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb4c4c9d-ecb0-4d5b-881f-0b92ec3197dc/bin/uautomizer/witness.graphml [2019-11-16 00:40:01,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:40:01,493 INFO L168 Benchmark]: Toolchain (without parser) took 6354.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,493 INFO L168 Benchmark]: CDTParser took 0.29 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-16 00:40:01,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.24 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-16 00:40:01,497 INFO L168 Benchmark]: Boogie Preprocessor took 27.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,497 INFO L168 Benchmark]: RCFGBuilder took 419.18 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,498 INFO L168 Benchmark]: BuchiAutomizer took 5251.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.9 MB). Peak memory consumption was 388.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,498 INFO L168 Benchmark]: Witness Printer took 106.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:01,500 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.29 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 501.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.24 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 27.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.18 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5251.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.9 MB). Peak memory consumption was 388.9 MB. Max. memory is 11.5 GB. * Witness Printer took 106.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33793 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had 33793 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 947 SDtfs, 496 SDslu, 585 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 45]: 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@53cd6281=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dc5c01d=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b93751d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15b20502=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@340156eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a3a9124=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c2758e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@225b3188=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5652f75c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@540eb38c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b6a6e8d=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ce2d9a9=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61ddd8f6=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: 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; [L43] int cond; Loop: [L45] COND TRUE 1 [L46] cond = __VERIFIER_nondet_int() [L47] COND FALSE !(cond == 0) [L50] lk1 = 0 [L52] lk2 = 0 [L54] lk3 = 0 [L56] lk4 = 0 [L58] lk5 = 0 [L60] lk6 = 0 [L62] lk7 = 0 [L64] lk8 = 0 [L66] lk9 = 0 [L68] lk10 = 0 [L70] lk11 = 0 [L72] lk12 = 0 [L76] COND FALSE !(p1 != 0) [L80] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L88] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L96] COND FALSE !(p6 != 0) [L100] COND FALSE !(p7 != 0) [L104] COND FALSE !(p8 != 0) [L108] COND FALSE !(p9 != 0) [L112] COND FALSE !(p10 != 0) [L116] COND FALSE !(p11 != 0) [L120] COND FALSE !(p12 != 0) [L126] COND FALSE !(p1 != 0) [L131] COND FALSE !(p2 != 0) [L136] COND FALSE !(p3 != 0) [L141] COND FALSE !(p4 != 0) [L146] COND FALSE !(p5 != 0) [L151] COND FALSE !(p6 != 0) [L156] COND FALSE !(p7 != 0) [L161] COND FALSE !(p8 != 0) [L166] COND FALSE !(p9 != 0) [L171] COND FALSE !(p10 != 0) [L176] COND FALSE !(p11 != 0) [L181] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...