./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 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.5.800.v20200727-1323.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_11.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 a93221bc263791497331acd2a7a0150037c621aa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-26 04:29:20,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:29:20,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:29:20,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:29:20,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:29:20,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:29:20,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:29:20,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:29:20,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:29:20,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:29:20,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:29:20,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:29:20,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:29:20,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:29:20,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:29:20,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:29:20,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:29:20,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:29:20,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:29:20,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:29:20,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:29:20,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:29:20,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:29:20,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:29:20,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:29:20,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:29:20,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:29:20,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:29:20,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:29:20,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:29:20,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:29:20,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:29:20,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:29:20,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:29:20,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:29:20,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:29:20,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:29:20,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:29:20,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:29:20,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:29:20,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:29:20,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:29:20,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:29:20,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:29:20,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:29:20,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:29:20,307 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:29:20,307 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:29:20,308 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:29:20,308 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:29:20,308 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:29:20,308 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:29:20,309 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:29:20,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:29:20,309 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:29:20,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:29:20,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:29:20,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:29:20,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:29:20,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:29:20,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:29:20,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:29:20,311 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:29:20,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:29:20,312 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:29:20,312 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:29:20,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:29:20,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:29:20,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:29:20,313 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:29:20,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:29:20,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:29:20,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:29:20,314 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:29:20,315 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:29:20,316 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a93221bc263791497331acd2a7a0150037c621aa [2020-10-26 04:29:20,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:29:20,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:29:20,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:29:20,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:29:20,769 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:29:20,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2020-10-26 04:29:20,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84e19238/e7409c0654544f69b79b9e535fe0b143/FLAG4f135690b [2020-10-26 04:29:21,388 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:29:21,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2020-10-26 04:29:21,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84e19238/e7409c0654544f69b79b9e535fe0b143/FLAG4f135690b [2020-10-26 04:29:21,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84e19238/e7409c0654544f69b79b9e535fe0b143 [2020-10-26 04:29:21,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:29:21,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:29:21,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:21,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:29:21,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:29:21,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:21" (1/1) ... [2020-10-26 04:29:21,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c07dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:21, skipping insertion in model container [2020-10-26 04:29:21,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:21" (1/1) ... [2020-10-26 04:29:21,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:29:21,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:29:22,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:22,085 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:29:22,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:22,130 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:29:22,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22 WrapperNode [2020-10-26 04:29:22,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:22,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:22,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:29:22,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:29:22,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:22,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:29:22,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:29:22,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:29:22,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (1/1) ... [2020-10-26 04:29:22,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:29:22,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:29:22,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:29:22,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:29:22,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (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-26 04:29:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:29:22,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:29:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:29:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:29:22,664 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:29:22,665 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:29:22,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:22 BoogieIcfgContainer [2020-10-26 04:29:22,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:29:22,668 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:29:22,669 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:29:22,673 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:29:22,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:22,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:29:21" (1/3) ... [2020-10-26 04:29:22,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@695fd4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:22, skipping insertion in model container [2020-10-26 04:29:22,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:22,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:22" (2/3) ... [2020-10-26 04:29:22,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@695fd4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:22, skipping insertion in model container [2020-10-26 04:29:22,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:22,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:22" (3/3) ... [2020-10-26 04:29:22,679 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2020-10-26 04:29:22,760 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:29:22,760 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:29:22,760 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:29:22,764 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:29:22,764 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:29:22,764 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:29:22,765 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:29:22,765 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:29:22,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-10-26 04:29:22,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-26 04:29:22,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:22,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:22,852 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:22,852 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] [2020-10-26 04:29:22,853 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:29:22,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-10-26 04:29:22,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-26 04:29:22,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:22,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:22,866 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:22,867 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] [2020-10-26 04:29:22,875 INFO L794 eck$LassoCheckResult]: Stem: 37#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); 14#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 31#L169-1true [2020-10-26 04:29:22,881 INFO L796 eck$LassoCheckResult]: Loop: 31#L169-1true assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 43#L46true 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; 12#L73true assume 0 != main_~p1~0;main_~lk1~0 := 1; 9#L73-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 41#L77-1true assume !(0 != main_~p3~0); 27#L81-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 33#L85-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 20#L89-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 8#L93-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 38#L97-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 45#L101-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 32#L105-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 17#L109-1true assume !(0 != main_~p11~0); 5#L113-1true assume !(0 != main_~p1~0); 39#L119-1true assume !(0 != main_~p2~0); 6#L124-1true assume !(0 != main_~p3~0); 15#L129-1true assume !(0 != main_~p4~0); 25#L134-1true assume !(0 != main_~p5~0); 35#L139-1true assume !(0 != main_~p6~0); 4#L144-1true assume !(0 != main_~p7~0); 34#L149-1true assume !(0 != main_~p8~0); 44#L154-1true assume !(0 != main_~p9~0); 11#L159-1true assume !(0 != main_~p10~0); 24#L164-1true assume !(0 != main_~p11~0); 31#L169-1true [2020-10-26 04:29:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:29:22,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:22,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135892228] [2020-10-26 04:29:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2020-10-26 04:29:23,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273244426] [2020-10-26 04:29:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:23,243 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-26 04:29:23,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273244426] [2020-10-26 04:29:23,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:23,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:23,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495242068] [2020-10-26 04:29:23,251 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:23,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:23,272 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-10-26 04:29:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:23,318 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2020-10-26 04:29:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:23,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2020-10-26 04:29:23,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-26 04:29:23,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2020-10-26 04:29:23,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-10-26 04:29:23,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-26 04:29:23,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2020-10-26 04:29:23,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:23,339 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-26 04:29:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2020-10-26 04:29:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-26 04:29:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-26 04:29:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2020-10-26 04:29:23,376 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-26 04:29:23,376 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-10-26 04:29:23,376 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:29:23,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2020-10-26 04:29:23,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-26 04:29:23,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:23,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:23,380 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:23,380 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] [2020-10-26 04:29:23,381 INFO L794 eck$LassoCheckResult]: Stem: 170#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); 153#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 154#L169-1 [2020-10-26 04:29:23,381 INFO L796 eck$LassoCheckResult]: Loop: 154#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 185#L46 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; 184#L73 assume !(0 != main_~p1~0); 183#L73-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 174#L77-1 assume !(0 != main_~p3~0); 163#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 164#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 159#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 143#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 144#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 178#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 177#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 176#L109-1 assume !(0 != main_~p11~0); 175#L113-1 assume !(0 != main_~p1~0); 173#L119-1 assume !(0 != main_~p2~0); 138#L124-1 assume !(0 != main_~p3~0); 139#L129-1 assume !(0 != main_~p4~0); 148#L134-1 assume !(0 != main_~p5~0); 158#L139-1 assume !(0 != main_~p6~0); 133#L144-1 assume !(0 != main_~p7~0); 135#L149-1 assume !(0 != main_~p8~0); 191#L154-1 assume !(0 != main_~p9~0); 189#L159-1 assume !(0 != main_~p10~0); 187#L164-1 assume !(0 != main_~p11~0); 154#L169-1 [2020-10-26 04:29:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-26 04:29:23,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88481931] [2020-10-26 04:29:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,424 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2020-10-26 04:29:23,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986624636] [2020-10-26 04:29:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:23,496 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-26 04:29:23,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986624636] [2020-10-26 04:29:23,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:23,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:23,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31543209] [2020-10-26 04:29:23,502 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:23,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:23,506 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-10-26 04:29:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:23,561 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-10-26 04:29:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:23,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2020-10-26 04:29:23,567 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-10-26 04:29:23,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2020-10-26 04:29:23,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2020-10-26 04:29:23,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2020-10-26 04:29:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2020-10-26 04:29:23,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:23,572 INFO L691 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-26 04:29:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2020-10-26 04:29:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-26 04:29:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-26 04:29:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2020-10-26 04:29:23,584 INFO L714 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-26 04:29:23,584 INFO L594 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2020-10-26 04:29:23,585 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:29:23,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2020-10-26 04:29:23,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2020-10-26 04:29:23,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:23,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:23,588 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:23,588 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] [2020-10-26 04:29:23,589 INFO L794 eck$LassoCheckResult]: Stem: 389#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); 369#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 370#L169-1 [2020-10-26 04:29:23,589 INFO L796 eck$LassoCheckResult]: Loop: 370#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 400#L46 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; 397#L73 assume !(0 != main_~p1~0); 398#L73-2 assume !(0 != main_~p2~0); 451#L77-1 assume !(0 != main_~p3~0); 450#L81-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 449#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 448#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 447#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 446#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 445#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 444#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 443#L109-1 assume !(0 != main_~p11~0); 441#L113-1 assume !(0 != main_~p1~0); 439#L119-1 assume !(0 != main_~p2~0); 437#L124-1 assume !(0 != main_~p3~0); 433#L129-1 assume !(0 != main_~p4~0); 429#L134-1 assume !(0 != main_~p5~0); 425#L139-1 assume !(0 != main_~p6~0); 421#L144-1 assume !(0 != main_~p7~0); 417#L149-1 assume !(0 != main_~p8~0); 413#L154-1 assume !(0 != main_~p9~0); 409#L159-1 assume !(0 != main_~p10~0); 405#L164-1 assume !(0 != main_~p11~0); 370#L169-1 [2020-10-26 04:29:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-26 04:29:23,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171226326] [2020-10-26 04:29:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,634 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2020-10-26 04:29:23,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477280729] [2020-10-26 04:29:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:23,691 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-26 04:29:23,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477280729] [2020-10-26 04:29:23,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:23,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:23,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832485114] [2020-10-26 04:29:23,693 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:23,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:23,694 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-10-26 04:29:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:23,715 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2020-10-26 04:29:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:23,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2020-10-26 04:29:23,719 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-10-26 04:29:23,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2020-10-26 04:29:23,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2020-10-26 04:29:23,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2020-10-26 04:29:23,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2020-10-26 04:29:23,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:23,725 INFO L691 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-26 04:29:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2020-10-26 04:29:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-10-26 04:29:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-26 04:29:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2020-10-26 04:29:23,745 INFO L714 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-26 04:29:23,745 INFO L594 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2020-10-26 04:29:23,745 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:29:23,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2020-10-26 04:29:23,747 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2020-10-26 04:29:23,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:23,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:23,749 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:23,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] [2020-10-26 04:29:23,749 INFO L794 eck$LassoCheckResult]: Stem: 802#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); 782#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 783#L169-1 [2020-10-26 04:29:23,749 INFO L796 eck$LassoCheckResult]: Loop: 783#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 814#L46 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; 809#L73 assume !(0 != main_~p1~0); 804#L73-2 assume !(0 != main_~p2~0); 806#L77-1 assume !(0 != main_~p3~0); 911#L81-1 assume !(0 != main_~p4~0); 907#L85-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 903#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 899#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 895#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 891#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 887#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 883#L109-1 assume !(0 != main_~p11~0); 878#L113-1 assume !(0 != main_~p1~0); 874#L119-1 assume !(0 != main_~p2~0); 871#L124-1 assume !(0 != main_~p3~0); 867#L129-1 assume !(0 != main_~p4~0); 868#L134-1 assume !(0 != main_~p5~0); 844#L139-1 assume !(0 != main_~p6~0); 843#L144-1 assume !(0 != main_~p7~0); 832#L149-1 assume !(0 != main_~p8~0); 827#L154-1 assume !(0 != main_~p9~0); 822#L159-1 assume !(0 != main_~p10~0); 818#L164-1 assume !(0 != main_~p11~0); 783#L169-1 [2020-10-26 04:29:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-26 04:29:23,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797029951] [2020-10-26 04:29:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,789 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2020-10-26 04:29:23,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373363863] [2020-10-26 04:29:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:23,841 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-26 04:29:23,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373363863] [2020-10-26 04:29:23,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:23,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:23,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568868806] [2020-10-26 04:29:23,843 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:23,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:23,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:23,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:23,845 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand 3 states. [2020-10-26 04:29:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:23,867 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2020-10-26 04:29:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:23,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2020-10-26 04:29:23,874 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-10-26 04:29:23,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2020-10-26 04:29:23,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2020-10-26 04:29:23,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2020-10-26 04:29:23,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2020-10-26 04:29:23,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:23,884 INFO L691 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-26 04:29:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2020-10-26 04:29:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-26 04:29:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-26 04:29:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2020-10-26 04:29:23,909 INFO L714 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-26 04:29:23,909 INFO L594 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2020-10-26 04:29:23,910 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:29:23,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2020-10-26 04:29:23,914 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2020-10-26 04:29:23,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:23,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:23,915 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:23,915 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] [2020-10-26 04:29:23,916 INFO L794 eck$LassoCheckResult]: Stem: 1616#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); 1589#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 1590#L169-1 [2020-10-26 04:29:23,916 INFO L796 eck$LassoCheckResult]: Loop: 1590#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 1761#L46 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; 1757#L73 assume !(0 != main_~p1~0); 1754#L73-2 assume !(0 != main_~p2~0); 1755#L77-1 assume !(0 != main_~p3~0); 1741#L81-1 assume !(0 != main_~p4~0); 1743#L85-1 assume !(0 != main_~p5~0); 1728#L89-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1729#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1716#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1717#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1704#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1705#L109-1 assume !(0 != main_~p11~0); 1689#L113-1 assume !(0 != main_~p1~0); 1691#L119-1 assume !(0 != main_~p2~0); 1793#L124-1 assume !(0 != main_~p3~0); 1790#L129-1 assume !(0 != main_~p4~0); 1788#L134-1 assume !(0 != main_~p5~0); 1785#L139-1 assume !(0 != main_~p6~0); 1781#L144-1 assume !(0 != main_~p7~0); 1777#L149-1 assume !(0 != main_~p8~0); 1773#L154-1 assume !(0 != main_~p9~0); 1769#L159-1 assume !(0 != main_~p10~0); 1765#L164-1 assume !(0 != main_~p11~0); 1590#L169-1 [2020-10-26 04:29:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-26 04:29:23,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279207252] [2020-10-26 04:29:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:23,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:23,937 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2020-10-26 04:29:23,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:23,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932866595] [2020-10-26 04:29:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:23,964 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-26 04:29:23,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932866595] [2020-10-26 04:29:23,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:23,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:23,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664965170] [2020-10-26 04:29:23,966 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:23,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:23,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:23,967 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand 3 states. [2020-10-26 04:29:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:23,996 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2020-10-26 04:29:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:23,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2020-10-26 04:29:24,018 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-10-26 04:29:24,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2020-10-26 04:29:24,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2020-10-26 04:29:24,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2020-10-26 04:29:24,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2020-10-26 04:29:24,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:24,040 INFO L691 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-26 04:29:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2020-10-26 04:29:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2020-10-26 04:29:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2020-10-26 04:29:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2020-10-26 04:29:24,068 INFO L714 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-26 04:29:24,068 INFO L594 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2020-10-26 04:29:24,068 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:29:24,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2020-10-26 04:29:24,078 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2020-10-26 04:29:24,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:24,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:24,081 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:24,081 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] [2020-10-26 04:29:24,081 INFO L794 eck$LassoCheckResult]: Stem: 3189#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); 3166#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 3167#L169-1 [2020-10-26 04:29:24,081 INFO L796 eck$LassoCheckResult]: Loop: 3167#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 3287#L46 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; 3280#L73 assume !(0 != main_~p1~0); 3281#L73-2 assume !(0 != main_~p2~0); 3268#L77-1 assume !(0 != main_~p3~0); 3269#L81-1 assume !(0 != main_~p4~0); 3398#L85-1 assume !(0 != main_~p5~0); 3391#L89-1 assume !(0 != main_~p6~0); 3387#L93-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3383#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3379#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3375#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3371#L109-1 assume !(0 != main_~p11~0); 3362#L113-1 assume !(0 != main_~p1~0); 3361#L119-1 assume !(0 != main_~p2~0); 3359#L124-1 assume !(0 != main_~p3~0); 3356#L129-1 assume !(0 != main_~p4~0); 3349#L134-1 assume !(0 != main_~p5~0); 3344#L139-1 assume !(0 != main_~p6~0); 3318#L144-1 assume !(0 != main_~p7~0); 3317#L149-1 assume !(0 != main_~p8~0); 3312#L154-1 assume !(0 != main_~p9~0); 3310#L159-1 assume !(0 != main_~p10~0); 3296#L164-1 assume !(0 != main_~p11~0); 3167#L169-1 [2020-10-26 04:29:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-26 04:29:24,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121446119] [2020-10-26 04:29:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,136 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2020-10-26 04:29:24,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477035884] [2020-10-26 04:29:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:24,178 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-26 04:29:24,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477035884] [2020-10-26 04:29:24,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:24,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:24,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068393117] [2020-10-26 04:29:24,181 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:24,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:24,184 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand 3 states. [2020-10-26 04:29:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:24,211 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2020-10-26 04:29:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:24,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2020-10-26 04:29:24,249 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-10-26 04:29:24,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2020-10-26 04:29:24,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2020-10-26 04:29:24,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2020-10-26 04:29:24,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2020-10-26 04:29:24,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:24,272 INFO L691 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-26 04:29:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2020-10-26 04:29:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2020-10-26 04:29:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-10-26 04:29:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2020-10-26 04:29:24,318 INFO L714 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-26 04:29:24,318 INFO L594 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2020-10-26 04:29:24,318 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:29:24,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2020-10-26 04:29:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2020-10-26 04:29:24,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:24,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:24,333 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:24,333 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] [2020-10-26 04:29:24,333 INFO L794 eck$LassoCheckResult]: Stem: 6288#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); 6264#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 6265#L169-1 [2020-10-26 04:29:24,333 INFO L796 eck$LassoCheckResult]: Loop: 6265#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 6475#L46 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; 6472#L73 assume !(0 != main_~p1~0); 6473#L73-2 assume !(0 != main_~p2~0); 6597#L77-1 assume !(0 != main_~p3~0); 6593#L81-1 assume !(0 != main_~p4~0); 6590#L85-1 assume !(0 != main_~p5~0); 6588#L89-1 assume !(0 != main_~p6~0); 6585#L93-1 assume !(0 != main_~p7~0); 6583#L97-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 6580#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 6577#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 6574#L109-1 assume !(0 != main_~p11~0); 6571#L113-1 assume !(0 != main_~p1~0); 6568#L119-1 assume !(0 != main_~p2~0); 6565#L124-1 assume !(0 != main_~p3~0); 6563#L129-1 assume !(0 != main_~p4~0); 6557#L134-1 assume !(0 != main_~p5~0); 6554#L139-1 assume !(0 != main_~p6~0); 6552#L144-1 assume !(0 != main_~p7~0); 6551#L149-1 assume !(0 != main_~p8~0); 6549#L154-1 assume !(0 != main_~p9~0); 6547#L159-1 assume !(0 != main_~p10~0); 6545#L164-1 assume !(0 != main_~p11~0); 6265#L169-1 [2020-10-26 04:29:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-26 04:29:24,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606459935] [2020-10-26 04:29:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2020-10-26 04:29:24,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917961805] [2020-10-26 04:29:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:24,384 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-26 04:29:24,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917961805] [2020-10-26 04:29:24,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:24,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:24,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348681024] [2020-10-26 04:29:24,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:24,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:24,387 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand 3 states. [2020-10-26 04:29:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:24,418 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2020-10-26 04:29:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:24,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2020-10-26 04:29:24,453 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-10-26 04:29:24,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2020-10-26 04:29:24,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2020-10-26 04:29:24,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2020-10-26 04:29:24,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2020-10-26 04:29:24,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:24,507 INFO L691 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-26 04:29:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2020-10-26 04:29:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2020-10-26 04:29:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2020-10-26 04:29:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2020-10-26 04:29:24,602 INFO L714 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-26 04:29:24,603 INFO L594 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2020-10-26 04:29:24,603 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:29:24,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2020-10-26 04:29:24,626 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2020-10-26 04:29:24,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:24,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:24,627 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:24,627 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] [2020-10-26 04:29:24,627 INFO L794 eck$LassoCheckResult]: Stem: 12376#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); 12354#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 12355#L169-1 [2020-10-26 04:29:24,628 INFO L796 eck$LassoCheckResult]: Loop: 12355#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 12825#L46 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; 12799#L73 assume !(0 != main_~p1~0); 12795#L73-2 assume !(0 != main_~p2~0); 12785#L77-1 assume !(0 != main_~p3~0); 12783#L81-1 assume !(0 != main_~p4~0); 12780#L85-1 assume !(0 != main_~p5~0); 12776#L89-1 assume !(0 != main_~p6~0); 12765#L93-1 assume !(0 != main_~p7~0); 12759#L97-1 assume !(0 != main_~p8~0); 12760#L101-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 12875#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 12873#L109-1 assume !(0 != main_~p11~0); 12871#L113-1 assume !(0 != main_~p1~0); 12872#L119-1 assume !(0 != main_~p2~0); 12896#L124-1 assume !(0 != main_~p3~0); 12891#L129-1 assume !(0 != main_~p4~0); 12886#L134-1 assume !(0 != main_~p5~0); 12887#L139-1 assume !(0 != main_~p6~0); 12677#L144-1 assume !(0 != main_~p7~0); 12679#L149-1 assume !(0 != main_~p8~0); 12704#L154-1 assume !(0 != main_~p9~0); 12829#L159-1 assume !(0 != main_~p10~0); 12827#L164-1 assume !(0 != main_~p11~0); 12355#L169-1 [2020-10-26 04:29:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-26 04:29:24,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866540611] [2020-10-26 04:29:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:24,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:24,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2020-10-26 04:29:24,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:24,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675715817] [2020-10-26 04:29:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:24,671 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-26 04:29:24,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675715817] [2020-10-26 04:29:24,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:24,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:24,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280097415] [2020-10-26 04:29:24,673 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:24,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:24,673 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand 3 states. [2020-10-26 04:29:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:24,742 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2020-10-26 04:29:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:24,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2020-10-26 04:29:24,874 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-10-26 04:29:25,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2020-10-26 04:29:25,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2020-10-26 04:29:25,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2020-10-26 04:29:25,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2020-10-26 04:29:25,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:25,061 INFO L691 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-26 04:29:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2020-10-26 04:29:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2020-10-26 04:29:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7938 states. [2020-10-26 04:29:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2020-10-26 04:29:25,268 INFO L714 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-26 04:29:25,268 INFO L594 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2020-10-26 04:29:25,269 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:29:25,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2020-10-26 04:29:25,333 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2020-10-26 04:29:25,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:25,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:25,335 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:25,335 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] [2020-10-26 04:29:25,336 INFO L794 eck$LassoCheckResult]: Stem: 24361#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); 24332#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 24333#L169-1 [2020-10-26 04:29:25,336 INFO L796 eck$LassoCheckResult]: Loop: 24333#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 24485#L46 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; 24481#L73 assume !(0 != main_~p1~0); 24478#L73-2 assume !(0 != main_~p2~0); 24475#L77-1 assume !(0 != main_~p3~0); 24468#L81-1 assume !(0 != main_~p4~0); 24466#L85-1 assume !(0 != main_~p5~0); 24464#L89-1 assume !(0 != main_~p6~0); 24465#L93-1 assume !(0 != main_~p7~0); 24536#L97-1 assume !(0 != main_~p8~0); 24532#L101-1 assume !(0 != main_~p9~0); 24529#L105-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 24527#L109-1 assume !(0 != main_~p11~0); 24524#L113-1 assume !(0 != main_~p1~0); 24520#L119-1 assume !(0 != main_~p2~0); 24517#L124-1 assume !(0 != main_~p3~0); 24512#L129-1 assume !(0 != main_~p4~0); 24508#L134-1 assume !(0 != main_~p5~0); 24470#L139-1 assume !(0 != main_~p6~0); 24471#L144-1 assume !(0 != main_~p7~0); 24500#L149-1 assume !(0 != main_~p8~0); 24496#L154-1 assume !(0 != main_~p9~0); 24493#L159-1 assume !(0 != main_~p10~0); 24490#L164-1 assume !(0 != main_~p11~0); 24333#L169-1 [2020-10-26 04:29:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-26 04:29:25,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:25,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550147406] [2020-10-26 04:29:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:25,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:25,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:25,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2020-10-26 04:29:25,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:25,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086759618] [2020-10-26 04:29:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:25,395 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-26 04:29:25,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086759618] [2020-10-26 04:29:25,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:25,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:25,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654702256] [2020-10-26 04:29:25,396 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:25,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:25,397 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand 3 states. [2020-10-26 04:29:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:25,464 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2020-10-26 04:29:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:25,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2020-10-26 04:29:25,612 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-10-26 04:29:25,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2020-10-26 04:29:25,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2020-10-26 04:29:25,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2020-10-26 04:29:25,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2020-10-26 04:29:25,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:25,731 INFO L691 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-26 04:29:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2020-10-26 04:29:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2020-10-26 04:29:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15618 states. [2020-10-26 04:29:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2020-10-26 04:29:26,066 INFO L714 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-26 04:29:26,066 INFO L594 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2020-10-26 04:29:26,066 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:29:26,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2020-10-26 04:29:26,247 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2020-10-26 04:29:26,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:26,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:26,251 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:26,251 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] [2020-10-26 04:29:26,253 INFO L794 eck$LassoCheckResult]: Stem: 47921#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); 47892#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_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~cond~0;main_~p1~0 := main_#t~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;havoc main_~cond~0; 47893#L169-1 [2020-10-26 04:29:26,255 INFO L796 eck$LassoCheckResult]: Loop: 47893#L169-1 assume !false;main_~cond~0 := main_#t~nondet18;havoc main_#t~nondet18; 48256#L46 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; 48253#L73 assume !(0 != main_~p1~0); 48249#L73-2 assume !(0 != main_~p2~0); 48246#L77-1 assume !(0 != main_~p3~0); 48242#L81-1 assume !(0 != main_~p4~0); 48238#L85-1 assume !(0 != main_~p5~0); 48236#L89-1 assume !(0 != main_~p6~0); 48234#L93-1 assume !(0 != main_~p7~0); 48231#L97-1 assume !(0 != main_~p8~0); 48228#L101-1 assume !(0 != main_~p9~0); 48222#L105-1 assume !(0 != main_~p10~0); 48223#L109-1 assume !(0 != main_~p11~0); 48301#L113-1 assume !(0 != main_~p1~0); 48297#L119-1 assume !(0 != main_~p2~0); 48294#L124-1 assume !(0 != main_~p3~0); 48290#L129-1 assume !(0 != main_~p4~0); 48203#L134-1 assume !(0 != main_~p5~0); 48194#L139-1 assume !(0 != main_~p6~0); 48131#L144-1 assume !(0 != main_~p7~0); 48133#L149-1 assume !(0 != main_~p8~0); 48120#L154-1 assume !(0 != main_~p9~0); 48121#L159-1 assume !(0 != main_~p10~0); 48261#L164-1 assume !(0 != main_~p11~0); 47893#L169-1 [2020-10-26 04:29:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-26 04:29:26,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:26,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641972678] [2020-10-26 04:29:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2020-10-26 04:29:26,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:26,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678624335] [2020-10-26 04:29:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2020-10-26 04:29:26,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:26,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067799049] [2020-10-26 04:29:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:26,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:26,342 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:26,722 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2020-10-26 04:29:26,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:29:26 BoogieIcfgContainer [2020-10-26 04:29:26,873 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:29:26,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:29:26,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:29:26,874 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:29:26,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:22" (3/4) ... [2020-10-26 04:29:26,878 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:29:26,930 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:29:26,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:29:26,932 INFO L168 Benchmark]: Toolchain (without parser) took 5196.65 ms. Allocated memory was 41.9 MB in the beginning and 289.4 MB in the end (delta: 247.5 MB). Free memory was 28.3 MB in the beginning and 155.3 MB in the end (delta: -127.0 MB). Peak memory consumption was 119.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,932 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.6 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:29:26,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.01 ms. Allocated memory is still 41.9 MB. Free memory was 27.6 MB in the beginning and 19.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.35 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 36.7 MB in the end (delta: -17.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,934 INFO L168 Benchmark]: Boogie Preprocessor took 55.26 ms. Allocated memory is still 52.4 MB. Free memory was 36.7 MB in the beginning and 35.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,935 INFO L168 Benchmark]: RCFGBuilder took 402.08 ms. Allocated memory is still 52.4 MB. Free memory was 35.3 MB in the beginning and 27.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,936 INFO L168 Benchmark]: BuchiAutomizer took 4205.00 ms. Allocated memory was 52.4 MB in the beginning and 289.4 MB in the end (delta: 237.0 MB). Free memory was 27.2 MB in the beginning and 157.3 MB in the end (delta: -130.1 MB). Peak memory consumption was 172.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,936 INFO L168 Benchmark]: Witness Printer took 56.19 ms. Allocated memory is still 289.4 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:26,940 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.6 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 389.01 ms. Allocated memory is still 41.9 MB. Free memory was 27.6 MB in the beginning and 19.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.35 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 36.7 MB in the end (delta: -17.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.26 ms. Allocated memory is still 52.4 MB. Free memory was 36.7 MB in the beginning and 35.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 402.08 ms. Allocated memory is still 52.4 MB. Free memory was 35.3 MB in the beginning and 27.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4205.00 ms. Allocated memory was 52.4 MB in the beginning and 289.4 MB in the end (delta: 237.0 MB). Free memory was 27.2 MB in the beginning and 157.3 MB in the end (delta: -130.1 MB). Peak memory consumption was 172.4 MB. Max. memory is 16.1 GB. * Witness Printer took 56.19 ms. Allocated memory is still 289.4 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 15618 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 796 SDtfs, 411 SDslu, 491 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=4, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26d5a0f7=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@519c6183=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a4d421=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31abc677=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3af20aad=0, p11=0, lk10=0, lk11=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@514355a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b48b2be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14fe1f9=11, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@850f409=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bc63cfe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7431d98f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ebc12c6=0, NULL=0, NULL=0, NULL=0, NULL=3, 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: 44]: 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; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...