./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i -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 8e693e301fe03afa61a3f7e2110361a5e60df7f9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 15:21:52,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 15:21:52,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 15:21:52,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 15:21:52,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 15:21:52,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 15:21:52,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 15:21:52,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 15:21:52,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 15:21:52,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 15:21:52,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 15:21:52,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 15:21:52,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 15:21:52,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 15:21:52,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 15:21:52,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 15:21:52,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 15:21:52,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 15:21:52,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 15:21:52,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 15:21:52,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 15:21:52,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 15:21:52,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 15:21:52,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 15:21:52,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 15:21:52,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 15:21:52,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 15:21:52,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 15:21:52,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 15:21:52,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 15:21:52,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 15:21:52,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 15:21:52,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 15:21:52,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 15:21:52,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 15:21:52,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 15:21:52,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 15:21:52,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 15:21:52,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 15:21:52,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 15:21:52,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 15:21:52,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 15:21:52,109 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 15:21:52,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 15:21:52,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 15:21:52,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 15:21:52,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 15:21:52,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 15:21:52,111 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 15:21:52,111 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 15:21:52,111 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 15:21:52,111 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 15:21:52,112 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 15:21:52,112 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 15:21:52,112 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 15:21:52,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 15:21:52,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 15:21:52,125 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 15:21:52,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 15:21:52,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 15:21:52,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 15:21:52,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 15:21:52,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 15:21:52,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 15:21:52,127 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 15:21:52,127 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e693e301fe03afa61a3f7e2110361a5e60df7f9 [2021-08-27 15:21:52,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 15:21:52,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 15:21:52,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 15:21:52,401 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 15:21:52,401 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 15:21:52,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2021-08-27 15:21:52,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e584fc1a/6ddc95ecdd074fa7be63ada3cbda8a80/FLAGfaf6ddcb3 [2021-08-27 15:21:52,813 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 15:21:52,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2021-08-27 15:21:52,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e584fc1a/6ddc95ecdd074fa7be63ada3cbda8a80/FLAGfaf6ddcb3 [2021-08-27 15:21:52,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e584fc1a/6ddc95ecdd074fa7be63ada3cbda8a80 [2021-08-27 15:21:52,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 15:21:52,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 15:21:52,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 15:21:52,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 15:21:52,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 15:21:52,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:21:52" (1/1) ... [2021-08-27 15:21:52,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffb6f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:52, skipping insertion in model container [2021-08-27 15:21:52,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:21:52" (1/1) ... [2021-08-27 15:21:52,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 15:21:52,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 15:21:52,979 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2021-08-27 15:21:52,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:21:53,001 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 15:21:53,009 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2021-08-27 15:21:53,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:21:53,019 INFO L208 MainTranslator]: Completed translation [2021-08-27 15:21:53,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53 WrapperNode [2021-08-27 15:21:53,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 15:21:53,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 15:21:53,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 15:21:53,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 15:21:53,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 15:21:53,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 15:21:53,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 15:21:53,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 15:21:53,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 15:21:53,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 15:21:53,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 15:21:53,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 15:21:53,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (1/1) ... [2021-08-27 15:21:53,113 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:53,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:53,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 15:21:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 15:21:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 15:21:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 15:21:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 15:21:53,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 15:21:53,369 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-27 15:21:53,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:21:53 BoogieIcfgContainer [2021-08-27 15:21:53,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 15:21:53,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 15:21:53,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 15:21:53,374 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 15:21:53,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:21:53,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 03:21:52" (1/3) ... [2021-08-27 15:21:53,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b82b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:21:53, skipping insertion in model container [2021-08-27 15:21:53,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:21:53,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:21:53" (2/3) ... [2021-08-27 15:21:53,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b82b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:21:53, skipping insertion in model container [2021-08-27 15:21:53,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:21:53,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:21:53" (3/3) ... [2021-08-27 15:21:53,392 INFO L389 chiAutomizerObserver]: Analyzing ICFG id_build.i [2021-08-27 15:21:53,443 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 15:21:53,443 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 15:21:53,443 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 15:21:53,443 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 15:21:53,444 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 15:21:53,444 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 15:21:53,444 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 15:21:53,444 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 15:21:53,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-27 15:21:53,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:53,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:53,470 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:53,470 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:21:53,470 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 15:21:53,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-08-27 15:21:53,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:53,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:53,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:53,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:21:53,476 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 9#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 15#L27-3true [2021-08-27 15:21:53,476 INFO L793 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 8#L28-2true assume !(main_~j~0 < 8); 11#L27-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L27-3true [2021-08-27 15:21:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 15:21:53,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161268511] [2021-08-27 15:21:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,539 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash 39940, now seen corresponding path program 1 times [2021-08-27 15:21:53,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781682907] [2021-08-27 15:21:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:53,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:53,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781682907] [2021-08-27 15:21:53,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781682907] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:21:53,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:21:53,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 15:21:53,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643624413] [2021-08-27 15:21:53,632 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:53,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:21:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:21:53,644 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:53,668 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-08-27 15:21:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:21:53,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2021-08-27 15:21:53,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-08-27 15:21:53,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 15 transitions. [2021-08-27 15:21:53,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-27 15:21:53,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-27 15:21:53,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-08-27 15:21:53,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:53,677 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-27 15:21:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-08-27 15:21:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2021-08-27 15:21:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 15:21:53,694 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 15:21:53,694 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 15:21:53,694 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 15:21:53,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-08-27 15:21:53,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-08-27 15:21:53,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:53,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:53,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:53,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:21:53,697 INFO L791 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 49#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 53#L27-3 [2021-08-27 15:21:53,697 INFO L793 eck$LassoCheckResult]: Loop: 53#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 54#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 46#L18 assume !(0 == __VERIFIER_assert_~cond); 47#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 50#L18-3 assume !(0 == __VERIFIER_assert_~cond); 51#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 52#L28-2 assume !(main_~j~0 < 8); 55#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 53#L27-3 [2021-08-27 15:21:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 15:21:53,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978415787] [2021-08-27 15:21:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,718 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2021355157, now seen corresponding path program 1 times [2021-08-27 15:21:53,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709724964] [2021-08-27 15:21:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:53,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:53,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709724964] [2021-08-27 15:21:53,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709724964] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:53,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757573264] [2021-08-27 15:21:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:53,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:53,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:53,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 15:21:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:53,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 15:21:53,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:53,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757573264] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:53,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:53,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-08-27 15:21:53,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016752940] [2021-08-27 15:21:53,898 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:53,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 15:21:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 15:21:53,899 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:53,916 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-08-27 15:21:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:21:53,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2021-08-27 15:21:53,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-08-27 15:21:53,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2021-08-27 15:21:53,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 15:21:53,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 15:21:53,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2021-08-27 15:21:53,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:53,918 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-08-27 15:21:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2021-08-27 15:21:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2021-08-27 15:21:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-08-27 15:21:53,920 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 15:21:53,920 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-08-27 15:21:53,920 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 15:21:53,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-08-27 15:21:53,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 15:21:53,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:53,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:53,921 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:53,921 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2021-08-27 15:21:53,921 INFO L791 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 106#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 111#L27-3 [2021-08-27 15:21:53,922 INFO L793 eck$LassoCheckResult]: Loop: 111#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 112#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 117#L18 assume !(0 == __VERIFIER_assert_~cond); 116#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 115#L18-3 assume !(0 == __VERIFIER_assert_~cond); 107#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 108#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 103#L18 assume !(0 == __VERIFIER_assert_~cond); 104#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 109#L18-3 assume !(0 == __VERIFIER_assert_~cond); 110#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 114#L28-2 assume !(main_~j~0 < 8); 113#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 111#L27-3 [2021-08-27 15:21:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 15:21:53,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845460] [2021-08-27 15:21:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,933 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:53,942 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash -51059612, now seen corresponding path program 2 times [2021-08-27 15:21:53,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:53,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343027315] [2021-08-27 15:21:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:53,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:53,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:53,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343027315] [2021-08-27 15:21:53,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343027315] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:53,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066449661] [2021-08-27 15:21:53,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 15:21:53,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:53,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:54,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 15:21:54,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 15:21:54,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:21:54,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:54,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066449661] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:54,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 15:21:54,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563328097] [2021-08-27 15:21:54,144 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:54,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:54,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:21:54,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:21:54,145 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:54,165 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-08-27 15:21:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:21:54,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2021-08-27 15:21:54,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2021-08-27 15:21:54,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2021-08-27 15:21:54,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 15:21:54,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 15:21:54,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2021-08-27 15:21:54,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:54,168 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-08-27 15:21:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2021-08-27 15:21:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-08-27 15:21:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-08-27 15:21:54,170 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-08-27 15:21:54,170 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-08-27 15:21:54,170 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 15:21:54,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2021-08-27 15:21:54,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-08-27 15:21:54,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:54,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:54,171 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:54,171 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 1, 1, 1] [2021-08-27 15:21:54,171 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 189#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 194#L27-3 [2021-08-27 15:21:54,171 INFO L793 eck$LassoCheckResult]: Loop: 194#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 195#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 205#L18 assume !(0 == __VERIFIER_assert_~cond); 204#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 203#L18-3 assume !(0 == __VERIFIER_assert_~cond); 191#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 192#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 186#L18 assume !(0 == __VERIFIER_assert_~cond); 187#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 190#L18-3 assume !(0 == __VERIFIER_assert_~cond); 193#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 202#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 198#L18 assume !(0 == __VERIFIER_assert_~cond); 201#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 200#L18-3 assume !(0 == __VERIFIER_assert_~cond); 199#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 197#L28-2 assume !(main_~j~0 < 8); 196#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 194#L27-3 [2021-08-27 15:21:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 15:21:54,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668186176] [2021-08-27 15:21:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,179 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,184 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 63866123, now seen corresponding path program 3 times [2021-08-27 15:21:54,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029217802] [2021-08-27 15:21:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:54,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029217802] [2021-08-27 15:21:54,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029217802] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526238517] [2021-08-27 15:21:54,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 15:21:54,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:54,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:54,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:54,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 15:21:54,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 15:21:54,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:21:54,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 15:21:54,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526238517] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:54,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-27 15:21:54,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851890370] [2021-08-27 15:21:54,413 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:54,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 15:21:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:21:54,414 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:54,438 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-08-27 15:21:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 15:21:54,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2021-08-27 15:21:54,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-08-27 15:21:54,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2021-08-27 15:21:54,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 15:21:54,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 15:21:54,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2021-08-27 15:21:54,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:54,440 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-08-27 15:21:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2021-08-27 15:21:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-08-27 15:21:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-27 15:21:54,442 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 15:21:54,442 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-27 15:21:54,442 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 15:21:54,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-08-27 15:21:54,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-08-27 15:21:54,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:54,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:54,443 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:54,443 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 1, 1, 1] [2021-08-27 15:21:54,443 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 298#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 303#L27-3 [2021-08-27 15:21:54,443 INFO L793 eck$LassoCheckResult]: Loop: 303#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 304#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 319#L18 assume !(0 == __VERIFIER_assert_~cond); 318#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 317#L18-3 assume !(0 == __VERIFIER_assert_~cond); 300#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 301#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 295#L18 assume !(0 == __VERIFIER_assert_~cond); 296#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 299#L18-3 assume !(0 == __VERIFIER_assert_~cond); 302#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 316#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 315#L18 assume !(0 == __VERIFIER_assert_~cond); 314#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 313#L18-3 assume !(0 == __VERIFIER_assert_~cond); 312#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 311#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 307#L18 assume !(0 == __VERIFIER_assert_~cond); 310#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 309#L18-3 assume !(0 == __VERIFIER_assert_~cond); 308#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 306#L28-2 assume !(main_~j~0 < 8); 305#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 303#L27-3 [2021-08-27 15:21:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 15:21:54,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602137891] [2021-08-27 15:21:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,450 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,455 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2131610428, now seen corresponding path program 4 times [2021-08-27 15:21:54,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683873124] [2021-08-27 15:21:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:54,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683873124] [2021-08-27 15:21:54,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683873124] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179900701] [2021-08-27 15:21:54,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 15:21:54,522 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:54,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:54,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 15:21:54,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 15:21:54,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:21:54,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:21:54,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179900701] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:54,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-08-27 15:21:54,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615732913] [2021-08-27 15:21:54,743 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:54,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 15:21:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 15:21:54,744 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:54,768 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-08-27 15:21:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 15:21:54,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2021-08-27 15:21:54,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-08-27 15:21:54,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2021-08-27 15:21:54,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-27 15:21:54,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-27 15:21:54,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2021-08-27 15:21:54,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:54,775 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-08-27 15:21:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2021-08-27 15:21:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-08-27 15:21:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-08-27 15:21:54,781 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-08-27 15:21:54,781 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-08-27 15:21:54,781 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 15:21:54,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2021-08-27 15:21:54,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2021-08-27 15:21:54,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:54,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:54,787 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:54,787 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 1, 1, 1] [2021-08-27 15:21:54,787 INFO L791 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 433#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 438#L27-3 [2021-08-27 15:21:54,787 INFO L793 eck$LassoCheckResult]: Loop: 438#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 439#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 459#L18 assume !(0 == __VERIFIER_assert_~cond); 458#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 457#L18-3 assume !(0 == __VERIFIER_assert_~cond); 435#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 436#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 430#L18 assume !(0 == __VERIFIER_assert_~cond); 431#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 434#L18-3 assume !(0 == __VERIFIER_assert_~cond); 437#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 456#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 455#L18 assume !(0 == __VERIFIER_assert_~cond); 454#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 453#L18-3 assume !(0 == __VERIFIER_assert_~cond); 452#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 451#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 450#L18 assume !(0 == __VERIFIER_assert_~cond); 449#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 448#L18-3 assume !(0 == __VERIFIER_assert_~cond); 447#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 446#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 442#L18 assume !(0 == __VERIFIER_assert_~cond); 445#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 444#L18-3 assume !(0 == __VERIFIER_assert_~cond); 443#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 441#L28-2 assume !(main_~j~0 < 8); 440#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 438#L27-3 [2021-08-27 15:21:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 15:21:54,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655640005] [2021-08-27 15:21:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,801 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:54,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1653313365, now seen corresponding path program 5 times [2021-08-27 15:21:54,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:54,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301406296] [2021-08-27 15:21:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:54,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:54,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:54,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301406296] [2021-08-27 15:21:54,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301406296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:54,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153780881] [2021-08-27 15:21:54,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 15:21:54,913 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:54,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:54,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:54,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 15:21:54,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 15:21:54,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:21:54,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 15:21:54,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:55,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153780881] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:55,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:55,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-08-27 15:21:55,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844977938] [2021-08-27 15:21:55,052 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:55,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:55,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 15:21:55,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 15:21:55,053 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:55,071 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-08-27 15:21:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 15:21:55,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2021-08-27 15:21:55,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2021-08-27 15:21:55,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 40 transitions. [2021-08-27 15:21:55,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-08-27 15:21:55,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-08-27 15:21:55,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 40 transitions. [2021-08-27 15:21:55,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:55,073 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-08-27 15:21:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 40 transitions. [2021-08-27 15:21:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-08-27 15:21:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-08-27 15:21:55,075 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-08-27 15:21:55,075 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-08-27 15:21:55,075 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 15:21:55,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2021-08-27 15:21:55,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-08-27 15:21:55,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:55,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:55,076 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:55,076 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 1, 1, 1] [2021-08-27 15:21:55,076 INFO L791 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 594#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 599#L27-3 [2021-08-27 15:21:55,076 INFO L793 eck$LassoCheckResult]: Loop: 599#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 600#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 625#L18 assume !(0 == __VERIFIER_assert_~cond); 624#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 623#L18-3 assume !(0 == __VERIFIER_assert_~cond); 596#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 597#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 591#L18 assume !(0 == __VERIFIER_assert_~cond); 592#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 595#L18-3 assume !(0 == __VERIFIER_assert_~cond); 598#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 622#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 621#L18 assume !(0 == __VERIFIER_assert_~cond); 620#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 619#L18-3 assume !(0 == __VERIFIER_assert_~cond); 618#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 617#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 616#L18 assume !(0 == __VERIFIER_assert_~cond); 615#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 614#L18-3 assume !(0 == __VERIFIER_assert_~cond); 613#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 612#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 611#L18 assume !(0 == __VERIFIER_assert_~cond); 610#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 609#L18-3 assume !(0 == __VERIFIER_assert_~cond); 608#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 607#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 603#L18 assume !(0 == __VERIFIER_assert_~cond); 606#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 605#L18-3 assume !(0 == __VERIFIER_assert_~cond); 604#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 602#L28-2 assume !(main_~j~0 < 8); 601#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 599#L27-3 [2021-08-27 15:21:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 15:21:55,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425864630] [2021-08-27 15:21:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,084 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,088 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 978226468, now seen corresponding path program 6 times [2021-08-27 15:21:55,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425564889] [2021-08-27 15:21:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:55,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:55,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425564889] [2021-08-27 15:21:55,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425564889] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:55,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078092195] [2021-08-27 15:21:55,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 15:21:55,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:55,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:55,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:55,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 15:21:55,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 15:21:55,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 15:21:55,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 15:21:55,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:55,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078092195] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:55,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:55,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-08-27 15:21:55,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139479190] [2021-08-27 15:21:55,363 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:55,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 15:21:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 15:21:55,364 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:55,384 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2021-08-27 15:21:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 15:21:55,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2021-08-27 15:21:55,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-08-27 15:21:55,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 45 transitions. [2021-08-27 15:21:55,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-27 15:21:55,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 15:21:55,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 45 transitions. [2021-08-27 15:21:55,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:55,385 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-08-27 15:21:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 45 transitions. [2021-08-27 15:21:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2021-08-27 15:21:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.025) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-08-27 15:21:55,387 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-08-27 15:21:55,387 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-08-27 15:21:55,387 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 15:21:55,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 41 transitions. [2021-08-27 15:21:55,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2021-08-27 15:21:55,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:55,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:55,388 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:55,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 1, 1, 1] [2021-08-27 15:21:55,389 INFO L791 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 781#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 786#L27-3 [2021-08-27 15:21:55,389 INFO L793 eck$LassoCheckResult]: Loop: 786#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 787#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 817#L18 assume !(0 == __VERIFIER_assert_~cond); 816#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 815#L18-3 assume !(0 == __VERIFIER_assert_~cond); 783#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 784#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 778#L18 assume !(0 == __VERIFIER_assert_~cond); 779#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 782#L18-3 assume !(0 == __VERIFIER_assert_~cond); 785#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 814#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 813#L18 assume !(0 == __VERIFIER_assert_~cond); 812#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 811#L18-3 assume !(0 == __VERIFIER_assert_~cond); 810#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 809#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 808#L18 assume !(0 == __VERIFIER_assert_~cond); 807#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 806#L18-3 assume !(0 == __VERIFIER_assert_~cond); 805#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 804#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 803#L18 assume !(0 == __VERIFIER_assert_~cond); 802#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 801#L18-3 assume !(0 == __VERIFIER_assert_~cond); 800#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 799#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 798#L18 assume !(0 == __VERIFIER_assert_~cond); 797#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 796#L18-3 assume !(0 == __VERIFIER_assert_~cond); 795#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 794#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 790#L18 assume !(0 == __VERIFIER_assert_~cond); 793#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 792#L18-3 assume !(0 == __VERIFIER_assert_~cond); 791#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 789#L28-2 assume !(main_~j~0 < 8); 788#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 786#L27-3 [2021-08-27 15:21:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 15:21:55,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830050281] [2021-08-27 15:21:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,394 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 736121931, now seen corresponding path program 7 times [2021-08-27 15:21:55,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54271652] [2021-08-27 15:21:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:55,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:21:55,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54271652] [2021-08-27 15:21:55,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54271652] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:55,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509256971] [2021-08-27 15:21:55,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 15:21:55,482 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:21:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:55,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:21:55,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 15:21:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:55,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 15:21:55,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:55,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509256971] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:21:55,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:21:55,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-08-27 15:21:55,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834190342] [2021-08-27 15:21:55,674 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 15:21:55,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:21:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 15:21:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 15:21:55,674 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:21:55,694 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-08-27 15:21:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 15:21:55,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 46 transitions. [2021-08-27 15:21:55,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-08-27 15:21:55,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 46 transitions. [2021-08-27 15:21:55,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-08-27 15:21:55,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-08-27 15:21:55,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2021-08-27 15:21:55,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:55,696 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-27 15:21:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2021-08-27 15:21:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-08-27 15:21:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-08-27 15:21:55,698 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-27 15:21:55,698 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-27 15:21:55,698 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 15:21:55,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 46 transitions. [2021-08-27 15:21:55,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-08-27 15:21:55,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:55,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:55,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:21:55,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 1, 1, 1] [2021-08-27 15:21:55,700 INFO L791 eck$LassoCheckResult]: Stem: 989#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 990#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 995#L27-3 [2021-08-27 15:21:55,700 INFO L793 eck$LassoCheckResult]: Loop: 995#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 996#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1031#L18 assume !(0 == __VERIFIER_assert_~cond); 1030#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1029#L18-3 assume !(0 == __VERIFIER_assert_~cond); 992#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 993#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 987#L18 assume !(0 == __VERIFIER_assert_~cond); 988#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 991#L18-3 assume !(0 == __VERIFIER_assert_~cond); 994#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1028#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1027#L18 assume !(0 == __VERIFIER_assert_~cond); 1026#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1025#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1024#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1023#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1022#L18 assume !(0 == __VERIFIER_assert_~cond); 1021#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1020#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1019#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1018#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1017#L18 assume !(0 == __VERIFIER_assert_~cond); 1016#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1015#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1014#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1013#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1012#L18 assume !(0 == __VERIFIER_assert_~cond); 1011#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1010#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1009#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1008#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1007#L18 assume !(0 == __VERIFIER_assert_~cond); 1006#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1005#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1004#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1003#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 999#L18 assume !(0 == __VERIFIER_assert_~cond); 1002#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1001#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1000#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 998#L28-2 assume !(main_~j~0 < 8); 997#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 995#L27-3 [2021-08-27 15:21:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 15:21:55,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782079410] [2021-08-27 15:21:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,704 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1675619716, now seen corresponding path program 8 times [2021-08-27 15:21:55,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873985593] [2021-08-27 15:21:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,715 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,724 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -532421502, now seen corresponding path program 1 times [2021-08-27 15:21:55,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:55,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382588836] [2021-08-27 15:21:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:55,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,748 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:55,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:56,179 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:56,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:56,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:56,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:56,179 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 15:21:56,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:56,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:56,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2021-08-27 15:21:56,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:56,180 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:56,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:56,243 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 15:21:56,244 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 15:21:56,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:56,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:56,260 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:56,260 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:56,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-27 15:21:56,301 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 15:21:56,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:56,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:56,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:56,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 15:21:56,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:56,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 15:21:56,440 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 15:21:56,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:56,447 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:56,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:56,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:56,447 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:56,447 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:21:56,447 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,447 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:56,447 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:56,447 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration9_Loop [2021-08-27 15:21:56,447 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:56,447 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:56,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:56,539 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:21:56,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,551 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:56,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:56,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:56,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:56,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:56,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:56,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:56,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:56,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 15:21:56,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:56,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:56,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 15:21:56,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:56,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:56,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:56,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:56,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:56,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:56,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:56,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:56,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:56,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 15:21:56,646 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 15:21:56,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:56,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:56,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:56,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:56,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:56,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:56,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:56,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:56,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:21:56,676 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-27 15:21:56,676 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-27 15:21:56,677 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:56,678 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:56,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 15:21:56,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:21:56,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 15:21:56,681 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:21:56,681 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nlen~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2021-08-27 15:21:56,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:56,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 15:21:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:56,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:21:56,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:56,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:56,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:56,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 15:21:57,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 15:21:57,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 46 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 91 transitions. Complement of second has 4 states. [2021-08-27 15:21:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 15:21:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2021-08-27 15:21:57,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 43 letters. [2021-08-27 15:21:57,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 45 letters. Loop has 43 letters. [2021-08-27 15:21:57,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 86 letters. [2021-08-27 15:21:57,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 91 transitions. [2021-08-27 15:21:57,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 15:21:57,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 90 transitions. [2021-08-27 15:21:57,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-08-27 15:21:57,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 15:21:57,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2021-08-27 15:21:57,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:21:57,120 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-08-27 15:21:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2021-08-27 15:21:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2021-08-27 15:21:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-08-27 15:21:57,122 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-08-27 15:21:57,122 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-08-27 15:21:57,122 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 15:21:57,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 54 transitions. [2021-08-27 15:21:57,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 15:21:57,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:57,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:57,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 15:21:57,123 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 15:21:57,123 INFO L791 eck$LassoCheckResult]: Stem: 1279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1280#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1289#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1285#L28-2 [2021-08-27 15:21:57,123 INFO L793 eck$LassoCheckResult]: Loop: 1285#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1275#L18 assume !(0 == __VERIFIER_assert_~cond); 1276#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1281#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1284#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1285#L28-2 [2021-08-27 15:21:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2021-08-27 15:21:57,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523127052] [2021-08-27 15:21:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,141 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,144 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash 46025336, now seen corresponding path program 1 times [2021-08-27 15:21:57,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826970050] [2021-08-27 15:21:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,148 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,151 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 271240594, now seen corresponding path program 1 times [2021-08-27 15:21:57,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147356427] [2021-08-27 15:21:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,156 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,214 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:57,214 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:57,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:57,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:57,215 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 15:21:57,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:57,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:57,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2021-08-27 15:21:57,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:57,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:57,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,257 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:57,258 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 15:21:57,258 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,274 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 15:21:57,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:57,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,309 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:57,309 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:57,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,328 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,329 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 15:21:57,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:57,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,353 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:57,353 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:57,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,384 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,394 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 15:21:57,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:57,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,418 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:57,418 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:57,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,444 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,445 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 15:21:57,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:57,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,494 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 15:21:57,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 15:21:57,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,532 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 15:21:57,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,535 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:57,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:57,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:57,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:57,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:21:57,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:57,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:57,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration10_Loop [2021-08-27 15:21:57,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:57,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:57,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:57,582 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:21:57,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,583 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 15:21:57,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:57,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:57,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:57,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:57,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:57,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:57,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:57,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:57,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:57,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-08-27 15:21:57,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 15:21:57,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:57,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:57,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:57,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:57,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:57,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:57,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:57,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:57,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:57,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,699 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,700 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 15:21:57,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:57,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:57,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:57,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:57,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:57,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:57,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:57,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:57,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:21:57,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 15:21:57,715 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 15:21:57,715 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,716 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 15:21:57,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:21:57,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 15:21:57,719 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:21:57,719 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] [2021-08-27 15:21:57,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,737 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 15:21:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:57,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:21:57,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:57,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:57,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 15:21:57,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 54 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 138 states and 145 transitions. Complement of second has 7 states. [2021-08-27 15:21:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:21:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-27 15:21:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2021-08-27 15:21:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2021-08-27 15:21:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2021-08-27 15:21:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:57,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 145 transitions. [2021-08-27 15:21:57,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 15:21:57,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 94 states and 98 transitions. [2021-08-27 15:21:57,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-08-27 15:21:57,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-08-27 15:21:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2021-08-27 15:21:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:21:57,807 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-08-27 15:21:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2021-08-27 15:21:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2021-08-27 15:21:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-08-27 15:21:57,809 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-27 15:21:57,809 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-27 15:21:57,809 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 15:21:57,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2021-08-27 15:21:57,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 15:21:57,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:21:57,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:21:57,810 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2021-08-27 15:21:57,810 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 15:21:57,811 INFO L791 eck$LassoCheckResult]: Stem: 1516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1517#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post5, main_#t~post4, main_~offset~0, main_~length~0, main_~nlen~0, main_~i~0, main_~j~0;havoc main_~offset~0;havoc main_~length~0;main_~nlen~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1525#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1526#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1562#L18 assume !(0 == __VERIFIER_assert_~cond); 1561#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1560#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1520#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1521#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1514#L18 assume !(0 == __VERIFIER_assert_~cond); 1515#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1523#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1524#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1559#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1558#L18 assume !(0 == __VERIFIER_assert_~cond); 1557#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1556#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1555#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1554#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1553#L18 assume !(0 == __VERIFIER_assert_~cond); 1552#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1551#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1550#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1549#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1548#L18 assume !(0 == __VERIFIER_assert_~cond); 1547#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1546#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1545#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1544#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1543#L18 assume !(0 == __VERIFIER_assert_~cond); 1542#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1541#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1540#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1539#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1538#L18 assume !(0 == __VERIFIER_assert_~cond); 1537#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1536#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1535#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1534#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1530#L18 assume !(0 == __VERIFIER_assert_~cond); 1533#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1532#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1531#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1529#L28-2 assume !(main_~j~0 < 8); 1528#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1527#L27-3 assume !!(main_~i~0 < main_~nlen~0);main_~j~0 := 0; 1519#L28-2 [2021-08-27 15:21:57,811 INFO L793 eck$LassoCheckResult]: Loop: 1519#L28-2 assume !!(main_~j~0 < 8);__VERIFIER_assert_#in~cond := (if 0 <= main_~nlen~0 - 1 - main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1512#L18 assume !(0 == __VERIFIER_assert_~cond); 1513#L18-2 __VERIFIER_assert_#in~cond := (if main_~nlen~0 - 1 - main_~i~0 < main_~nlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1522#L18-3 assume !(0 == __VERIFIER_assert_~cond); 1518#L18-5 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1519#L28-2 [2021-08-27 15:21:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 674802632, now seen corresponding path program 2 times [2021-08-27 15:21:57,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160428065] [2021-08-27 15:21:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,819 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,826 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash 46025336, now seen corresponding path program 2 times [2021-08-27 15:21:57,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088417288] [2021-08-27 15:21:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,830 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,832 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:57,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1573708561, now seen corresponding path program 3 times [2021-08-27 15:21:57,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:21:57,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714170011] [2021-08-27 15:21:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:21:57,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:21:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,851 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:21:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:21:57,860 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:21:57,905 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:57,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:57,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:57,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:57,905 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 15:21:57,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:57,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:57,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2021-08-27 15:21:57,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:57,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:57,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:57,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:57,946 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 15:21:57,946 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:57,947 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:57,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:57,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:57,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 15:21:57,981 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:57,981 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:57,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:57,999 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,000 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 15:21:58,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:58,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:58,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:58,013 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:58,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,033 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 15:21:58,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:58,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:58,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 15:21:58,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Honda state: {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~nlen~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 15:21:58,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,076 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 15:21:58,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 15:21:58,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:58,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,102 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,103 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 15:21:58,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 15:21:58,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 15:21:58,132 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 15:21:58,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,136 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:21:58,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:21:58,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:21:58,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:21:58,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:21:58,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:21:58,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:21:58,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration11_Loop [2021-08-27 15:21:58,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:21:58,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:21:58,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:58,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:58,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:58,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:21:58,182 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:21:58,182 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:21:58,182 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,183 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:58,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:58,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:58,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:58,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:58,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:58,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:58,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:58,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 15:21:58,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:58,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,247 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 15:21:58,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:58,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:58,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:58,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:58,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:58,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:58,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:58,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:58,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:58,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,274 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,279 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 15:21:58,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:58,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:58,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:58,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:58,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:58,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:58,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:58,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:58,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:21:58,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,306 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 15:21:58,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:21:58,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:21:58,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:21:58,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:21:58,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:21:58,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:21:58,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:21:58,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:21:58,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:21:58,347 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 15:21:58,348 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 15:21:58,348 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:21:58,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:21:58,348 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:21:58,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 15:21:58,351 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:21:58,351 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 15:21:58,351 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:21:58,351 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 15 Supporting invariants [] [2021-08-27 15:21:58,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 15:21:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:58,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 15:21:58,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 128 states and 133 transitions. Complement of second has 7 states. [2021-08-27 15:21:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:21:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-27 15:21:58,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-27 15:21:58,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:58,544 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 15:21:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:58,739 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 15:21:58,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 128 states and 133 transitions. Complement of second has 7 states. [2021-08-27 15:21:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:21:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-27 15:21:58,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-27 15:21:58,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:58,748 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 15:21:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:21:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:21:58,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:21:58,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:21:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:21:58,907 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 15:21:58,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,915 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 53 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 94 transitions. Complement of second has 6 states. [2021-08-27 15:21:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:21:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:21:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2021-08-27 15:21:58,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 5 letters. [2021-08-27 15:21:58,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:58,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 51 letters. Loop has 5 letters. [2021-08-27 15:21:58,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:58,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 46 letters. Loop has 10 letters. [2021-08-27 15:21:58,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:21:58,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 94 transitions. [2021-08-27 15:21:58,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:21:58,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2021-08-27 15:21:58,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 15:21:58,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 15:21:58,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 15:21:58,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:21:58,918 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:21:58,918 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:21:58,918 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:21:58,918 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 15:21:58,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 15:21:58,919 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:21:58,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 15:21:58,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 03:21:58 BoogieIcfgContainer [2021-08-27 15:21:58,923 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 15:21:58,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 15:21:58,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 15:21:58,924 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 15:21:58,924 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:21:53" (3/4) ... [2021-08-27 15:21:58,926 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 15:21:58,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 15:21:58,927 INFO L168 Benchmark]: Toolchain (without parser) took 6071.76 ms. Allocated memory was 73.4 MB in the beginning and 163.6 MB in the end (delta: 90.2 MB). Free memory was 57.9 MB in the beginning and 56.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 89.8 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,927 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 73.4 MB. Free memory is still 55.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:21:58,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.09 ms. Allocated memory is still 73.4 MB. Free memory was 57.9 MB in the beginning and 48.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.86 ms. Allocated memory is still 73.4 MB. Free memory was 48.4 MB in the beginning and 56.9 MB in the end (delta: -8.5 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,928 INFO L168 Benchmark]: Boogie Preprocessor took 53.43 ms. Allocated memory is still 73.4 MB. Free memory was 56.9 MB in the beginning and 56.1 MB in the end (delta: 819.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,928 INFO L168 Benchmark]: RCFGBuilder took 265.05 ms. Allocated memory is still 73.4 MB. Free memory was 55.8 MB in the beginning and 44.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,928 INFO L168 Benchmark]: BuchiAutomizer took 5550.65 ms. Allocated memory was 73.4 MB in the beginning and 163.6 MB in the end (delta: 90.2 MB). Free memory was 44.0 MB in the beginning and 56.5 MB in the end (delta: -12.5 MB). Peak memory consumption was 78.8 MB. Max. memory is 16.1 GB. [2021-08-27 15:21:58,928 INFO L168 Benchmark]: Witness Printer took 2.40 ms. Allocated memory is still 163.6 MB. Free memory is still 56.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:21:58,929 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.14 ms. Allocated memory is still 73.4 MB. Free memory is still 55.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 164.09 ms. Allocated memory is still 73.4 MB. Free memory was 57.9 MB in the beginning and 48.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.86 ms. Allocated memory is still 73.4 MB. Free memory was 48.4 MB in the beginning and 56.9 MB in the end (delta: -8.5 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.43 ms. Allocated memory is still 73.4 MB. Free memory was 56.9 MB in the beginning and 56.1 MB in the end (delta: 819.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 265.05 ms. Allocated memory is still 73.4 MB. Free memory was 55.8 MB in the beginning and 44.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5550.65 ms. Allocated memory was 73.4 MB in the beginning and 163.6 MB in the end (delta: 90.2 MB). Free memory was 44.0 MB in the beginning and 56.5 MB in the end (delta: -12.5 MB). Peak memory consumption was 78.8 MB. Max. memory is 16.1 GB. * Witness Printer took 2.40 ms. Allocated memory is still 163.6 MB. Free memory is still 56.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function nlen + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 15 + -2 * j and consists of 4 locations. One nondeterministic module has affine ranking function 15 + -2 * j and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 2. Automata minimization 28.0ms AutomataMinimizationTime, 10 MinimizatonAttempts, 107 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 9. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 148/148 HoareTripleCheckerStatistics: 115 SDtfs, 197 SDslu, 163 SDs, 0 SdLazy, 157 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 138.8ms Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq133 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 15:21:58,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:59,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:59,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:59,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:59,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 15:21:59,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 15:22:00,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 15:22:00,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...