./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fbb7e06bf350f46f725ea0ddc5d1215829061b3a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 06:47:09,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:09,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:09,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:09,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:09,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:09,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:09,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:09,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:09,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:09,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:09,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:09,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:09,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:09,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:09,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:09,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:09,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:09,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:09,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:09,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:09,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:09,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:09,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:09,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:09,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:09,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:09,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:09,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:09,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:09,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:09,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:09,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:09,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:09,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:09,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:09,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:09,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:09,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:09,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:09,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:09,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:09,256 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:09,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:09,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:09,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:09,258 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:09,258 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:09,259 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:09,259 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:09,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:09,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:09,259 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:09,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:09,260 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:09,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:09,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:09,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:09,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:09,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:09,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:09,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:09,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:09,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:09,263 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:09,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:09,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:09,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:09,264 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:09,268 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:09,268 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fbb7e06bf350f46f725ea0ddc5d1215829061b3a [2020-10-20 06:47:09,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:09,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:09,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:09,535 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:09,536 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:09,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2020-10-20 06:47:09,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbcef145/053addc41e95478aa40362915b73ffc7/FLAG5be7f0daa [2020-10-20 06:47:10,138 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:10,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2020-10-20 06:47:10,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbcef145/053addc41e95478aa40362915b73ffc7/FLAG5be7f0daa [2020-10-20 06:47:10,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efbcef145/053addc41e95478aa40362915b73ffc7 [2020-10-20 06:47:10,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:10,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:10,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:10,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:10,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:10,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:10,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174070f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10, skipping insertion in model container [2020-10-20 06:47:10,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:10,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:10,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:10,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:10,953 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:10,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:10,998 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:10,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10 WrapperNode [2020-10-20 06:47:10,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:11,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:11,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:11,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:11,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:11,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:11,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:11,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:11,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... [2020-10-20 06:47:11,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:11,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:11,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:11,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:11,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:47:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:11,510 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:11,511 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:11,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:11 BoogieIcfgContainer [2020-10-20 06:47:11,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:11,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:11,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:11,518 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:11,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:11,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:10" (1/3) ... [2020-10-20 06:47:11,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c1af79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:11, skipping insertion in model container [2020-10-20 06:47:11,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:11,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:10" (2/3) ... [2020-10-20 06:47:11,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c1af79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:11, skipping insertion in model container [2020-10-20 06:47:11,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:11,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:11" (3/3) ... [2020-10-20 06:47:11,523 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2020-10-20 06:47:11,586 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:11,586 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:11,587 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:11,587 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:11,587 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:11,587 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:11,587 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:11,588 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:11,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 06:47:11,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:47:11,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:11,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:11,635 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:11,636 INFO L853 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] [2020-10-20 06:47:11,636 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:11,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 06:47:11,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:47:11,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:11,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:11,641 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:11,642 INFO L853 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] [2020-10-20 06:47:11,649 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 43#L183-1true [2020-10-20 06:47:11,651 INFO L796 eck$LassoCheckResult]: Loop: 43#L183-1true assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 5#L49true 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; 24#L78true assume 0 != main_~p1~0;main_~lk1~0 := 1; 16#L78-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 6#L82-1true assume !(0 != main_~p3~0); 39#L86-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L90-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L94-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 14#L98-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L102-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 10#L106-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 45#L110-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 30#L114-1true assume !(0 != main_~p11~0); 12#L118-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 25#L122-1true assume !(0 != main_~p1~0); 37#L128-1true assume !(0 != main_~p2~0); 26#L133-1true assume !(0 != main_~p3~0); 35#L138-1true assume !(0 != main_~p4~0); 46#L143-1true assume !(0 != main_~p5~0); 8#L148-1true assume !(0 != main_~p6~0); 20#L153-1true assume !(0 != main_~p7~0); 34#L158-1true assume !(0 != main_~p8~0); 44#L163-1true assume !(0 != main_~p9~0); 7#L168-1true assume !(0 != main_~p10~0); 17#L173-1true assume !(0 != main_~p11~0); 31#L178-1true assume !(0 != main_~p12~0); 43#L183-1true [2020-10-20 06:47:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:11,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:11,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677354625] [2020-10-20 06:47:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:11,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:11,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:11,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2020-10-20 06:47:11,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:11,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130300117] [2020-10-20 06:47:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:11,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130300117] [2020-10-20 06:47:11,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:11,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:11,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475023151] [2020-10-20 06:47:11,911 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:11,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:11,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:11,931 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-10-20 06:47:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:11,971 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2020-10-20 06:47:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:11,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2020-10-20 06:47:11,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-10-20 06:47:11,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2020-10-20 06:47:11,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2020-10-20 06:47:11,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2020-10-20 06:47:11,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2020-10-20 06:47:11,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:11,990 INFO L691 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-20 06:47:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2020-10-20 06:47:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-20 06:47:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 06:47:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2020-10-20 06:47:12,025 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-20 06:47:12,025 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-10-20 06:47:12,025 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:12,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2020-10-20 06:47:12,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-10-20 06:47:12,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,029 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,029 INFO L853 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] [2020-10-20 06:47:12,029 INFO L794 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 159#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 160#L183-1 [2020-10-20 06:47:12,030 INFO L796 eck$LassoCheckResult]: Loop: 160#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 185#L49 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; 198#L78 assume !(0 != main_~p1~0); 197#L78-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 196#L82-1 assume !(0 != main_~p3~0); 182#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 183#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 179#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 142#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 143#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 158#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 190#L114-1 assume !(0 != main_~p11~0); 189#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 188#L122-1 assume !(0 != main_~p1~0); 181#L128-1 assume !(0 != main_~p2~0); 172#L133-1 assume !(0 != main_~p3~0); 174#L138-1 assume !(0 != main_~p4~0); 145#L143-1 assume !(0 != main_~p5~0); 155#L148-1 assume !(0 != main_~p6~0); 157#L153-1 assume !(0 != main_~p7~0); 208#L158-1 assume !(0 != main_~p8~0); 186#L163-1 assume !(0 != main_~p9~0); 150#L168-1 assume !(0 != main_~p10~0); 151#L173-1 assume !(0 != main_~p11~0); 154#L178-1 assume !(0 != main_~p12~0); 160#L183-1 [2020-10-20 06:47:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:12,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471887587] [2020-10-20 06:47:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,063 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2020-10-20 06:47:12,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427571188] [2020-10-20 06:47:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:12,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427571188] [2020-10-20 06:47:12,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137186634] [2020-10-20 06:47:12,128 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,129 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand 3 states. [2020-10-20 06:47:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,170 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2020-10-20 06:47:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2020-10-20 06:47:12,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-10-20 06:47:12,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2020-10-20 06:47:12,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-10-20 06:47:12,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2020-10-20 06:47:12,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2020-10-20 06:47:12,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,184 INFO L691 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-20 06:47:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2020-10-20 06:47:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-20 06:47:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-20 06:47:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2020-10-20 06:47:12,199 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-20 06:47:12,200 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-10-20 06:47:12,200 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:12,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2020-10-20 06:47:12,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-10-20 06:47:12,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,204 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,205 INFO L853 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] [2020-10-20 06:47:12,205 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 392#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 393#L183-1 [2020-10-20 06:47:12,205 INFO L796 eck$LassoCheckResult]: Loop: 393#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 441#L49 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; 439#L78 assume !(0 != main_~p1~0); 437#L78-2 assume !(0 != main_~p2~0); 438#L82-1 assume !(0 != main_~p3~0); 415#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 416#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 468#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 467#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 466#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 465#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 427#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 428#L114-1 assume !(0 != main_~p11~0); 423#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 424#L122-1 assume !(0 != main_~p1~0); 462#L128-1 assume !(0 != main_~p2~0); 461#L133-1 assume !(0 != main_~p3~0); 459#L138-1 assume !(0 != main_~p4~0); 457#L143-1 assume !(0 != main_~p5~0); 455#L148-1 assume !(0 != main_~p6~0); 453#L153-1 assume !(0 != main_~p7~0); 451#L158-1 assume !(0 != main_~p8~0); 449#L163-1 assume !(0 != main_~p9~0); 447#L168-1 assume !(0 != main_~p10~0); 444#L173-1 assume !(0 != main_~p11~0); 443#L178-1 assume !(0 != main_~p12~0); 393#L183-1 [2020-10-20 06:47:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:12,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515918555] [2020-10-20 06:47:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2020-10-20 06:47:12,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450170036] [2020-10-20 06:47:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:12,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450170036] [2020-10-20 06:47:12,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121256628] [2020-10-20 06:47:12,270 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,272 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-10-20 06:47:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,309 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2020-10-20 06:47:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2020-10-20 06:47:12,315 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-10-20 06:47:12,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2020-10-20 06:47:12,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2020-10-20 06:47:12,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2020-10-20 06:47:12,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2020-10-20 06:47:12,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,335 INFO L691 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-20 06:47:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2020-10-20 06:47:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-10-20 06:47:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-10-20 06:47:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2020-10-20 06:47:12,361 INFO L714 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-20 06:47:12,361 INFO L594 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-10-20 06:47:12,361 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:12,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2020-10-20 06:47:12,365 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-10-20 06:47:12,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,366 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,366 INFO L853 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] [2020-10-20 06:47:12,366 INFO L794 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 842#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 843#L183-1 [2020-10-20 06:47:12,366 INFO L796 eck$LassoCheckResult]: Loop: 843#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1074#L49 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; 1073#L78 assume !(0 != main_~p1~0); 1072#L78-2 assume !(0 != main_~p2~0); 1071#L82-1 assume !(0 != main_~p3~0); 1069#L86-1 assume !(0 != main_~p4~0); 1068#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1067#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1066#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1065#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1064#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1063#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1018#L114-1 assume !(0 != main_~p11~0); 1016#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1017#L122-1 assume !(0 != main_~p1~0); 1043#L128-1 assume !(0 != main_~p2~0); 1031#L133-1 assume !(0 != main_~p3~0); 1028#L138-1 assume !(0 != main_~p4~0); 876#L143-1 assume !(0 != main_~p5~0); 836#L148-1 assume !(0 != main_~p6~0); 838#L153-1 assume !(0 != main_~p7~0); 852#L158-1 assume !(0 != main_~p8~0); 1082#L163-1 assume !(0 != main_~p9~0); 1080#L168-1 assume !(0 != main_~p10~0); 1077#L173-1 assume !(0 != main_~p11~0); 1076#L178-1 assume !(0 != main_~p12~0); 843#L183-1 [2020-10-20 06:47:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:12,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66749697] [2020-10-20 06:47:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2020-10-20 06:47:12,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918876167] [2020-10-20 06:47:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:12,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918876167] [2020-10-20 06:47:12,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26276930] [2020-10-20 06:47:12,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,480 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand 3 states. [2020-10-20 06:47:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,511 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2020-10-20 06:47:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2020-10-20 06:47:12,518 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-10-20 06:47:12,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2020-10-20 06:47:12,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2020-10-20 06:47:12,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2020-10-20 06:47:12,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2020-10-20 06:47:12,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,532 INFO L691 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-20 06:47:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2020-10-20 06:47:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-10-20 06:47:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-10-20 06:47:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2020-10-20 06:47:12,563 INFO L714 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-20 06:47:12,563 INFO L594 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-10-20 06:47:12,564 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:12,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2020-10-20 06:47:12,568 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-10-20 06:47:12,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,570 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,570 INFO L853 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] [2020-10-20 06:47:12,570 INFO L794 eck$LassoCheckResult]: Stem: 1750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1721#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 1722#L183-1 [2020-10-20 06:47:12,570 INFO L796 eck$LassoCheckResult]: Loop: 1722#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1795#L49 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; 1790#L78 assume !(0 != main_~p1~0); 1784#L78-2 assume !(0 != main_~p2~0); 1785#L82-1 assume !(0 != main_~p3~0); 1774#L86-1 assume !(0 != main_~p4~0); 1776#L90-1 assume !(0 != main_~p5~0); 1893#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1891#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1889#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1887#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1885#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1883#L114-1 assume !(0 != main_~p11~0); 1881#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1878#L122-1 assume !(0 != main_~p1~0); 1873#L128-1 assume !(0 != main_~p2~0); 1872#L133-1 assume !(0 != main_~p3~0); 1869#L138-1 assume !(0 != main_~p4~0); 1867#L143-1 assume !(0 != main_~p5~0); 1866#L148-1 assume !(0 != main_~p6~0); 1863#L153-1 assume !(0 != main_~p7~0); 1859#L158-1 assume !(0 != main_~p8~0); 1852#L163-1 assume !(0 != main_~p9~0); 1846#L168-1 assume !(0 != main_~p10~0); 1839#L173-1 assume !(0 != main_~p11~0); 1808#L178-1 assume !(0 != main_~p12~0); 1722#L183-1 [2020-10-20 06:47:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:12,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702701464] [2020-10-20 06:47:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2020-10-20 06:47:12,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369850537] [2020-10-20 06:47:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:12,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369850537] [2020-10-20 06:47:12,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021501090] [2020-10-20 06:47:12,667 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,669 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand 3 states. [2020-10-20 06:47:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,694 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2020-10-20 06:47:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2020-10-20 06:47:12,708 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-10-20 06:47:12,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-10-20 06:47:12,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2020-10-20 06:47:12,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2020-10-20 06:47:12,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2020-10-20 06:47:12,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,722 INFO L691 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-20 06:47:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2020-10-20 06:47:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2020-10-20 06:47:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2020-10-20 06:47:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-10-20 06:47:12,763 INFO L714 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-20 06:47:12,763 INFO L594 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-10-20 06:47:12,763 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:12,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2020-10-20 06:47:12,784 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-10-20 06:47:12,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:12,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:12,785 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:12,785 INFO L853 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] [2020-10-20 06:47:12,785 INFO L794 eck$LassoCheckResult]: Stem: 3474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3442#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 3443#L183-1 [2020-10-20 06:47:12,785 INFO L796 eck$LassoCheckResult]: Loop: 3443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 3540#L49 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; 3538#L78 assume !(0 != main_~p1~0); 3534#L78-2 assume !(0 != main_~p2~0); 3532#L82-1 assume !(0 != main_~p3~0); 3528#L86-1 assume !(0 != main_~p4~0); 3524#L90-1 assume !(0 != main_~p5~0); 3520#L94-1 assume !(0 != main_~p6~0); 3518#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3516#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3514#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3512#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3510#L114-1 assume !(0 != main_~p11~0); 3508#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3505#L122-1 assume !(0 != main_~p1~0); 3506#L128-1 assume !(0 != main_~p2~0); 3580#L133-1 assume !(0 != main_~p3~0); 3575#L138-1 assume !(0 != main_~p4~0); 3571#L143-1 assume !(0 != main_~p5~0); 3567#L148-1 assume !(0 != main_~p6~0); 3564#L153-1 assume !(0 != main_~p7~0); 3560#L158-1 assume !(0 != main_~p8~0); 3556#L163-1 assume !(0 != main_~p9~0); 3552#L168-1 assume !(0 != main_~p10~0); 3547#L173-1 assume !(0 != main_~p11~0); 3544#L178-1 assume !(0 != main_~p12~0); 3443#L183-1 [2020-10-20 06:47:12,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:12,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294281741] [2020-10-20 06:47:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:12,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:12,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2020-10-20 06:47:12,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:12,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792587073] [2020-10-20 06:47:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:12,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792587073] [2020-10-20 06:47:12,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:12,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:12,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42996303] [2020-10-20 06:47:12,830 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:12,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:12,831 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand 3 states. [2020-10-20 06:47:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:12,866 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2020-10-20 06:47:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:12,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2020-10-20 06:47:12,898 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-10-20 06:47:12,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-10-20 06:47:12,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2020-10-20 06:47:12,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2020-10-20 06:47:12,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2020-10-20 06:47:12,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:12,927 INFO L691 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-20 06:47:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2020-10-20 06:47:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-10-20 06:47:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-10-20 06:47:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-10-20 06:47:13,006 INFO L714 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-20 06:47:13,007 INFO L594 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-10-20 06:47:13,007 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:13,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2020-10-20 06:47:13,025 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-10-20 06:47:13,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,027 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,028 INFO L853 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] [2020-10-20 06:47:13,028 INFO L794 eck$LassoCheckResult]: Stem: 6858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6827#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 6828#L183-1 [2020-10-20 06:47:13,028 INFO L796 eck$LassoCheckResult]: Loop: 6828#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 6950#L49 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; 6946#L78 assume !(0 != main_~p1~0); 6939#L78-2 assume !(0 != main_~p2~0); 6934#L82-1 assume !(0 != main_~p3~0); 6927#L86-1 assume !(0 != main_~p4~0); 6919#L90-1 assume !(0 != main_~p5~0); 6911#L94-1 assume !(0 != main_~p6~0); 6904#L98-1 assume !(0 != main_~p7~0); 6905#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7036#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7035#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7034#L114-1 assume !(0 != main_~p11~0); 7033#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7032#L122-1 assume !(0 != main_~p1~0); 7030#L128-1 assume !(0 != main_~p2~0); 7029#L133-1 assume !(0 != main_~p3~0); 7022#L138-1 assume !(0 != main_~p4~0); 7017#L143-1 assume !(0 != main_~p5~0); 7013#L148-1 assume !(0 != main_~p6~0); 7011#L153-1 assume !(0 != main_~p7~0); 7010#L158-1 assume !(0 != main_~p8~0); 7008#L163-1 assume !(0 != main_~p9~0); 6983#L168-1 assume !(0 != main_~p10~0); 6976#L173-1 assume !(0 != main_~p11~0); 6959#L178-1 assume !(0 != main_~p12~0); 6828#L183-1 [2020-10-20 06:47:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:13,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635792399] [2020-10-20 06:47:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2020-10-20 06:47:13,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269754683] [2020-10-20 06:47:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:13,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269754683] [2020-10-20 06:47:13,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011331474] [2020-10-20 06:47:13,078 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,079 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2020-10-20 06:47:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,278 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2020-10-20 06:47:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2020-10-20 06:47:13,324 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-10-20 06:47:13,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-10-20 06:47:13,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2020-10-20 06:47:13,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2020-10-20 06:47:13,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2020-10-20 06:47:13,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,377 INFO L691 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-20 06:47:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2020-10-20 06:47:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2020-10-20 06:47:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2020-10-20 06:47:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-10-20 06:47:13,484 INFO L714 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-20 06:47:13,484 INFO L594 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-10-20 06:47:13,484 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:13,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2020-10-20 06:47:13,529 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-10-20 06:47:13,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,530 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,531 INFO L853 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] [2020-10-20 06:47:13,531 INFO L794 eck$LassoCheckResult]: Stem: 13523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 13493#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 13494#L183-1 [2020-10-20 06:47:13,535 INFO L796 eck$LassoCheckResult]: Loop: 13494#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 13742#L49 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; 13740#L78 assume !(0 != main_~p1~0); 13738#L78-2 assume !(0 != main_~p2~0); 13737#L82-1 assume !(0 != main_~p3~0); 13735#L86-1 assume !(0 != main_~p4~0); 13733#L90-1 assume !(0 != main_~p5~0); 13730#L94-1 assume !(0 != main_~p6~0); 13718#L98-1 assume !(0 != main_~p7~0); 13720#L102-1 assume !(0 != main_~p8~0); 13700#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 13701#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 13653#L114-1 assume !(0 != main_~p11~0); 13654#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 13641#L122-1 assume !(0 != main_~p1~0); 13642#L128-1 assume !(0 != main_~p2~0); 13634#L133-1 assume !(0 != main_~p3~0); 13633#L138-1 assume !(0 != main_~p4~0); 13620#L143-1 assume !(0 != main_~p5~0); 13622#L148-1 assume !(0 != main_~p6~0); 13753#L153-1 assume !(0 != main_~p7~0); 13751#L158-1 assume !(0 != main_~p8~0); 13750#L163-1 assume !(0 != main_~p9~0); 13748#L168-1 assume !(0 != main_~p10~0); 13745#L173-1 assume !(0 != main_~p11~0); 13744#L178-1 assume !(0 != main_~p12~0); 13494#L183-1 [2020-10-20 06:47:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:13,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293318957] [2020-10-20 06:47:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2020-10-20 06:47:13,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719329473] [2020-10-20 06:47:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:13,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719329473] [2020-10-20 06:47:13,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956584853] [2020-10-20 06:47:13,627 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,627 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2020-10-20 06:47:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,666 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2020-10-20 06:47:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2020-10-20 06:47:13,966 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-10-20 06:47:14,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-10-20 06:47:14,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2020-10-20 06:47:14,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2020-10-20 06:47:14,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2020-10-20 06:47:14,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,075 INFO L691 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-20 06:47:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2020-10-20 06:47:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2020-10-20 06:47:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2020-10-20 06:47:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-10-20 06:47:14,480 INFO L714 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-20 06:47:14,481 INFO L594 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-10-20 06:47:14,481 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:14,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2020-10-20 06:47:14,513 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-10-20 06:47:14,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,518 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,518 INFO L853 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] [2020-10-20 06:47:14,518 INFO L794 eck$LassoCheckResult]: Stem: 26662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 26624#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 26625#L183-1 [2020-10-20 06:47:14,519 INFO L796 eck$LassoCheckResult]: Loop: 26625#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 26912#L49 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; 26910#L78 assume !(0 != main_~p1~0); 26908#L78-2 assume !(0 != main_~p2~0); 26907#L82-1 assume !(0 != main_~p3~0); 26904#L86-1 assume !(0 != main_~p4~0); 26900#L90-1 assume !(0 != main_~p5~0); 26896#L94-1 assume !(0 != main_~p6~0); 26893#L98-1 assume !(0 != main_~p7~0); 26884#L102-1 assume !(0 != main_~p8~0); 26886#L106-1 assume !(0 != main_~p9~0); 26866#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 26867#L114-1 assume !(0 != main_~p11~0); 26848#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 26849#L122-1 assume !(0 != main_~p1~0); 26843#L128-1 assume !(0 != main_~p2~0); 26844#L133-1 assume !(0 != main_~p3~0); 26821#L138-1 assume !(0 != main_~p4~0); 26822#L143-1 assume !(0 != main_~p5~0); 26799#L148-1 assume !(0 != main_~p6~0); 26801#L153-1 assume !(0 != main_~p7~0); 26921#L158-1 assume !(0 != main_~p8~0); 26919#L163-1 assume !(0 != main_~p9~0); 26918#L168-1 assume !(0 != main_~p10~0); 26915#L173-1 assume !(0 != main_~p11~0); 26914#L178-1 assume !(0 != main_~p12~0); 26625#L183-1 [2020-10-20 06:47:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:14,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5427006] [2020-10-20 06:47:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2020-10-20 06:47:14,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905041040] [2020-10-20 06:47:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905041040] [2020-10-20 06:47:14,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101190780] [2020-10-20 06:47:14,586 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,588 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2020-10-20 06:47:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,697 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2020-10-20 06:47:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2020-10-20 06:47:14,787 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-10-20 06:47:15,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-10-20 06:47:15,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2020-10-20 06:47:15,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2020-10-20 06:47:15,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2020-10-20 06:47:15,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,211 INFO L691 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-20 06:47:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2020-10-20 06:47:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2020-10-20 06:47:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2020-10-20 06:47:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-10-20 06:47:15,550 INFO L714 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-20 06:47:15,551 INFO L594 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-10-20 06:47:15,551 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:15,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2020-10-20 06:47:15,745 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-10-20 06:47:15,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,749 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,749 INFO L853 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] [2020-10-20 06:47:15,749 INFO L794 eck$LassoCheckResult]: Stem: 52528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 52488#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 52489#L183-1 [2020-10-20 06:47:15,751 INFO L796 eck$LassoCheckResult]: Loop: 52489#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 52958#L49 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; 52959#L78 assume !(0 != main_~p1~0); 52961#L78-2 assume !(0 != main_~p2~0); 52956#L82-1 assume !(0 != main_~p3~0); 52957#L86-1 assume !(0 != main_~p4~0); 53036#L90-1 assume !(0 != main_~p5~0); 53029#L94-1 assume !(0 != main_~p6~0); 53022#L98-1 assume !(0 != main_~p7~0); 53019#L102-1 assume !(0 != main_~p8~0); 53017#L106-1 assume !(0 != main_~p9~0); 52875#L110-1 assume !(0 != main_~p10~0); 52877#L114-1 assume !(0 != main_~p11~0); 52867#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 52868#L122-1 assume !(0 != main_~p1~0); 52821#L128-1 assume !(0 != main_~p2~0); 52822#L133-1 assume !(0 != main_~p3~0); 52764#L138-1 assume !(0 != main_~p4~0); 52765#L143-1 assume !(0 != main_~p5~0); 53051#L148-1 assume !(0 != main_~p6~0); 52730#L153-1 assume !(0 != main_~p7~0); 52731#L158-1 assume !(0 != main_~p8~0); 53057#L163-1 assume !(0 != main_~p9~0); 53055#L168-1 assume !(0 != main_~p10~0); 53032#L173-1 assume !(0 != main_~p11~0); 53027#L178-1 assume !(0 != main_~p12~0); 52489#L183-1 [2020-10-20 06:47:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:15,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505692400] [2020-10-20 06:47:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,779 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2020-10-20 06:47:15,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618698931] [2020-10-20 06:47:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:15,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618698931] [2020-10-20 06:47:15,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:15,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067915272] [2020-10-20 06:47:15,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,800 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2020-10-20 06:47:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:16,241 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2020-10-20 06:47:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:16,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2020-10-20 06:47:16,468 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-10-20 06:47:16,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-10-20 06:47:16,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2020-10-20 06:47:16,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2020-10-20 06:47:16,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2020-10-20 06:47:16,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,753 INFO L691 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-20 06:47:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2020-10-20 06:47:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2020-10-20 06:47:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33794 states. [2020-10-20 06:47:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-10-20 06:47:18,365 INFO L714 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-20 06:47:18,365 INFO L594 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-10-20 06:47:18,366 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:47:18,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2020-10-20 06:47:18,460 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-10-20 06:47:18,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:18,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:18,462 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:18,462 INFO L853 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] [2020-10-20 06:47:18,462 INFO L794 eck$LassoCheckResult]: Stem: 103477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 103442#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 103443#L183-1 [2020-10-20 06:47:18,463 INFO L796 eck$LassoCheckResult]: Loop: 103443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 103594#L49 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; 103590#L78 assume !(0 != main_~p1~0); 103588#L78-2 assume !(0 != main_~p2~0); 103586#L82-1 assume !(0 != main_~p3~0); 103582#L86-1 assume !(0 != main_~p4~0); 103578#L90-1 assume !(0 != main_~p5~0); 103574#L94-1 assume !(0 != main_~p6~0); 103570#L98-1 assume !(0 != main_~p7~0); 103566#L102-1 assume !(0 != main_~p8~0); 103562#L106-1 assume !(0 != main_~p9~0); 103558#L110-1 assume !(0 != main_~p10~0); 103556#L114-1 assume !(0 != main_~p11~0); 103552#L118-1 assume !(0 != main_~p12~0); 103548#L122-1 assume !(0 != main_~p1~0); 103546#L128-1 assume !(0 != main_~p2~0); 103540#L133-1 assume !(0 != main_~p3~0); 103539#L138-1 assume !(0 != main_~p4~0); 103625#L143-1 assume !(0 != main_~p5~0); 103621#L148-1 assume !(0 != main_~p6~0); 103617#L153-1 assume !(0 != main_~p7~0); 103613#L158-1 assume !(0 != main_~p8~0); 103609#L163-1 assume !(0 != main_~p9~0); 103605#L168-1 assume !(0 != main_~p10~0); 103601#L173-1 assume !(0 != main_~p11~0); 103597#L178-1 assume !(0 != main_~p12~0); 103443#L183-1 [2020-10-20 06:47:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-20 06:47:18,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:18,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397644058] [2020-10-20 06:47:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2020-10-20 06:47:18,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:18,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228838417] [2020-10-20 06:47:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2020-10-20 06:47:18,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:18,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385111055] [2020-10-20 06:47:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:19,540 WARN L193 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-10-20 06:47:19,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:19 BoogieIcfgContainer [2020-10-20 06:47:19,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:19,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:19,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:19,708 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:19,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:11" (3/4) ... [2020-10-20 06:47:19,712 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:19,829 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:19,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:19,834 INFO L168 Benchmark]: Toolchain (without parser) took 9221.09 ms. Allocated memory was 35.1 MB in the beginning and 245.4 MB in the end (delta: 210.2 MB). Free memory was 12.7 MB in the beginning and 133.9 MB in the end (delta: -121.2 MB). Peak memory consumption was 89.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,834 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.5 kB). Peak memory consumption was 29.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.08 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.9 MB in the beginning and 23.3 MB in the end (delta: -11.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 43.5 MB. Free memory was 23.3 MB in the beginning and 21.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,836 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 43.5 MB. Free memory was 21.3 MB in the beginning and 19.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,838 INFO L168 Benchmark]: RCFGBuilder took 445.98 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 19.6 MB in the beginning and 25.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,840 INFO L168 Benchmark]: BuchiAutomizer took 8193.62 ms. Allocated memory was 45.1 MB in the beginning and 245.4 MB in the end (delta: 200.3 MB). Free memory was 25.1 MB in the beginning and 137.5 MB in the end (delta: -112.4 MB). Peak memory consumption was 247.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,842 INFO L168 Benchmark]: Witness Printer took 124.08 ms. Allocated memory is still 245.4 MB. Free memory was 137.5 MB in the beginning and 133.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:19,847 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.5 kB). Peak memory consumption was 29.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 380.08 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.9 MB in the beginning and 23.3 MB in the end (delta: -11.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 43.5 MB. Free memory was 23.3 MB in the beginning and 21.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 43.5 MB. Free memory was 21.3 MB in the beginning and 19.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 445.98 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 19.6 MB in the beginning and 25.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 8193.62 ms. Allocated memory was 45.1 MB in the beginning and 245.4 MB in the end (delta: 200.3 MB). Free memory was 25.1 MB in the beginning and 137.5 MB in the end (delta: -112.4 MB). Peak memory consumption was 247.5 MB. Max. memory is 14.3 GB. * Witness Printer took 124.08 ms. Allocated memory is still 245.4 MB. Free memory was 137.5 MB in the beginning and 133.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 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 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had 33794 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 957 SDtfs, 496 SDslu, 595 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: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=12237} State at position 1 is {NULL=12240, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=12237, p4=0, p10=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f69ffc8=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7701b113=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4863b268=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8ac4787=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@388b6ee5=0, lk10=0, p11=0, lk11=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a8a87bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63365aee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27257f6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d1fe8f6=10, cond=10, NULL=12239, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4278d9ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17ddc31b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d273e18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e389b1f=0, NULL=0, NULL=0, NULL=0, NULL=12238, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...