./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/termination-recursive-malloc/rec_malloc_ex9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:11,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:11,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:11,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:11,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:11,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:11,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:11,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:11,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:11,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:11,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:11,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:11,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:11,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:11,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:11,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:11,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:11,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:11,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:11,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:11,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:11,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:11,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:11,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:11,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:11,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:11,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:11,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:11,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:11,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:11,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:11,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:11,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:11,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:11,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:11,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:11,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:11,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:11,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:11,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:11,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:11,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:36:11,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:11,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:11,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:11,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:11,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:11,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:11,240 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:11,240 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:11,240 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:11,240 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:11,241 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:11,241 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:11,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:11,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:11,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:11,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:11,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:11,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:11,244 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:11,244 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce [2022-02-21 03:36:11,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:11,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:11,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:11,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:11,474 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:11,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2022-02-21 03:36:11,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3427d2c4a/20ffcbbef8504a80a27301e38f01d64e/FLAGcd1a949b2 [2022-02-21 03:36:11,872 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:11,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2022-02-21 03:36:11,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3427d2c4a/20ffcbbef8504a80a27301e38f01d64e/FLAGcd1a949b2 [2022-02-21 03:36:11,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3427d2c4a/20ffcbbef8504a80a27301e38f01d64e [2022-02-21 03:36:11,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:11,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:11,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:11,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:11,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:11,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:11" (1/1) ... [2022-02-21 03:36:11,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341cc303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:11, skipping insertion in model container [2022-02-21 03:36:11,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:11" (1/1) ... [2022-02-21 03:36:11,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:11,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:12,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:12,064 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:12,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:12,084 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:12,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12 WrapperNode [2022-02-21 03:36:12,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:12,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:12,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:12,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:12,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,108 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-02-21 03:36:12,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:12,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:12,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:12,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:12,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:12,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:12,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:12,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:12,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (1/1) ... [2022-02-21 03:36:12,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,188 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) [2022-02-21 03:36:12,195 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 [2022-02-21 03:36:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:36:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:36:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:36:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:12,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:12,262 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:12,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:12,449 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:12,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:12,455 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:36:12,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:12 BoogieIcfgContainer [2022-02-21 03:36:12,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:12,457 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:12,457 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:12,460 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:12,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:12,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:11" (1/3) ... [2022-02-21 03:36:12,461 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b2d9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:12, skipping insertion in model container [2022-02-21 03:36:12,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:12,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:12" (2/3) ... [2022-02-21 03:36:12,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45b2d9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:12, skipping insertion in model container [2022-02-21 03:36:12,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:12,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:12" (3/3) ... [2022-02-21 03:36:12,472 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2022-02-21 03:36:12,504 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:12,505 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:12,505 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:12,505 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:12,505 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:12,505 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:12,505 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:12,506 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:12,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:12,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:12,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:12,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:12,553 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:12,553 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:12,553 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:12,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:12,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:12,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:12,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:12,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:12,561 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:12,566 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 11#L29-3true [2022-02-21 03:36:12,567 INFO L793 eck$LassoCheckResult]: Loop: 11#L29-3true call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 8#L29-1true assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 9#L33true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 14#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 12#L9true assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 16#recFINALtrue assume true; 15#recEXITtrue >#33#return; 6#L33-1true havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 11#L29-3true [2022-02-21 03:36:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:36:12,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:12,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683682887] [2022-02-21 03:36:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:12,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:12,734 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2022-02-21 03:36:12,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:12,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884314136] [2022-02-21 03:36:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {31#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#(<= (+ |rec_#in~i| 1) 0)} assume true; {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#(<= (+ |rec_#in~i| 1) 0)} {25#(and (or (and (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|) (= |ULTIMATE.start_main_#t~mem10#1| 0)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)))} #33#return; {23#false} is VALID [2022-02-21 03:36:13,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {24#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem6#1|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) 0)} is VALID [2022-02-21 03:36:13,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(= (+ (* (- 1) |ULTIMATE.start_main_#t~mem6#1|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) 0)} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {25#(and (or (and (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|) (= |ULTIMATE.start_main_#t~mem10#1| 0)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)))} is VALID [2022-02-21 03:36:13,014 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#(and (or (and (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|) (= |ULTIMATE.start_main_#t~mem10#1| 0)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {30#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:13,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {31#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#(<= (+ |rec_#in~i| 1) 0)} assume true; {32#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,020 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#(<= (+ |rec_#in~i| 1) 0)} {25#(and (or (and (= |ULTIMATE.start_main_~qq~0#1.offset| |ULTIMATE.start_main_~pp~0#1.offset|) (= |ULTIMATE.start_main_#t~mem10#1| 0)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)) (or (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= 1 |ULTIMATE.start_main_#t~mem10#1|)))} #33#return; {23#false} is VALID [2022-02-21 03:36:13,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {23#false} is VALID [2022-02-21 03:36:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:13,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:13,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884314136] [2022-02-21 03:36:13,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884314136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:13,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:13,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:36:13,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211338755] [2022-02-21 03:36:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:13,028 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:36:13,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:13,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:13,052 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:36:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:13,257 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:36:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:36:13,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:36:13,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:13,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2022-02-21 03:36:13,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:13,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2022-02-21 03:36:13,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:36:13,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:36:13,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:36:13,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:13,285 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:36:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:36:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:36:13,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:13,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:13,302 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:13,303 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:13,304 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:36:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:36:13,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:13,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:36:13,306 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:36:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:13,307 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:36:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:36:13,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:13,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:13,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:13,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:36:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:36:13,327 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:36:13,327 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:36:13,327 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:13,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:36:13,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:13,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:13,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:13,334 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:13,335 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:13,335 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 56#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 57#L29-3 [2022-02-21 03:36:13,335 INFO L793 eck$LassoCheckResult]: Loop: 57#L29-3 call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 58#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 61#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 59#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 60#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 66#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 59#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 62#recFINAL assume true; 67#recEXIT >#31#return; 63#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 64#recFINAL assume true; 68#recEXIT >#33#return; 65#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 57#L29-3 [2022-02-21 03:36:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:36:13,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:13,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92031596] [2022-02-21 03:36:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:13,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:13,371 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2022-02-21 03:36:13,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:13,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673101470] [2022-02-21 03:36:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:13,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:13,458 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1849555021, now seen corresponding path program 1 times [2022-02-21 03:36:13,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:13,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494921033] [2022-02-21 03:36:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:36:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,612 INFO L272 TraceCheckUtils]: 2: Hoare triple {120#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:13,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,614 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,615 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {125#(<= |rec_#in~i| 0)} {108#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|))} #33#return; {105#false} is VALID [2022-02-21 03:36:13,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {104#true} is VALID [2022-02-21 03:36:13,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} is VALID [2022-02-21 03:36:13,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {107#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem6#1|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) 0))} is VALID [2022-02-21 03:36:13,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (= (+ (* (- 1) |ULTIMATE.start_main_#t~mem6#1|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) 0))} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {108#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|))} is VALID [2022-02-21 03:36:13,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {108#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:13,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,620 INFO L272 TraceCheckUtils]: 7: Hoare triple {120#(= rec_~i |rec_#in~i|)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:13,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {119#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {120#(= rec_~i |rec_#in~i|)} is VALID [2022-02-21 03:36:13,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {120#(= rec_~i |rec_#in~i|)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:13,622 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {120#(= rec_~i |rec_#in~i|)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:13,624 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {125#(<= |rec_#in~i| 0)} {108#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= 1 |ULTIMATE.start_main_#t~mem10#1|))} #33#return; {105#false} is VALID [2022-02-21 03:36:13,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#false} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {105#false} is VALID [2022-02-21 03:36:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:36:13,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:13,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494921033] [2022-02-21 03:36:13,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494921033] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:13,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714079633] [2022-02-21 03:36:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,628 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) [2022-02-21 03:36:13,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:36:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:36:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:13,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-21 03:36:14,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:14,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-02-21 03:36:14,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {104#true} is VALID [2022-02-21 03:36:14,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} is VALID [2022-02-21 03:36:14,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {136#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:36:14,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#(and (not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-21 03:36:14,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {104#true} is VALID [2022-02-21 03:36:14,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {147#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:36:14,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(<= |rec_#in~i| rec_~i)} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {147#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:36:14,282 INFO L272 TraceCheckUtils]: 7: Hoare triple {147#(<= |rec_#in~i| rec_~i)} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {104#true} is VALID [2022-02-21 03:36:14,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {147#(<= |rec_#in~i| rec_~i)} is VALID [2022-02-21 03:36:14,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#(<= |rec_#in~i| rec_~i)} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:14,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:14,287 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {147#(<= |rec_#in~i| rec_~i)} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,289 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {125#(<= |rec_#in~i| 0)} {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} #33#return; {105#false} is VALID [2022-02-21 03:36:14,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#false} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {105#false} is VALID [2022-02-21 03:36:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:36:14,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:14,772 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 1 |c_ULTIMATE.start_main_#t~mem6#1|)) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 Int) (v_ArrVal_141 (Array Int Int)) (|ULTIMATE.start_main_~pp~0#1.offset| Int) (v_ArrVal_137 (Array Int Int))) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base|) |c_ULTIMATE.start_main_~qq~0#1.offset|) (+ v_ArrVal_140 1))) (< 0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~pp~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| v_ArrVal_140)) |c_ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))))) is different from false [2022-02-21 03:36:14,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-02-21 03:36:14,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#false} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {105#false} is VALID [2022-02-21 03:36:14,929 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {125#(<= |rec_#in~i| 0)} {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} #33#return; {105#false} is VALID [2022-02-21 03:36:14,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {125#(<= |rec_#in~i| 0)} assume true; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#(<= |rec_#in~i| 0)} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,930 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#(<= (+ |rec_#in~i| 1) 0)} {193#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} #31#return; {125#(<= |rec_#in~i| 0)} is VALID [2022-02-21 03:36:14,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= (+ |rec_#in~i| 1) 0)} assume true; {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:14,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {203#(or (<= (+ |rec_#in~i| 1) 0) (not (< rec_~i 0)))} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {126#(<= (+ |rec_#in~i| 1) 0)} is VALID [2022-02-21 03:36:14,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {203#(or (<= (+ |rec_#in~i| 1) 0) (not (< rec_~i 0)))} is VALID [2022-02-21 03:36:14,932 INFO L272 TraceCheckUtils]: 7: Hoare triple {193#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {104#true} is VALID [2022-02-21 03:36:14,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {193#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {193#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} is VALID [2022-02-21 03:36:14,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {193#(or (<= |rec_#in~i| 0) (<= 1 rec_~i))} is VALID [2022-02-21 03:36:14,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {104#true} is VALID [2022-02-21 03:36:14,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {216#(or (not (< 1 |ULTIMATE.start_main_#t~mem6#1|)) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 Int) (v_ArrVal_141 (Array Int Int)) (|ULTIMATE.start_main_~pp~0#1.offset| Int) (v_ArrVal_137 (Array Int Int))) (or (< 0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_141) |ULTIMATE.start_main_~pp~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| v_ArrVal_140)) |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) (+ v_ArrVal_140 1))))))} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {140#(< 0 |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-21 03:36:14,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {216#(or (not (< 1 |ULTIMATE.start_main_#t~mem6#1|)) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_140 Int) (v_ArrVal_141 (Array Int Int)) (|ULTIMATE.start_main_~pp~0#1.offset| Int) (v_ArrVal_137 (Array Int Int))) (or (< 0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_141) |ULTIMATE.start_main_~pp~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset| v_ArrVal_140)) |ULTIMATE.start_main_~qq~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|)) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) (+ v_ArrVal_140 1))))))} is VALID [2022-02-21 03:36:14,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {106#(not (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|))} is VALID [2022-02-21 03:36:14,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {104#true} is VALID [2022-02-21 03:36:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:36:14,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714079633] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:14,940 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:14,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2022-02-21 03:36:14,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667268801] [2022-02-21 03:36:14,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:16,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:36:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2022-02-21 03:36:16,280 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:36:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:16,523 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:36:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:36:16,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:36:16,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:16,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:16,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:36:16,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:36:16,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:36:16,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:16,553 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:36:16,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:16,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:36:16,554 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:36:16,554 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:36:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:16,556 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:36:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:16,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:16,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:36:16,556 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:36:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:16,557 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:36:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:16,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:16,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:16,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:36:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:36:16,559 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:16,559 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:16,559 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:16,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:16,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:16,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:16,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:16,560 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:16,560 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:16,560 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 247#L29-3 [2022-02-21 03:36:16,560 INFO L793 eck$LassoCheckResult]: Loop: 247#L29-3 call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 248#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 252#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 258#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 251#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 253#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 258#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 251#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 253#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 258#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 251#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 254#recFINAL assume true; 259#recEXIT >#31#return; 255#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 256#recFINAL assume true; 263#recEXIT >#31#return; 261#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 262#recFINAL assume true; 260#recEXIT >#33#return; 257#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 247#L29-3 [2022-02-21 03:36:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2022-02-21 03:36:16,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:16,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527744923] [2022-02-21 03:36:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,574 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2022-02-21 03:36:16,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:16,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119662886] [2022-02-21 03:36:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,625 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 2 times [2022-02-21 03:36:16,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:16,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367675886] [2022-02-21 03:36:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:16,693 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:19,725 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:19,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:19,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:19,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:19,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:19,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:19,725 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:19,725 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:19,725 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2022-02-21 03:36:19,725 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:19,725 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:19,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,972 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:36:19,974 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:36:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:19,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:20,352 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:20,354 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,357 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2022-02-21 03:36:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:20,398 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 [2022-02-21 03:36:20,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,434 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2022-02-21 03:36:20,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:20,436 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 [2022-02-21 03:36:20,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:36:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,536 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2022-02-21 03:36:20,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:20,538 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 [2022-02-21 03:36:20,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:20,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,567 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2022-02-21 03:36:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:20,570 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 [2022-02-21 03:36:20,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:20,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,596 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2022-02-21 03:36:20,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:20,598 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 [2022-02-21 03:36:20,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:36:20,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,628 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2022-02-21 03:36:20,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:20,630 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 [2022-02-21 03:36:20,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,666 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) [2022-02-21 03:36:20,666 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 [2022-02-21 03:36:20,667 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 [2022-02-21 03:36:20,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:20,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,724 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) [2022-02-21 03:36:20,728 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 [2022-02-21 03:36:20,728 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 [2022-02-21 03:36:20,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,760 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 [2022-02-21 03:36:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,763 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) [2022-02-21 03:36:20,764 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 [2022-02-21 03:36:20,766 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 [2022-02-21 03:36:20,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:20,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:20,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:20,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:20,788 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 [2022-02-21 03:36:20,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,791 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) [2022-02-21 03:36:20,792 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 [2022-02-21 03:36:20,793 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 [2022-02-21 03:36:20,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:20,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:20,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:20,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:20,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:20,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:20,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:20,824 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:20,824 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,827 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) [2022-02-21 03:36:20,828 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 [2022-02-21 03:36:20,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:20,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:20,846 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:20,847 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:36:20,862 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 [2022-02-21 03:36:20,888 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:36:20,904 INFO L390 LassoCheck]: Loop: "call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset;" "call rec(~ip~0.base, ~ip~0.offset, ~i - 1);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i;" "assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#31#return;" "call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);" "assume true;" >"#33#return;" "havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1;" [2022-02-21 03:36:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:20,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:20,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:20,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {307#unseeded} is VALID [2022-02-21 03:36:20,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {307#unseeded} is VALID [2022-02-21 03:36:21,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-21 03:36:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:21,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:21,203 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-02-21 03:36:21,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 89 [2022-02-21 03:36:21,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:36:21,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:36:21,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-21 03:36:21,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:36:21,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 9 [2022-02-21 03:36:21,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-02-21 03:36:21,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 03:36:22,041 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 03:36:22,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-21 03:36:22,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:22,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:22,703 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-21 03:36:22,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2022-02-21 03:36:22,784 INFO L356 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2022-02-21 03:36:22,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2022-02-21 03:36:22,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:36:22,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {348#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:36:22,961 WARN L290 TraceCheckUtils]: 1: Hoare triple {348#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {352#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|) v_DerPreprocessor_2) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|)) (<= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) 0))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0))} is UNKNOWN [2022-02-21 03:36:22,962 INFO L272 TraceCheckUtils]: 2: Hoare triple {352#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|) v_DerPreprocessor_2) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|)) (<= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) 0))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {356#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {356#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {360#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {364#(and (exists ((v_ArrVal_253 Int)) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) |#valid|)) (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,970 INFO L272 TraceCheckUtils]: 5: Hoare triple {364#(and (exists ((v_ArrVal_253 Int)) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) |#valid|)) (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {356#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {360#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {374#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,972 INFO L272 TraceCheckUtils]: 8: Hoare triple {374#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {378#(and (= |#memory_int| |old(#memory_int)|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(and (= |#memory_int| |old(#memory_int)|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {382#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base) (<= |old(oldRank0)| oldRank0))} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {386#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_254))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_254))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} assume true; {386#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_254))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,975 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {386#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| v_ArrVal_254))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} {374#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} #31#return; {393#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254))) (< |rec_#in~i| 1) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(and (exists ((v_ArrVal_254 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254))) (< |rec_#in~i| 1) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {397#(and (< |rec_#in~i| 1) (exists ((rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |#valid| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#(and (< |rec_#in~i| 1) (exists ((rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |#valid| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {397#(and (< |rec_#in~i| 1) (exists ((rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |#valid| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {397#(and (< |rec_#in~i| 1) (exists ((rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |#valid| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base v_ArrVal_254)) (= (select |old(#valid)| rec_~ip~0.base) 0))) (<= |old(oldRank0)| oldRank0))} {364#(and (exists ((v_ArrVal_253 Int)) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) |#valid|)) (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} #31#return; {404#(and (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (v_ArrVal_254 (Array Int Int))) (and (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (= (select |#valid| v_rec_~ip~0.base_29) 0))) (< |rec_#in~i| 2) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(and (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (v_ArrVal_254 (Array Int Int))) (and (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (= (select |#valid| v_rec_~ip~0.base_29) 0))) (< |rec_#in~i| 2) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {408#(and (< |rec_#in~i| 2) (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (or (= v_rec_~ip~0.base_29 rec_~ip~0.base) (= (select |#valid| v_rec_~ip~0.base_29) 0)))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#(and (< |rec_#in~i| 2) (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (or (= v_rec_~ip~0.base_29 rec_~ip~0.base) (= (select |#valid| v_rec_~ip~0.base_29) 0)))) (<= |old(oldRank0)| oldRank0))} assume true; {408#(and (< |rec_#in~i| 2) (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (or (= v_rec_~ip~0.base_29 rec_~ip~0.base) (= (select |#valid| v_rec_~ip~0.base_29) 0)))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:22,981 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {408#(and (< |rec_#in~i| 2) (exists ((v_rec_~ip~0.base_29 Int) (v_ArrVal_253 Int) (rec_~ip~0.base Int) (v_ArrVal_254 (Array Int Int))) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_253) v_rec_~ip~0.base_29) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_29 v_ArrVal_254)) (or (= v_rec_~ip~0.base_29 rec_~ip~0.base) (= (select |#valid| v_rec_~ip~0.base_29) 0)))) (<= |old(oldRank0)| oldRank0))} {352#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|) v_DerPreprocessor_2) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_main_~pp~0#1.base|)) (<= (select v_DerPreprocessor_1 |ULTIMATE.start_main_~qq~0#1.offset|) 0))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0))} #33#return; {415#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 2) (< 1 oldRank0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0))} is VALID [2022-02-21 03:36:22,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {415#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 2) (< 1 oldRank0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0))} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {340#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))))} is VALID [2022-02-21 03:36:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 4 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:36:22,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:22,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 11 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:22,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:22,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2022-02-21 03:36:23,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:23,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 20 states and 22 transitions. Complement of second has 5 states. [2022-02-21 03:36:23,044 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 [2022-02-21 03:36:23,044 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:23,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:23,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:23,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:36:23,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:23,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,048 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:23,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:23,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:23,051 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:23,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 3 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:23,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:23,051 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:23,051 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:23,054 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,069 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2022-02-21 03:36:23,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,070 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:23,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {307#unseeded} is VALID [2022-02-21 03:36:23,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {307#unseeded} is VALID [2022-02-21 03:36:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,252 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-02-21 03:36:23,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 89 [2022-02-21 03:36:23,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:36:23,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-21 03:36:23,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:36:23,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:36:23,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 15 [2022-02-21 03:36:23,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-21 03:36:37,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:37,383 INFO L356 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2022-02-21 03:36:37,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 75 [2022-02-21 03:36:37,432 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-02-21 03:36:37,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-02-21 03:36:37,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:36:37,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-02-21 03:36:37,686 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 03:36:37,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-02-21 03:36:38,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} call main_#t~mem6#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {453#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:36:38,355 WARN L290 TraceCheckUtils]: 1: Hoare triple {453#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {457#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0) (or (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0)) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) (select v_DerPreprocessor_3 |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0))))} is UNKNOWN [2022-02-21 03:36:38,356 INFO L272 TraceCheckUtils]: 2: Hoare triple {457#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0) (or (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0)) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) (select v_DerPreprocessor_3 |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0))))} call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1); {461#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {465#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {469#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (exists ((v_ArrVal_300 Int) (rec_~ip~0.base Int)) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) |#valid|))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,360 INFO L272 TraceCheckUtils]: 5: Hoare triple {469#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (exists ((v_ArrVal_300 Int) (rec_~ip~0.base Int)) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) |#valid|))) (<= |old(oldRank0)| oldRank0))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {461#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#(and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {465#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |old(#valid)| |#valid|) (<= |old(oldRank0)| oldRank0))} assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; {479#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,362 INFO L272 TraceCheckUtils]: 8: Hoare triple {479#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} call rec(~ip~0.base, ~ip~0.offset, ~i - 1); {483#(and (= |#memory_int| |old(#memory_int)|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(and (= |#memory_int| |old(#memory_int)|) (<= |old(oldRank0)| oldRank0))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; {487#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= |rec_#in~op.base| rec_~op.base) (<= |old(oldRank0)| oldRank0))} assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); {491#(and (exists ((v_ArrVal_301 Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| (store (select |old(#memory_int)| |rec_#in~op.base|) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(and (exists ((v_ArrVal_301 Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| (store (select |old(#memory_int)| |rec_#in~op.base|) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} assume true; {491#(and (exists ((v_ArrVal_301 Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| (store (select |old(#memory_int)| |rec_#in~op.base|) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {491#(and (exists ((v_ArrVal_301 Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~op.base| (store (select |old(#memory_int)| |rec_#in~op.base|) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1))) (< |rec_#in~i| 0) (<= |old(oldRank0)| oldRank0))} {479#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (= (select |old(#valid)| rec_~ip~0.base) 0) (<= |old(oldRank0)| oldRank0))} #31#return; {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} assume true; {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,368 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {498#(and (exists ((v_ArrVal_301 Int) (rec_~ip~0.base Int) (rec_~op.offset Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~ip~0.base (store (select |old(#memory_int)| rec_~ip~0.base) rec_~op.offset v_ArrVal_301))) (< v_ArrVal_301 1) (= (select |old(#valid)| rec_~ip~0.base) 0))) (< |rec_#in~i| 1) (<= |old(oldRank0)| oldRank0))} {469#(and (= |#memory_int| |old(#memory_int)|) (<= |rec_#in~i| rec_~i) (exists ((v_ArrVal_300 Int) (rec_~ip~0.base Int)) (and (= (select |old(#valid)| rec_~ip~0.base) 0) (= (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) |#valid|))) (<= |old(oldRank0)| oldRank0))} #31#return; {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:38,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} assume true; {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:50,377 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {508#(and (exists ((v_ArrVal_301 Int) (v_ArrVal_300 Int) (rec_~ip~0.base Int) (v_rec_~ip~0.base_30 Int) (rec_~op.offset Int)) (and (< v_ArrVal_301 1) (= (select (store |old(#valid)| rec_~ip~0.base v_ArrVal_300) v_rec_~ip~0.base_30) 0) (= (select |old(#valid)| rec_~ip~0.base) 0) (= |#memory_int| (store |old(#memory_int)| v_rec_~ip~0.base_30 (store (select |old(#memory_int)| v_rec_~ip~0.base_30) rec_~op.offset v_ArrVal_301))))) (< |rec_#in~i| 2) (<= |old(oldRank0)| oldRank0))} {457#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem10#1|) (= (select |#valid| |ULTIMATE.start_main_~pp~0#1.base|) 1) (< 1 oldRank0) (or (and (= |ULTIMATE.start_main_~qq~0#1.base| |ULTIMATE.start_main_~pp~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0)) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) (select v_DerPreprocessor_3 |ULTIMATE.start_main_~qq~0#1.offset|)) (= (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_main_~qq~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_main_~pp~0#1.base|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0))))} #33#return; {518#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 2) (exists ((v_ArrVal_301 Int) (v_rec_~ip~0.base_30 Int)) (and (< v_ArrVal_301 1) (or (and (or (exists ((rec_~op.offset Int)) (= (store (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) rec_~op.offset v_ArrVal_301) (select |#memory_int| v_rec_~ip~0.base_30))) (and (exists ((rec_~op.offset Int)) (= v_ArrVal_301 (select (select |#memory_int| v_rec_~ip~0.base_30) rec_~op.offset))) (not (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~qq~0#1.base|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0)) (and (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~qq~0#1.base|) (exists ((rec_~op.offset Int)) (= v_ArrVal_301 (select (select |#memory_int| v_rec_~ip~0.base_30) rec_~op.offset))) (<= (select (select |#memory_int| v_rec_~ip~0.base_30) |ULTIMATE.start_main_~qq~0#1.offset|) 0))) (not (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~pp~0#1.base|)))) (< 1 oldRank0))} is UNKNOWN [2022-02-21 03:36:50,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {518#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) 2) (exists ((v_ArrVal_301 Int) (v_rec_~ip~0.base_30 Int)) (and (< v_ArrVal_301 1) (or (and (or (exists ((rec_~op.offset Int)) (= (store (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) rec_~op.offset v_ArrVal_301) (select |#memory_int| v_rec_~ip~0.base_30))) (and (exists ((rec_~op.offset Int)) (= v_ArrVal_301 (select (select |#memory_int| v_rec_~ip~0.base_30) rec_~op.offset))) (not (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~qq~0#1.base|)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) 0)) (and (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~qq~0#1.base|) (exists ((rec_~op.offset Int)) (= v_ArrVal_301 (select (select |#memory_int| v_rec_~ip~0.base_30) rec_~op.offset))) (<= (select (select |#memory_int| v_rec_~ip~0.base_30) |ULTIMATE.start_main_~qq~0#1.offset|) 0))) (not (= v_rec_~ip~0.base_30 |ULTIMATE.start_main_~pp~0#1.base|)))) (< 1 oldRank0))} havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {340#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))))} is VALID [2022-02-21 03:36:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:36:50,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:50,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 12 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:50,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2022-02-21 03:36:50,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:50,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 20 states and 22 transitions. Complement of second has 5 states. [2022-02-21 03:36:50,418 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 [2022-02-21 03:36:50,418 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:50,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:50,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:50,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:50,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:50,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:50,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:50,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:36:50,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:50,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:50,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:50,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 19 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:50,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:50,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:50,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:50,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 3 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:50,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:50,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:50,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:50,421 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:50,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:50,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:50,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 22 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 20 letters. [2022-02-21 03:36:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 20 letters. [2022-02-21 03:36:50,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,444 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2022-02-21 03:36:50,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 2 letters. Loop has 20 letters. [2022-02-21 03:36:50,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:50,445 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:50,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:50,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:50,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {307#unseeded} is VALID [2022-02-21 03:36:50,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem6#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; {307#unseeded} is VALID [2022-02-21 03:36:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:50,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-21 03:36:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:50,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:50,851 INFO L356 Elim1Store]: treesize reduction 52, result has 52.3 percent of original size [2022-02-21 03:36:50,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 316 [2022-02-21 03:36:50,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-21 03:36:50,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-02-21 03:36:50,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-02-21 03:36:51,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-02-21 03:36:51,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-02-21 03:36:51,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-02-21 03:36:51,470 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-02-21 03:36:51,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 228 [2022-02-21 03:36:51,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-02-21 03:36:51,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-02-21 03:36:51,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-02-21 03:36:51,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:36:51,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-02-21 03:36:51,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:36:51,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23