./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.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 04dfa849b43716e8587b0fc4953cadbe3968c4e3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:47:11,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:11,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:11,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:11,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:11,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:11,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:11,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:11,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:11,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:11,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:11,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:11,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:11,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:11,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:11,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:11,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:11,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:11,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:11,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:11,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:11,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:11,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:11,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:11,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:11,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:11,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:11,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:11,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:11,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:11,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:11,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:11,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:11,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:11,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:11,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:11,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:11,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:11,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:11,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:11,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:11,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:11,317 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:11,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:11,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:11,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:11,319 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:11,320 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:11,320 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:11,320 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:11,320 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:11,321 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:11,321 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:11,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:11,321 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:11,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:11,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:11,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:11,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:11,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:11,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:11,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:11,323 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:11,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:11,324 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:11,324 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:11,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:11,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:11,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:11,325 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:11,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:11,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:11,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:11,326 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:11,327 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:11,327 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dfa849b43716e8587b0fc4953cadbe3968c4e3 [2020-10-20 06:47:11,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:11,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:11,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:11,542 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:11,542 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:11,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2020-10-20 06:47:11,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aefb552/4efde342f1014a53b9aae91d0c688c6b/FLAG49e3eba82 [2020-10-20 06:47:12,176 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:12,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2020-10-20 06:47:12,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aefb552/4efde342f1014a53b9aae91d0c688c6b/FLAG49e3eba82 [2020-10-20 06:47:12,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aefb552/4efde342f1014a53b9aae91d0c688c6b [2020-10-20 06:47:12,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:12,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:12,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:12,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:12,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:12,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85b4ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12, skipping insertion in model container [2020-10-20 06:47:12,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:12,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:12,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,734 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:12,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:12,796 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:12,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12 WrapperNode [2020-10-20 06:47:12,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:12,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:12,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:12,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:12,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:12,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:12,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... [2020-10-20 06:47:12,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:12,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:12,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:12,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:12,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:47:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:13,361 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:13,362 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:13,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:13 BoogieIcfgContainer [2020-10-20 06:47:13,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:13,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:13,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:13,370 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:13,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:13,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:12" (1/3) ... [2020-10-20 06:47:13,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58d6c598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:13, skipping insertion in model container [2020-10-20 06:47:13,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:13,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:12" (2/3) ... [2020-10-20 06:47:13,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58d6c598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:13, skipping insertion in model container [2020-10-20 06:47:13,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:13,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:13" (3/3) ... [2020-10-20 06:47:13,376 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2020-10-20 06:47:13,427 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:13,427 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:13,428 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:13,428 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:13,429 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:13,429 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:13,429 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:13,429 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:13,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-10-20 06:47:13,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-20 06:47:13,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,494 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,494 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,494 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:13,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states. [2020-10-20 06:47:13,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-20 06:47:13,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:13,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:13,501 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:13,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:13,508 INFO L794 eck$LassoCheckResult]: Stem: 26#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 52#L225-1true [2020-10-20 06:47:13,509 INFO L796 eck$LassoCheckResult]: Loop: 52#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 3#L58true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 36#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 53#L97-1true assume !(0 != main_~p3~0); 56#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 14#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 5#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 8#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 29#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 21#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 41#L129-1true assume !(0 != main_~p11~0); 44#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 38#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 54#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 45#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 50#L149-1true assume !(0 != main_~p1~0); 32#L155-1true assume 0 != main_~p2~0; 27#L161true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 10#L160true assume !(0 != main_~p3~0); 31#L165-1true assume !(0 != main_~p4~0); 39#L170-1true assume !(0 != main_~p5~0); 19#L175-1true assume !(0 != main_~p6~0); 24#L180-1true assume !(0 != main_~p7~0); 55#L185-1true assume !(0 != main_~p8~0); 6#L190-1true assume !(0 != main_~p9~0); 42#L195-1true assume !(0 != main_~p10~0); 47#L200-1true assume !(0 != main_~p11~0); 28#L205-1true assume !(0 != main_~p12~0); 35#L210-1true assume !(0 != main_~p13~0); 12#L215-1true assume 0 != main_~p14~0; 37#L221true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 22#L220true assume !(0 != main_~p15~0); 52#L225-1true [2020-10-20 06:47:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:13,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189273136] [2020-10-20 06:47:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:13,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:13,707 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2020-10-20 06:47:13,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:13,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934064775] [2020-10-20 06:47:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:13,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934064775] [2020-10-20 06:47:13,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:13,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:13,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46002061] [2020-10-20 06:47:13,847 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:13,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:13,869 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2020-10-20 06:47:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:13,945 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2020-10-20 06:47:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:13,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2020-10-20 06:47:13,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-10-20 06:47:13,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2020-10-20 06:47:13,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-10-20 06:47:13,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2020-10-20 06:47:13,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2020-10-20 06:47:13,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:13,965 INFO L691 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-10-20 06:47:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2020-10-20 06:47:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-20 06:47:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 06:47:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2020-10-20 06:47:14,004 INFO L714 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-10-20 06:47:14,004 INFO L594 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2020-10-20 06:47:14,005 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:14,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2020-10-20 06:47:14,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-10-20 06:47:14,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,009 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,009 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,010 INFO L794 eck$LassoCheckResult]: Stem: 200#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 181#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 182#L225-1 [2020-10-20 06:47:14,010 INFO L796 eck$LassoCheckResult]: Loop: 182#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 171#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 172#L93 assume !(0 != main_~p1~0); 226#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 224#L97-1 assume !(0 != main_~p3~0); 225#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 222#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 190#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 173#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 174#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 180#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 198#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 199#L129-1 assume !(0 != main_~p11~0); 215#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 212#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 213#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 219#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 220#L149-1 assume !(0 != main_~p1~0); 229#L155-1 assume 0 != main_~p2~0; 263#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 262#L160 assume !(0 != main_~p3~0); 260#L165-1 assume !(0 != main_~p4~0); 257#L170-1 assume !(0 != main_~p5~0); 256#L175-1 assume !(0 != main_~p6~0); 254#L180-1 assume !(0 != main_~p7~0); 251#L185-1 assume !(0 != main_~p8~0); 250#L190-1 assume !(0 != main_~p9~0); 216#L195-1 assume !(0 != main_~p10~0); 179#L200-1 assume !(0 != main_~p11~0); 218#L205-1 assume !(0 != main_~p12~0); 209#L210-1 assume !(0 != main_~p13~0); 188#L215-1 assume 0 != main_~p14~0; 189#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 210#L220 assume !(0 != main_~p15~0); 182#L225-1 [2020-10-20 06:47:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:14,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072394315] [2020-10-20 06:47:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2020-10-20 06:47:14,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991626909] [2020-10-20 06:47:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991626909] [2020-10-20 06:47:14,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140391398] [2020-10-20 06:47:14,095 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,096 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-10-20 06:47:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,122 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2020-10-20 06:47:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2020-10-20 06:47:14,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-10-20 06:47:14,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2020-10-20 06:47:14,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-10-20 06:47:14,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2020-10-20 06:47:14,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2020-10-20 06:47:14,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,134 INFO L691 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-10-20 06:47:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2020-10-20 06:47:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-20 06:47:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-20 06:47:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2020-10-20 06:47:14,148 INFO L714 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-10-20 06:47:14,148 INFO L594 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2020-10-20 06:47:14,149 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:14,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2020-10-20 06:47:14,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2020-10-20 06:47:14,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,153 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,153 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,154 INFO L794 eck$LassoCheckResult]: Stem: 487#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 468#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 469#L225-1 [2020-10-20 06:47:14,154 INFO L796 eck$LassoCheckResult]: Loop: 469#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 558#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 555#L93 assume !(0 != main_~p1~0); 552#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 510#L97-1 assume !(0 != main_~p3~0); 511#L101-1 assume !(0 != main_~p4~0); 548#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 637#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 636#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 635#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 632#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 629#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 626#L129-1 assume !(0 != main_~p11~0); 625#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 624#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 623#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 621#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 620#L149-1 assume !(0 != main_~p1~0); 493#L155-1 assume 0 != main_~p2~0; 494#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 520#L160 assume !(0 != main_~p3~0); 516#L165-1 assume !(0 != main_~p4~0); 517#L170-1 assume !(0 != main_~p5~0); 619#L175-1 assume !(0 != main_~p6~0); 617#L180-1 assume !(0 != main_~p7~0); 614#L185-1 assume !(0 != main_~p8~0); 613#L190-1 assume !(0 != main_~p9~0); 590#L195-1 assume !(0 != main_~p10~0); 588#L200-1 assume !(0 != main_~p11~0); 586#L205-1 assume !(0 != main_~p12~0); 575#L210-1 assume !(0 != main_~p13~0); 571#L215-1 assume 0 != main_~p14~0; 569#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 565#L220 assume !(0 != main_~p15~0); 469#L225-1 [2020-10-20 06:47:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:14,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049263864] [2020-10-20 06:47:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,219 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2020-10-20 06:47:14,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714699765] [2020-10-20 06:47:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714699765] [2020-10-20 06:47:14,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243609583] [2020-10-20 06:47:14,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,269 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand 3 states. [2020-10-20 06:47:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,294 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2020-10-20 06:47:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2020-10-20 06:47:14,300 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-10-20 06:47:14,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2020-10-20 06:47:14,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2020-10-20 06:47:14,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2020-10-20 06:47:14,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2020-10-20 06:47:14,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,309 INFO L691 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-10-20 06:47:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2020-10-20 06:47:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2020-10-20 06:47:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-10-20 06:47:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2020-10-20 06:47:14,331 INFO L714 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-10-20 06:47:14,331 INFO L594 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2020-10-20 06:47:14,331 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:14,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2020-10-20 06:47:14,334 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2020-10-20 06:47:14,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,336 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,336 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,336 INFO L794 eck$LassoCheckResult]: Stem: 1047#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1026#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1027#L225-1 [2020-10-20 06:47:14,337 INFO L796 eck$LassoCheckResult]: Loop: 1027#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1151#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1149#L93 assume !(0 != main_~p1~0); 1147#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1145#L97-1 assume !(0 != main_~p3~0); 1118#L101-1 assume !(0 != main_~p4~0); 1119#L105-1 assume !(0 != main_~p5~0); 1375#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1373#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1370#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1368#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1044#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1045#L129-1 assume !(0 != main_~p11~0); 1309#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1306#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1303#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1301#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1298#L149-1 assume !(0 != main_~p1~0); 1295#L155-1 assume 0 != main_~p2~0; 1292#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1288#L160 assume !(0 != main_~p3~0); 1284#L165-1 assume !(0 != main_~p4~0); 1281#L170-1 assume !(0 != main_~p5~0); 1277#L175-1 assume !(0 != main_~p6~0); 1263#L180-1 assume !(0 != main_~p7~0); 1257#L185-1 assume !(0 != main_~p8~0); 1216#L190-1 assume !(0 != main_~p9~0); 1192#L195-1 assume !(0 != main_~p10~0); 1190#L200-1 assume !(0 != main_~p11~0); 1188#L205-1 assume !(0 != main_~p12~0); 1186#L210-1 assume !(0 != main_~p13~0); 1182#L215-1 assume 0 != main_~p14~0; 1180#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1156#L220 assume !(0 != main_~p15~0); 1027#L225-1 [2020-10-20 06:47:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:14,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936113820] [2020-10-20 06:47:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2020-10-20 06:47:14,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948352657] [2020-10-20 06:47:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948352657] [2020-10-20 06:47:14,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925890712] [2020-10-20 06:47:14,406 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,407 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-10-20 06:47:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,429 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2020-10-20 06:47:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2020-10-20 06:47:14,438 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-10-20 06:47:14,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2020-10-20 06:47:14,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2020-10-20 06:47:14,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2020-10-20 06:47:14,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2020-10-20 06:47:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,450 INFO L691 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-10-20 06:47:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2020-10-20 06:47:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2020-10-20 06:47:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-10-20 06:47:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2020-10-20 06:47:14,479 INFO L714 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-10-20 06:47:14,480 INFO L594 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2020-10-20 06:47:14,480 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:14,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2020-10-20 06:47:14,486 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2020-10-20 06:47:14,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,490 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,492 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,495 INFO L794 eck$LassoCheckResult]: Stem: 2140#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2120#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2121#L225-1 [2020-10-20 06:47:14,496 INFO L796 eck$LassoCheckResult]: Loop: 2121#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2302#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2299#L93 assume !(0 != main_~p1~0); 2297#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2295#L97-1 assume !(0 != main_~p3~0); 2230#L101-1 assume !(0 != main_~p4~0); 2231#L105-1 assume !(0 != main_~p5~0); 2378#L109-1 assume !(0 != main_~p6~0); 2376#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2374#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2371#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2369#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2367#L129-1 assume !(0 != main_~p11~0); 2365#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2364#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2362#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2360#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2357#L149-1 assume !(0 != main_~p1~0); 2354#L155-1 assume 0 != main_~p2~0; 2351#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2348#L160 assume !(0 != main_~p3~0); 2343#L165-1 assume !(0 != main_~p4~0); 2339#L170-1 assume !(0 != main_~p5~0); 2335#L175-1 assume !(0 != main_~p6~0); 2332#L180-1 assume !(0 != main_~p7~0); 2328#L185-1 assume !(0 != main_~p8~0); 2326#L190-1 assume !(0 != main_~p9~0); 2322#L195-1 assume !(0 != main_~p10~0); 2319#L200-1 assume !(0 != main_~p11~0); 2316#L205-1 assume !(0 != main_~p12~0); 2313#L210-1 assume !(0 != main_~p13~0); 2311#L215-1 assume 0 != main_~p14~0; 2309#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2306#L220 assume !(0 != main_~p15~0); 2121#L225-1 [2020-10-20 06:47:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:14,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814701891] [2020-10-20 06:47:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2020-10-20 06:47:14,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470461774] [2020-10-20 06:47:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470461774] [2020-10-20 06:47:14,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657202551] [2020-10-20 06:47:14,604 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,606 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand 3 states. [2020-10-20 06:47:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,641 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2020-10-20 06:47:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2020-10-20 06:47:14,658 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-10-20 06:47:14,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2020-10-20 06:47:14,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2020-10-20 06:47:14,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2020-10-20 06:47:14,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2020-10-20 06:47:14,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,675 INFO L691 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-10-20 06:47:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2020-10-20 06:47:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2020-10-20 06:47:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2020-10-20 06:47:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2020-10-20 06:47:14,704 INFO L714 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-10-20 06:47:14,705 INFO L594 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2020-10-20 06:47:14,705 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:14,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2020-10-20 06:47:14,714 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2020-10-20 06:47:14,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:14,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:14,715 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:14,716 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:14,716 INFO L794 eck$LassoCheckResult]: Stem: 4293#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4274#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4275#L225-1 [2020-10-20 06:47:14,716 INFO L796 eck$LassoCheckResult]: Loop: 4275#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4708#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4700#L93 assume !(0 != main_~p1~0); 4701#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4689#L97-1 assume !(0 != main_~p3~0); 4690#L101-1 assume !(0 != main_~p4~0); 4679#L105-1 assume !(0 != main_~p5~0); 4681#L109-1 assume !(0 != main_~p6~0); 4776#L113-1 assume !(0 != main_~p7~0); 4775#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4774#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4773#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4772#L129-1 assume !(0 != main_~p11~0); 4771#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4770#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4769#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4768#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4765#L149-1 assume !(0 != main_~p1~0); 4764#L155-1 assume 0 != main_~p2~0; 4763#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4761#L160 assume !(0 != main_~p3~0); 4587#L165-1 assume !(0 != main_~p4~0); 4588#L170-1 assume !(0 != main_~p5~0); 4572#L175-1 assume !(0 != main_~p6~0); 4574#L180-1 assume !(0 != main_~p7~0); 4758#L185-1 assume !(0 != main_~p8~0); 4748#L190-1 assume !(0 != main_~p9~0); 4747#L195-1 assume !(0 != main_~p10~0); 4738#L200-1 assume !(0 != main_~p11~0); 4737#L205-1 assume !(0 != main_~p12~0); 4727#L210-1 assume !(0 != main_~p13~0); 4726#L215-1 assume 0 != main_~p14~0; 4716#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4717#L220 assume !(0 != main_~p15~0); 4275#L225-1 [2020-10-20 06:47:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:14,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146702263] [2020-10-20 06:47:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:14,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:14,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2020-10-20 06:47:14,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:14,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752735223] [2020-10-20 06:47:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:14,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752735223] [2020-10-20 06:47:14,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:14,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:14,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967491048] [2020-10-20 06:47:14,846 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:14,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:14,848 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand 3 states. [2020-10-20 06:47:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:14,887 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2020-10-20 06:47:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:14,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2020-10-20 06:47:14,919 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-10-20 06:47:14,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2020-10-20 06:47:14,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2020-10-20 06:47:14,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2020-10-20 06:47:14,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2020-10-20 06:47:14,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:14,950 INFO L691 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-10-20 06:47:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2020-10-20 06:47:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2020-10-20 06:47:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-10-20 06:47:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2020-10-20 06:47:15,040 INFO L714 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-10-20 06:47:15,040 INFO L594 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2020-10-20 06:47:15,040 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:47:15,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2020-10-20 06:47:15,062 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2020-10-20 06:47:15,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,067 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,067 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,068 INFO L794 eck$LassoCheckResult]: Stem: 8545#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8524#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8525#L225-1 [2020-10-20 06:47:15,069 INFO L796 eck$LassoCheckResult]: Loop: 8525#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8885#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8881#L93 assume !(0 != main_~p1~0); 8878#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8876#L97-1 assume !(0 != main_~p3~0); 8665#L101-1 assume !(0 != main_~p4~0); 8666#L105-1 assume !(0 != main_~p5~0); 9038#L109-1 assume !(0 != main_~p6~0); 9032#L113-1 assume !(0 != main_~p7~0); 9025#L117-1 assume !(0 != main_~p8~0); 9018#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 9012#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 9006#L129-1 assume !(0 != main_~p11~0); 8986#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8984#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8982#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8979#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8950#L149-1 assume !(0 != main_~p1~0); 8948#L155-1 assume 0 != main_~p2~0; 8947#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8946#L160 assume !(0 != main_~p3~0); 8932#L165-1 assume !(0 != main_~p4~0); 8933#L170-1 assume !(0 != main_~p5~0); 8943#L175-1 assume !(0 != main_~p6~0); 8935#L180-1 assume !(0 != main_~p7~0); 8926#L185-1 assume !(0 != main_~p8~0); 8921#L190-1 assume !(0 != main_~p9~0); 8914#L195-1 assume !(0 != main_~p10~0); 8907#L200-1 assume !(0 != main_~p11~0); 8903#L205-1 assume !(0 != main_~p12~0); 8900#L210-1 assume !(0 != main_~p13~0); 8897#L215-1 assume 0 != main_~p14~0; 8894#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8891#L220 assume !(0 != main_~p15~0); 8525#L225-1 [2020-10-20 06:47:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-20 06:47:15,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375430286] [2020-10-20 06:47:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2020-10-20 06:47:15,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122008129] [2020-10-20 06:47:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:15,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122008129] [2020-10-20 06:47:15,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114456203] [2020-10-20 06:47:15,153 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,157 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2020-10-20 06:47:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,372 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2020-10-20 06:47:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2020-10-20 06:47:15,417 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-10-20 06:47:15,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2020-10-20 06:47:15,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2020-10-20 06:47:15,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2020-10-20 06:47:15,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2020-10-20 06:47:15,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,470 INFO L691 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-10-20 06:47:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2020-10-20 06:47:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2020-10-20 06:47:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2020-10-20 06:47:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2020-10-20 06:47:15,635 INFO L714 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-10-20 06:47:15,635 INFO L594 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2020-10-20 06:47:15,636 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:47:15,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2020-10-20 06:47:15,659 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2020-10-20 06:47:15,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,660 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,660 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,661 INFO L794 eck$LassoCheckResult]: Stem: 16939#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16918#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16919#L225-1 [2020-10-20 06:47:15,661 INFO L796 eck$LassoCheckResult]: Loop: 16919#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17064#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17062#L93 assume !(0 != main_~p1~0); 17060#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17058#L97-1 assume !(0 != main_~p3~0); 17054#L101-1 assume !(0 != main_~p4~0); 17050#L105-1 assume !(0 != main_~p5~0); 17046#L109-1 assume !(0 != main_~p6~0); 17042#L113-1 assume !(0 != main_~p7~0); 17038#L117-1 assume !(0 != main_~p8~0); 17034#L121-1 assume !(0 != main_~p9~0); 17032#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17030#L129-1 assume !(0 != main_~p11~0); 17028#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17026#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17024#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17022#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17020#L149-1 assume !(0 != main_~p1~0); 17014#L155-1 assume 0 != main_~p2~0; 17015#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17006#L160 assume !(0 != main_~p3~0); 17005#L165-1 assume !(0 != main_~p4~0); 17107#L170-1 assume !(0 != main_~p5~0); 17103#L175-1 assume !(0 != main_~p6~0); 17099#L180-1 assume !(0 != main_~p7~0); 17095#L185-1 assume !(0 != main_~p8~0); 17091#L190-1 assume !(0 != main_~p9~0); 17088#L195-1 assume !(0 != main_~p10~0); 17084#L200-1 assume !(0 != main_~p11~0); 17080#L205-1 assume !(0 != main_~p12~0); 17076#L210-1 assume !(0 != main_~p13~0); 17073#L215-1 assume 0 != main_~p14~0; 17071#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17068#L220 assume !(0 != main_~p15~0); 16919#L225-1 [2020-10-20 06:47:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-20 06:47:15,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444053754] [2020-10-20 06:47:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2020-10-20 06:47:15,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426156256] [2020-10-20 06:47:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:15,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426156256] [2020-10-20 06:47:15,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683097853] [2020-10-20 06:47:15,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,706 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2020-10-20 06:47:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,796 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2020-10-20 06:47:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2020-10-20 06:47:15,859 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-10-20 06:47:16,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2020-10-20 06:47:16,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2020-10-20 06:47:16,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2020-10-20 06:47:16,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2020-10-20 06:47:16,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,236 INFO L691 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-10-20 06:47:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2020-10-20 06:47:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2020-10-20 06:47:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11010 states. [2020-10-20 06:47:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2020-10-20 06:47:16,512 INFO L714 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-10-20 06:47:16,512 INFO L594 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2020-10-20 06:47:16,512 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:47:16,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2020-10-20 06:47:16,636 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2020-10-20 06:47:16,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:16,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:16,637 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:16,637 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:16,638 INFO L794 eck$LassoCheckResult]: Stem: 33524#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33504#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33505#L225-1 [2020-10-20 06:47:16,638 INFO L796 eck$LassoCheckResult]: Loop: 33505#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33661#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33659#L93 assume !(0 != main_~p1~0); 33657#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33655#L97-1 assume !(0 != main_~p3~0); 33651#L101-1 assume !(0 != main_~p4~0); 33647#L105-1 assume !(0 != main_~p5~0); 33643#L109-1 assume !(0 != main_~p6~0); 33639#L113-1 assume !(0 != main_~p7~0); 33635#L117-1 assume !(0 != main_~p8~0); 33631#L121-1 assume !(0 != main_~p9~0); 33627#L125-1 assume !(0 != main_~p10~0); 33625#L129-1 assume !(0 != main_~p11~0); 33623#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33621#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33619#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33617#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33615#L149-1 assume !(0 != main_~p1~0); 33610#L155-1 assume 0 != main_~p2~0; 33607#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33603#L160 assume !(0 != main_~p3~0); 33602#L165-1 assume !(0 != main_~p4~0); 33704#L170-1 assume !(0 != main_~p5~0); 33700#L175-1 assume !(0 != main_~p6~0); 33696#L180-1 assume !(0 != main_~p7~0); 33692#L185-1 assume !(0 != main_~p8~0); 33688#L190-1 assume !(0 != main_~p9~0); 33684#L195-1 assume !(0 != main_~p10~0); 33681#L200-1 assume !(0 != main_~p11~0); 33677#L205-1 assume !(0 != main_~p12~0); 33673#L210-1 assume !(0 != main_~p13~0); 33670#L215-1 assume 0 != main_~p14~0; 33668#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33665#L220 assume !(0 != main_~p15~0); 33505#L225-1 [2020-10-20 06:47:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-20 06:47:16,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992508121] [2020-10-20 06:47:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,676 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,677 INFO L82 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2020-10-20 06:47:16,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425259742] [2020-10-20 06:47:16,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:16,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425259742] [2020-10-20 06:47:16,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:16,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:16,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920625445] [2020-10-20 06:47:16,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:16,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:16,712 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2020-10-20 06:47:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:17,189 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2020-10-20 06:47:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:17,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2020-10-20 06:47:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-10-20 06:47:17,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2020-10-20 06:47:17,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2020-10-20 06:47:17,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2020-10-20 06:47:17,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2020-10-20 06:47:17,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:17,580 INFO L691 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-10-20 06:47:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2020-10-20 06:47:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2020-10-20 06:47:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21762 states. [2020-10-20 06:47:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2020-10-20 06:47:18,313 INFO L714 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-10-20 06:47:18,313 INFO L594 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2020-10-20 06:47:18,313 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:47:18,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2020-10-20 06:47:18,384 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2020-10-20 06:47:18,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:18,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:18,386 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:18,386 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:18,387 INFO L794 eck$LassoCheckResult]: Stem: 66301#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66281#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66282#L225-1 [2020-10-20 06:47:18,387 INFO L796 eck$LassoCheckResult]: Loop: 66282#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66478#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66474#L93 assume !(0 != main_~p1~0); 66470#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66466#L97-1 assume !(0 != main_~p3~0); 66459#L101-1 assume !(0 != main_~p4~0); 66451#L105-1 assume !(0 != main_~p5~0); 66443#L109-1 assume !(0 != main_~p6~0); 66435#L113-1 assume !(0 != main_~p7~0); 66427#L117-1 assume !(0 != main_~p8~0); 66419#L121-1 assume !(0 != main_~p9~0); 66411#L125-1 assume !(0 != main_~p10~0); 66406#L129-1 assume !(0 != main_~p11~0); 66400#L133-1 assume !(0 != main_~p12~0); 66401#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66391#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66392#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66383#L149-1 assume !(0 != main_~p1~0); 66384#L155-1 assume 0 != main_~p2~0; 66375#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66376#L160 assume !(0 != main_~p3~0); 66577#L165-1 assume !(0 != main_~p4~0); 66573#L170-1 assume !(0 != main_~p5~0); 66569#L175-1 assume !(0 != main_~p6~0); 66548#L180-1 assume !(0 != main_~p7~0); 66540#L185-1 assume !(0 != main_~p8~0); 66532#L190-1 assume !(0 != main_~p9~0); 66525#L195-1 assume !(0 != main_~p10~0); 66519#L200-1 assume !(0 != main_~p11~0); 66516#L205-1 assume !(0 != main_~p12~0); 66515#L210-1 assume !(0 != main_~p13~0); 66513#L215-1 assume 0 != main_~p14~0; 66490#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66487#L220 assume !(0 != main_~p15~0); 66282#L225-1 [2020-10-20 06:47:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-20 06:47:18,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:18,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226185651] [2020-10-20 06:47:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:18,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:18,404 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:18,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2020-10-20 06:47:18,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:18,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670255240] [2020-10-20 06:47:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:18,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670255240] [2020-10-20 06:47:18,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:18,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:18,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534786767] [2020-10-20 06:47:18,756 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:18,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:18,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:18,756 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2020-10-20 06:47:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:18,923 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2020-10-20 06:47:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:18,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2020-10-20 06:47:19,586 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-10-20 06:47:19,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2020-10-20 06:47:19,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2020-10-20 06:47:19,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2020-10-20 06:47:19,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2020-10-20 06:47:19,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:19,871 INFO L691 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-10-20 06:47:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2020-10-20 06:47:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2020-10-20 06:47:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43010 states. [2020-10-20 06:47:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2020-10-20 06:47:21,439 INFO L714 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-10-20 06:47:21,439 INFO L594 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2020-10-20 06:47:21,439 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:47:21,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2020-10-20 06:47:22,052 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2020-10-20 06:47:22,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:22,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:22,053 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:22,053 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:22,054 INFO L794 eck$LassoCheckResult]: Stem: 131080#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131059#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131060#L225-1 [2020-10-20 06:47:22,054 INFO L796 eck$LassoCheckResult]: Loop: 131060#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131338#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131335#L93 assume !(0 != main_~p1~0); 131331#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131327#L97-1 assume !(0 != main_~p3~0); 131296#L101-1 assume !(0 != main_~p4~0); 131292#L105-1 assume !(0 != main_~p5~0); 131288#L109-1 assume !(0 != main_~p6~0); 131284#L113-1 assume !(0 != main_~p7~0); 131281#L117-1 assume !(0 != main_~p8~0); 131197#L121-1 assume !(0 != main_~p9~0); 131193#L125-1 assume !(0 != main_~p10~0); 131180#L129-1 assume !(0 != main_~p11~0); 131181#L133-1 assume !(0 != main_~p12~0); 131458#L137-1 assume !(0 != main_~p13~0); 131459#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131577#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131574#L149-1 assume !(0 != main_~p1~0); 131571#L155-1 assume 0 != main_~p2~0; 131569#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131564#L160 assume !(0 != main_~p3~0); 131556#L165-1 assume !(0 != main_~p4~0); 131548#L170-1 assume !(0 != main_~p5~0); 131543#L175-1 assume !(0 != main_~p6~0); 131538#L180-1 assume !(0 != main_~p7~0); 131534#L185-1 assume !(0 != main_~p8~0); 131509#L190-1 assume !(0 != main_~p9~0); 131364#L195-1 assume !(0 != main_~p10~0); 131359#L200-1 assume !(0 != main_~p11~0); 131351#L205-1 assume !(0 != main_~p12~0); 131348#L210-1 assume !(0 != main_~p13~0); 131347#L215-1 assume 0 != main_~p14~0; 131345#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131343#L220 assume !(0 != main_~p15~0); 131060#L225-1 [2020-10-20 06:47:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-20 06:47:22,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672390577] [2020-10-20 06:47:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:22,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:22,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2020-10-20 06:47:22,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:22,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389013495] [2020-10-20 06:47:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:47:22,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389013495] [2020-10-20 06:47:22,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:22,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:22,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732842543] [2020-10-20 06:47:22,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:22,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:22,111 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2020-10-20 06:47:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:22,538 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2020-10-20 06:47:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:22,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2020-10-20 06:47:23,951 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-10-20 06:47:24,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2020-10-20 06:47:24,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2020-10-20 06:47:24,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2020-10-20 06:47:24,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2020-10-20 06:47:24,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:24,444 INFO L691 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-10-20 06:47:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2020-10-20 06:47:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2020-10-20 06:47:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84994 states. [2020-10-20 06:47:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2020-10-20 06:47:28,158 INFO L714 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-10-20 06:47:28,158 INFO L594 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2020-10-20 06:47:28,158 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:47:28,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2020-10-20 06:47:28,493 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2020-10-20 06:47:28,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:28,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:28,495 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:28,495 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:28,495 INFO L794 eck$LassoCheckResult]: Stem: 259091#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259070#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259071#L225-1 [2020-10-20 06:47:28,495 INFO L796 eck$LassoCheckResult]: Loop: 259071#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 259493#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 259491#L93 assume !(0 != main_~p1~0); 259490#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259488#L97-1 assume !(0 != main_~p3~0); 259485#L101-1 assume !(0 != main_~p4~0); 259481#L105-1 assume !(0 != main_~p5~0); 259477#L109-1 assume !(0 != main_~p6~0); 259473#L113-1 assume !(0 != main_~p7~0); 259469#L117-1 assume !(0 != main_~p8~0); 259465#L121-1 assume !(0 != main_~p9~0); 259461#L125-1 assume !(0 != main_~p10~0); 259458#L129-1 assume !(0 != main_~p11~0); 259455#L133-1 assume !(0 != main_~p12~0); 259451#L137-1 assume !(0 != main_~p13~0); 259448#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259445#L145-1 assume !(0 != main_~p15~0); 259446#L149-1 assume !(0 != main_~p1~0); 259545#L155-1 assume 0 != main_~p2~0; 259543#L161 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259540#L160 assume !(0 != main_~p3~0); 259535#L165-1 assume !(0 != main_~p4~0); 259531#L170-1 assume !(0 != main_~p5~0); 259527#L175-1 assume !(0 != main_~p6~0); 259523#L180-1 assume !(0 != main_~p7~0); 259519#L185-1 assume !(0 != main_~p8~0); 259515#L190-1 assume !(0 != main_~p9~0); 259511#L195-1 assume !(0 != main_~p10~0); 259508#L200-1 assume !(0 != main_~p11~0); 259504#L205-1 assume !(0 != main_~p12~0); 259500#L210-1 assume !(0 != main_~p13~0); 259498#L215-1 assume 0 != main_~p14~0; 259496#L221 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259494#L220 assume !(0 != main_~p15~0); 259071#L225-1 [2020-10-20 06:47:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-10-20 06:47:28,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:28,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397012563] [2020-10-20 06:47:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:28,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2020-10-20 06:47:28,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:28,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891422176] [2020-10-20 06:47:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2020-10-20 06:47:28,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:28,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028190322] [2020-10-20 06:47:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:28,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:28,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:28,925 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-20 06:47:29,058 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-20 06:47:30,390 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-10-20 06:47:30,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:30 BoogieIcfgContainer [2020-10-20 06:47:30,502 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:30,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:30,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:30,503 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:30,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:13" (3/4) ... [2020-10-20 06:47:30,508 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:30,569 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:30,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:30,571 INFO L168 Benchmark]: Toolchain (without parser) took 18088.36 ms. Allocated memory was 41.4 MB in the beginning and 503.8 MB in the end (delta: 462.4 MB). Free memory was 22.8 MB in the beginning and 324.7 MB in the end (delta: -301.9 MB). Peak memory consumption was 160.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,571 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 32.5 MB. Free memory was 11.2 MB in the beginning and 11.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 52.8 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.17 ms. Allocated memory was 41.4 MB in the beginning and 42.5 MB in the end (delta: 1.0 MB). Free memory was 21.9 MB in the beginning and 24.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.35 ms. Allocated memory is still 42.5 MB. Free memory was 24.3 MB in the beginning and 22.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,573 INFO L168 Benchmark]: Boogie Preprocessor took 31.86 ms. Allocated memory is still 42.5 MB. Free memory was 22.2 MB in the beginning and 20.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,573 INFO L168 Benchmark]: RCFGBuilder took 483.91 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 20.5 MB in the beginning and 13.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,574 INFO L168 Benchmark]: BuchiAutomizer took 17137.58 ms. Allocated memory was 44.6 MB in the beginning and 503.8 MB in the end (delta: 459.3 MB). Free memory was 13.7 MB in the beginning and 328.1 MB in the end (delta: -314.4 MB). Peak memory consumption was 536.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,574 INFO L168 Benchmark]: Witness Printer took 66.36 ms. Allocated memory is still 503.8 MB. Free memory was 328.1 MB in the beginning and 324.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:30,577 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.28 ms. Allocated memory is still 32.5 MB. Free memory was 11.2 MB in the beginning and 11.1 MB in the end (delta: 52.8 kB). Peak memory consumption was 52.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 310.17 ms. Allocated memory was 41.4 MB in the beginning and 42.5 MB in the end (delta: 1.0 MB). Free memory was 21.9 MB in the beginning and 24.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 48.35 ms. Allocated memory is still 42.5 MB. Free memory was 24.3 MB in the beginning and 22.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.86 ms. Allocated memory is still 42.5 MB. Free memory was 22.2 MB in the beginning and 20.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 483.91 ms. Allocated memory was 42.5 MB in the beginning and 44.6 MB in the end (delta: 2.1 MB). Free memory was 20.5 MB in the beginning and 13.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 17137.58 ms. Allocated memory was 44.6 MB in the beginning and 503.8 MB in the end (delta: 459.3 MB). Free memory was 13.7 MB in the beginning and 328.1 MB in the end (delta: -314.4 MB). Peak memory consumption was 536.1 MB. Max. memory is 14.3 GB. * Witness Printer took 66.36 ms. Allocated memory is still 503.8 MB. Free memory was 328.1 MB in the beginning and 324.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 6.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.5s Buchi closure took 0.1s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1271 SDtfs, 648 SDslu, 801 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=16674} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=16674, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43926ed5=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32348fb6=0, p14=15, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d5d250e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b786d00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c821086=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76a46701=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78653462=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aa1804d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a15b30a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c4adec1=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=16675, \result=0, p2=14, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4766d63f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1eaa9624=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ddfed3e=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=13, NULL=16676, NULL=0, NULL=16677, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@225498e=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a6d24a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2697194c=13, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...