./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.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 e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:20:43,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:20:44,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:20:44,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:20:44,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:20:44,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:20:44,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:20:44,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:20:44,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:20:44,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:20:44,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:20:44,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:20:44,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:20:44,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:20:44,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:20:44,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:20:44,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:20:44,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:20:44,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:20:44,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:20:44,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:20:44,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:20:44,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:20:44,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:20:44,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:20:44,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:20:44,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:20:44,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:20:44,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:20:44,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:20:44,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:20:44,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:20:44,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:20:44,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:20:44,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:20:44,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:20:44,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:20:44,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:20:44,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:20:44,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:20:44,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:20:44,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:20:44,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:20:44,098 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:20:44,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:20:44,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:20:44,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:20:44,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:20:44,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:20:44,101 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:20:44,101 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:20:44,101 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:20:44,102 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:20:44,102 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:20:44,102 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:20:44,102 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:20:44,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:20:44,103 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:20:44,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:20:44,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:20:44,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:20:44,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:20:44,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:20:44,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:20:44,104 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:20:44,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:20:44,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:20:44,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:20:44,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:20:44,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:20:44,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:20:44,106 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:20:44,106 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 -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2022-07-13 03:20:44,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:20:44,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:20:44,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:20:44,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:20:44,337 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:20:44,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-07-13 03:20:44,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345502320/c05b83e7d625454d9d172144dd77a1c3/FLAGbe4696047 [2022-07-13 03:20:44,812 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:20:44,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-07-13 03:20:44,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345502320/c05b83e7d625454d9d172144dd77a1c3/FLAGbe4696047 [2022-07-13 03:20:44,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345502320/c05b83e7d625454d9d172144dd77a1c3 [2022-07-13 03:20:44,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:20:44,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:20:44,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:20:44,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:20:44,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:20:44,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:20:44" (1/1) ... [2022-07-13 03:20:44,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2f7e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:44, skipping insertion in model container [2022-07-13 03:20:44,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:20:44" (1/1) ... [2022-07-13 03:20:44,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:20:44,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:20:45,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:20:45,085 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:20:45,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:20:45,162 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:20:45,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45 WrapperNode [2022-07-13 03:20:45,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:20:45,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:20:45,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:20:45,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:20:45,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,210 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-07-13 03:20:45,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:20:45,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:20:45,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:20:45,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:20:45,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:20:45,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:20:45,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:20:45,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:20:45,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (1/1) ... [2022-07-13 03:20:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:20:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:45,292 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-07-13 03:20:45,316 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-07-13 03:20:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:20:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:20:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:20:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:20:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:20:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:20:45,406 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:20:45,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:20:45,509 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:20:45,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:20:45,514 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:20:45,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:20:45 BoogieIcfgContainer [2022-07-13 03:20:45,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:20:45,516 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:20:45,516 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:20:45,519 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:20:45,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:45,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:20:44" (1/3) ... [2022-07-13 03:20:45,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3857aaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:20:45, skipping insertion in model container [2022-07-13 03:20:45,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:45,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:20:45" (2/3) ... [2022-07-13 03:20:45,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3857aaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:20:45, skipping insertion in model container [2022-07-13 03:20:45,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:20:45,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:20:45" (3/3) ... [2022-07-13 03:20:45,523 INFO L354 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-07-13 03:20:45,576 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:20:45,584 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:20:45,584 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:20:45,584 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:20:45,584 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:20:45,584 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:20:45,584 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:20:45,585 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:20:45,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:45,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:20:45,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:45,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:45,617 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:20:45,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:45,618 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:20:45,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:45,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:20:45,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:45,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:45,621 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:20:45,621 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:20:45,627 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 5#L552-4true [2022-07-13 03:20:45,627 INFO L754 eck$LassoCheckResult]: Loop: 5#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 11#L553-4true assume !true; 4#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 5#L552-4true [2022-07-13 03:20:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:20:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:45,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777064301] [2022-07-13 03:20:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:45,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:45,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-07-13 03:20:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:45,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693222544] [2022-07-13 03:20:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:45,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693222544] [2022-07-13 03:20:45,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693222544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:20:45,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:20:45,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:20:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696920626] [2022-07-13 03:20:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:20:45,872 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:20:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:20:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:20:45,912 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:45,918 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-07-13 03:20:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:20:45,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-07-13 03:20:45,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:20:45,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-07-13 03:20:45,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:20:45,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 03:20:45,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-07-13 03:20:45,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:20:45,933 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-13 03:20:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-07-13 03:20:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-13 03:20:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-13 03:20:45,968 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-13 03:20:45,968 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-13 03:20:45,969 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:20:45,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-13 03:20:45,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:20:45,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:45,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:45,971 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:20:45,971 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:20:45,971 INFO L752 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2022-07-13 03:20:45,971 INFO L754 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2022-07-13 03:20:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:20:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:45,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020408211] [2022-07-13 03:20:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-07-13 03:20:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734842771] [2022-07-13 03:20:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:46,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734842771] [2022-07-13 03:20:46,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734842771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:20:46,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:20:46,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:20:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222300288] [2022-07-13 03:20:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:20:46,164 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:20:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:46,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:20:46,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:20:46,165 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:46,211 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-07-13 03:20:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:20:46,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-07-13 03:20:46,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-13 03:20:46,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-07-13 03:20:46,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:20:46,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:20:46,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-07-13 03:20:46,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:20:46,214 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-13 03:20:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-07-13 03:20:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-13 03:20:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-13 03:20:46,215 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-13 03:20:46,215 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-13 03:20:46,215 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:20:46,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-07-13 03:20:46,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 03:20:46,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:46,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:46,216 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:20:46,217 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:20:46,218 INFO L752 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-4 [2022-07-13 03:20:46,219 INFO L754 eck$LassoCheckResult]: Loop: 61#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 64#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 65#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 66#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 69#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 60#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 61#L552-4 [2022-07-13 03:20:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:20:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607770958] [2022-07-13 03:20:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-07-13 03:20:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:46,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742461864] [2022-07-13 03:20:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:46,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742461864] [2022-07-13 03:20:46,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742461864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:20:46,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676656290] [2022-07-13 03:20:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:20:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:46,397 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-07-13 03:20:46,398 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-07-13 03:20:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:46,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 03:20:46,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:46,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-13 03:20:46,633 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:20:46,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-07-13 03:20:46,738 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 28 treesize of output 16 [2022-07-13 03:20:46,754 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 15 treesize of output 7 [2022-07-13 03:20:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:46,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:20:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:46,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676656290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:20:46,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:20:46,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-13 03:20:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856094224] [2022-07-13 03:20:46,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:20:46,835 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:20:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:20:46,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 03:20:46,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-13 03:20:46,836 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:20:46,907 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-07-13 03:20:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 03:20:46,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-07-13 03:20:46,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-13 03:20:46,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-07-13 03:20:46,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-13 03:20:46,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-13 03:20:46,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-07-13 03:20:46,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:20:46,910 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-13 03:20:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-07-13 03:20:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-13 03:20:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:20:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-07-13 03:20:46,913 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-07-13 03:20:46,913 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-07-13 03:20:46,913 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:20:46,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-07-13 03:20:46,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-13 03:20:46,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:20:46,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:20:46,914 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:20:46,914 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-07-13 03:20:46,914 INFO L752 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2022-07-13 03:20:46,915 INFO L754 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 156#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 157#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 159#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 166#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 162#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 163#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 151#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 152#L552-4 [2022-07-13 03:20:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:20:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:46,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848394855] [2022-07-13 03:20:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:20:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:20:46,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:20:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:20:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-07-13 03:20:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:20:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774537444] [2022-07-13 03:20:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:20:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:20:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:20:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:20:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774537444] [2022-07-13 03:20:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774537444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:20:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252053872] [2022-07-13 03:20:47,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:20:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:20:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:20:47,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:20:47,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 03:20:47,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:20:47,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:20:47,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 03:20:47,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:20:47,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-13 03:20:47,632 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:20:47,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-07-13 03:20:47,680 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 50 treesize of output 30 [2022-07-13 03:20:47,742 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:20:47,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-07-13 03:20:47,788 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 50 treesize of output 30 [2022-07-13 03:20:47,848 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:20:47,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-07-13 03:20:47,917 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 50 treesize of output 30 [2022-07-13 03:20:47,979 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-13 03:20:47,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-07-13 03:20:48,063 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 28 treesize of output 16 [2022-07-13 03:20:48,069 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 15 treesize of output 7 [2022-07-13 03:20:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:20:48,072 INFO L328 TraceCheckSpWp]: Computing backward predicates...