./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 f4b24e32 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-?-f4b24e3 [2022-07-14 15:01:34,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:01:34,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:01:34,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:01:34,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:01:34,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:01:34,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:01:34,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:01:34,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:01:34,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:01:34,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:01:34,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:01:34,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:01:34,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:01:34,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:01:34,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:01:34,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:01:34,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:01:34,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:01:34,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:01:34,556 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:01:34,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:01:34,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:01:34,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:01:34,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:01:34,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:01:34,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:01:34,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:01:34,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:01:34,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:01:34,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:01:34,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:01:34,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:01:34,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:01:34,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:01:34,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:01:34,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:01:34,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:01:34,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:01:34,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:01:34,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:01:34,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:01:34,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:01:34,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:01:34,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:01:34,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:01:34,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:01:34,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:01:34,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:01:34,599 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:01:34,600 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:01:34,600 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:01:34,600 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:01:34,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:01:34,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:01:34,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:01:34,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:01:34,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:01:34,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:01:34,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:01:34,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:01:34,604 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:01:34,604 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-14 15:01:34,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:01:34,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:01:34,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:01:34,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:01:34,816 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:01:34,817 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-14 15:01:34,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5fac589/e3015a49a5bb4a668570a273f8c6e317/FLAGa78cef785 [2022-07-14 15:01:35,242 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:01:35,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-07-14 15:01:35,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5fac589/e3015a49a5bb4a668570a273f8c6e317/FLAGa78cef785 [2022-07-14 15:01:35,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5fac589/e3015a49a5bb4a668570a273f8c6e317 [2022-07-14 15:01:35,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:01:35,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:01:35,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:35,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:01:35,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:01:35,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230cc922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35, skipping insertion in model container [2022-07-14 15:01:35,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:01:35,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:01:35,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:35,543 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:01:35,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:35,595 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:01:35,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35 WrapperNode [2022-07-14 15:01:35,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:35,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:35,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:01:35,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:01:35,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,629 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-07-14 15:01:35,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:35,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:01:35,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:01:35,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:01:35,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:01:35,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:01:35,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:01:35,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:01:35,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (1/1) ... [2022-07-14 15:01:35,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:35,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:35,667 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-14 15:01:35,675 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-14 15:01:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:01:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:01:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:01:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:01:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:01:35,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:01:35,796 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:01:35,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:01:35,935 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:01:35,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:01:35,940 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:01:35,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:35 BoogieIcfgContainer [2022-07-14 15:01:35,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:01:35,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:01:35,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:01:35,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:01:35,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:35,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:01:35" (1/3) ... [2022-07-14 15:01:35,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9f72fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:35, skipping insertion in model container [2022-07-14 15:01:35,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:35,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:35" (2/3) ... [2022-07-14 15:01:35,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e9f72fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:35, skipping insertion in model container [2022-07-14 15:01:35,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:35,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:35" (3/3) ... [2022-07-14 15:01:35,949 INFO L354 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-07-14 15:01:35,983 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:01:35,983 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:01:35,984 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:01:35,984 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:01:35,984 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:01:35,984 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:01:35,984 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:01:35,984 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:01:35,987 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-14 15:01:35,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:01:35,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:35,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:36,003 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:36,003 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:36,003 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:01:36,004 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-14 15:01:36,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:01:36,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:36,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:36,005 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:36,005 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:01:36,011 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-14 15:01:36,011 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-14 15:01:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:01:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259283280] [2022-07-14 15:01:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-07-14 15:01:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764369902] [2022-07-14 15:01:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:36,245 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-14 15:01:36,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:36,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764369902] [2022-07-14 15:01:36,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764369902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:01:36,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:01:36,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:01:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176181903] [2022-07-14 15:01:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:01:36,249 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:01:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:01:36,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:01:36,281 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-14 15:01:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:36,286 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-07-14 15:01:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:01:36,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-07-14 15:01:36,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:01:36,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-07-14 15:01:36,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:01:36,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:01:36,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-07-14 15:01:36,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:36,297 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-14 15:01:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-07-14 15:01:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-14 15:01:36,315 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-14 15:01:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-14 15:01:36,316 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-14 15:01:36,316 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-14 15:01:36,316 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:01:36,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-14 15:01:36,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:01:36,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:36,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:36,317 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:36,317 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:01:36,317 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-14 15:01:36,318 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-14 15:01:36,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,318 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:01:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97278194] [2022-07-14 15:01:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-07-14 15:01:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032017416] [2022-07-14 15:01:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:36,435 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-14 15:01:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032017416] [2022-07-14 15:01:36,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032017416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:01:36,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:01:36,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:01:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758320861] [2022-07-14 15:01:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:01:36,437 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:01:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:36,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:01:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:01:36,437 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-14 15:01:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:36,472 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-07-14 15:01:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:01:36,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-07-14 15:01:36,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 15:01:36,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-07-14 15:01:36,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:01:36,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:01:36,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-07-14 15:01:36,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:36,475 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-14 15:01:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-07-14 15:01:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-14 15:01:36,476 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-14 15:01:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-14 15:01:36,477 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-14 15:01:36,477 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-14 15:01:36,477 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:01:36,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-07-14 15:01:36,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:01:36,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:36,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:36,479 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:36,479 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:01:36,479 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-14 15:01:36,479 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-14 15:01:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 15:01:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934785352] [2022-07-14 15:01:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:36,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-07-14 15:01:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30387555] [2022-07-14 15:01:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:36,618 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-14 15:01:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:36,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30387555] [2022-07-14 15:01:36,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30387555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:36,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246627435] [2022-07-14 15:01:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:36,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:36,622 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-14 15:01:36,623 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-14 15:01:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:36,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 15:01:36,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:36,738 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-14 15:01:36,818 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:01:36,818 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-14 15:01:36,879 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-14 15:01:36,889 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-14 15:01:36,896 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-14 15:01:36,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:01:36,933 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-14 15:01:36,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246627435] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:01:36,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:01:36,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-14 15:01:36,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080767058] [2022-07-14 15:01:36,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:01:36,934 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:01:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 15:01:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-14 15:01:36,935 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-14 15:01:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:36,984 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-07-14 15:01:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 15:01:36,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-07-14 15:01:36,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-14 15:01:36,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-07-14 15:01:36,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 15:01:36,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 15:01:36,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-07-14 15:01:36,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:36,986 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-14 15:01:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-07-14 15:01:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-14 15:01:36,987 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-14 15:01:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-07-14 15:01:36,987 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-07-14 15:01:36,988 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-07-14 15:01:36,988 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:01:36,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-07-14 15:01:36,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-14 15:01:36,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:36,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:36,988 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:36,988 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-07-14 15:01:36,989 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-14 15:01:36,989 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-14 15:01:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 15:01:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:36,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526267000] [2022-07-14 15:01:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-07-14 15:01:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324728958] [2022-07-14 15:01:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:37,412 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-14 15:01:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324728958] [2022-07-14 15:01:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324728958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:37,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508751221] [2022-07-14 15:01:37,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:01:37,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:37,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:37,424 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-14 15:01:37,425 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-14 15:01:37,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:01:37,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:01:37,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-14 15:01:37,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:37,507 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-14 15:01:37,540 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:01:37,541 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-14 15:01:37,626 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-14 15:01:37,704 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:01:37,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, 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-14 15:01:37,756 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-14 15:01:37,824 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:01:37,824 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-14 15:01:37,910 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-14 15:01:37,970 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:01:37,971 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-14 15:01:38,037 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-14 15:01:38,042 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-14 15:01:38,044 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-14 15:01:38,044 INFO L328 TraceCheckSpWp]: Computing backward predicates...