./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 e19ca921
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-dev-e19ca92
[2021-12-22 19:53:47,710 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-22 19:53:47,711 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-22 19:53:47,757 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-22 19:53:47,758 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-22 19:53:47,760 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-22 19:53:47,761 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-22 19:53:47,765 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-22 19:53:47,766 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-22 19:53:47,769 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-22 19:53:47,770 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-22 19:53:47,771 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-22 19:53:47,771 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-22 19:53:47,773 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-22 19:53:47,775 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-22 19:53:47,776 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-22 19:53:47,778 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-22 19:53:47,779 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-22 19:53:47,780 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-22 19:53:47,781 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-22 19:53:47,782 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-22 19:53:47,783 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-22 19:53:47,784 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-22 19:53:47,785 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-22 19:53:47,786 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-22 19:53:47,791 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-22 19:53:47,791 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-22 19:53:47,792 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-22 19:53:47,793 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-22 19:53:47,794 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-22 19:53:47,794 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-22 19:53:47,794 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-22 19:53:47,795 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-22 19:53:47,796 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-22 19:53:47,797 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-22 19:53:47,797 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-22 19:53:47,798 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-22 19:53:47,798 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-22 19:53:47,798 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-22 19:53:47,799 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-22 19:53:47,799 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-22 19:53:47,800 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2021-12-22 19:53:47,819 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-22 19:53:47,819 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-22 19:53:47,820 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-22 19:53:47,820 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-22 19:53:47,821 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-22 19:53:47,821 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-22 19:53:47,821 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-22 19:53:47,821 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-12-22 19:53:47,821 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2021-12-22 19:53:47,821 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2021-12-22 19:53:47,822 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2021-12-22 19:53:47,822 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2021-12-22 19:53:47,822 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2021-12-22 19:53:47,822 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-12-22 19:53:47,823 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2021-12-22 19:53:47,824 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-22 19:53:47,824 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2021-12-22 19:53:47,824 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-22 19:53:47,824 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2021-12-22 19:53:47,824 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-22 19:53:47,824 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-22 19:53:47,825 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-22 19:53:47,825 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-22 19:53:47,825 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-22 19:53:47,825 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-12-22 19:53:47,826 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
[2021-12-22 19:53:48,002 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-22 19:53:48,018 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-22 19:53:48,020 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-22 19:53:48,021 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-22 19:53:48,022 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-22 19:53:48,022 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
[2021-12-22 19:53:48,062 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9966541/6d6756f714b6485bb624b6488b451ec1/FLAG19ad68cb9
[2021-12-22 19:53:48,420 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-22 19:53:48,422 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2021-12-22 19:53:48,432 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9966541/6d6756f714b6485bb624b6488b451ec1/FLAG19ad68cb9
[2021-12-22 19:53:48,446 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9966541/6d6756f714b6485bb624b6488b451ec1
[2021-12-22 19:53:48,453 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-22 19:53:48,453 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-22 19:53:48,455 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-22 19:53:48,455 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-22 19:53:48,457 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-22 19:53:48,458 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,458 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3889b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48, skipping insertion in model container
[2021-12-22 19:53:48,458 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,462 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-22 19:53:48,486 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-22 19:53:48,663 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 19:53:48,668 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-22 19:53:48,710 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 19:53:48,725 INFO  L208         MainTranslator]: Completed translation
[2021-12-22 19:53:48,726 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48 WrapperNode
[2021-12-22 19:53:48,726 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-22 19:53:48,727 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-22 19:53:48,727 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-22 19:53:48,727 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-22 19:53:48,737 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,761 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,774 INFO  L137                Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58
[2021-12-22 19:53:48,775 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-22 19:53:48,775 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-22 19:53:48,775 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-22 19:53:48,775 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-22 19:53:48,780 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,780 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,782 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,782 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,786 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,793 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,795 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,796 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-22 19:53:48,796 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-22 19:53:48,796 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-22 19:53:48,796 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-22 19:53:48,801 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (1/1) ...
[2021-12-22 19:53:48,806 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-12-22 19:53:48,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 19:53:48,827 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-12-22 19:53:48,828 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2021-12-22 19:53:48,852 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-12-22 19:53:48,852 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-22 19:53:48,852 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-22 19:53:48,852 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-22 19:53:48,852 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-22 19:53:48,852 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-22 19:53:48,908 INFO  L234             CfgBuilder]: Building ICFG
[2021-12-22 19:53:48,910 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-22 19:53:49,038 INFO  L275             CfgBuilder]: Performing block encoding
[2021-12-22 19:53:49,042 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-22 19:53:49,043 INFO  L299             CfgBuilder]: Removed 2 assume(true) statements.
[2021-12-22 19:53:49,044 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:53:49 BoogieIcfgContainer
[2021-12-22 19:53:49,044 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-22 19:53:49,056 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-12-22 19:53:49,056 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2021-12-22 19:53:49,058 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2021-12-22 19:53:49,059 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-12-22 19:53:49,059 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:53:48" (1/3) ...
[2021-12-22 19:53:49,060 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2063df7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:53:49, skipping insertion in model container
[2021-12-22 19:53:49,060 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-12-22 19:53:49,060 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:48" (2/3) ...
[2021-12-22 19:53:49,061 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2063df7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:53:49, skipping insertion in model container
[2021-12-22 19:53:49,061 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-12-22 19:53:49,061 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:53:49" (3/3) ...
[2021-12-22 19:53:49,062 INFO  L388   chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i
[2021-12-22 19:53:49,099 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2021-12-22 19:53:49,099 INFO  L360         BuchiCegarLoop]: Hoare is false
[2021-12-22 19:53:49,099 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-12-22 19:53:49,099 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-12-22 19:53:49,099 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-12-22 19:53:49,100 INFO  L364         BuchiCegarLoop]: Difference is false
[2021-12-22 19:53:49,100 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-12-22 19:53:49,100 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-12-22 19:53:49,109 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)
[2021-12-22 19:53:49,119 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2021-12-22 19:53:49,119 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-12-22 19:53:49,119 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-12-22 19:53:49,122 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-12-22 19:53:49,122 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-12-22 19:53:49,122 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2021-12-22 19:53:49,123 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)
[2021-12-22 19:53:49,123 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2021-12-22 19:53:49,123 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-12-22 19:53:49,124 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-12-22 19:53:49,124 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-12-22 19:53:49,124 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-12-22 19:53:49,128 INFO  L791   eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~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); 6#L552-4true 
[2021-12-22 19:53:49,128 INFO  L793   eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13#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); 12#L553-4true assume !true; 5#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; 6#L552-4true 
[2021-12-22 19:53:49,132 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2021-12-22 19:53:49,138 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,138 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302275162]
[2021-12-22 19:53:49,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,139 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,275 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 19:53:49,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,325 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 19:53:49,328 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,329 INFO  L85        PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times
[2021-12-22 19:53:49,329 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,330 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860929039]
[2021-12-22 19:53:49,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,330 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 19:53:49,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:49,384 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 19:53:49,385 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860929039]
[2021-12-22 19:53:49,385 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860929039] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 19:53:49,385 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 19:53:49,385 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 19:53:49,386 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147486185]
[2021-12-22 19:53:49,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 19:53:49,389 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-12-22 19:53:49,389 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 19:53:49,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2021-12-22 19:53:49,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-12-22 19:53:49,414 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)
[2021-12-22 19:53:49,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 19:53:49,419 INFO  L93              Difference]: Finished difference Result 12 states and 13 transitions.
[2021-12-22 19:53:49,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-12-22 19:53:49,423 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions.
[2021-12-22 19:53:49,425 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2021-12-22 19:53:49,427 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions.
[2021-12-22 19:53:49,427 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2021-12-22 19:53:49,428 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 8
[2021-12-22 19:53:49,428 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions.
[2021-12-22 19:53:49,429 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 19:53:49,429 INFO  L681         BuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2021-12-22 19:53:49,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions.
[2021-12-22 19:53:49,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2021-12-22 19:53:49,446 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)
[2021-12-22 19:53:49,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions.
[2021-12-22 19:53:49,447 INFO  L704         BuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2021-12-22 19:53:49,447 INFO  L587         BuchiCegarLoop]: Abstraction has 8 states and 9 transitions.
[2021-12-22 19:53:49,447 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2021-12-22 19:53:49,448 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions.
[2021-12-22 19:53:49,449 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2021-12-22 19:53:49,449 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-12-22 19:53:49,449 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-12-22 19:53:49,449 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-12-22 19:53:49,449 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2021-12-22 19:53:49,450 INFO  L791   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 
[2021-12-22 19:53:49,450 INFO  L793   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 
[2021-12-22 19:53:49,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,452 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2021-12-22 19:53:49,452 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,452 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913856299]
[2021-12-22 19:53:49,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,452 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,487 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 19:53:49,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,499 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 19:53:49,499 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times
[2021-12-22 19:53:49,500 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,500 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017909971]
[2021-12-22 19:53:49,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,500 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 19:53:49,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:49,552 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 19:53:49,553 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017909971]
[2021-12-22 19:53:49,553 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017909971] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 19:53:49,553 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 19:53:49,553 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-12-22 19:53:49,553 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283332715]
[2021-12-22 19:53:49,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 19:53:49,554 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-12-22 19:53:49,554 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 19:53:49,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-12-22 19:53:49,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-12-22 19:53:49,555 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)
[2021-12-22 19:53:49,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 19:53:49,588 INFO  L93              Difference]: Finished difference Result 11 states and 12 transitions.
[2021-12-22 19:53:49,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-12-22 19:53:49,589 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2021-12-22 19:53:49,589 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2021-12-22 19:53:49,590 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions.
[2021-12-22 19:53:49,590 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 11
[2021-12-22 19:53:49,590 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2021-12-22 19:53:49,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions.
[2021-12-22 19:53:49,591 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 19:53:49,591 INFO  L681         BuchiCegarLoop]: Abstraction has 11 states and 12 transitions.
[2021-12-22 19:53:49,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions.
[2021-12-22 19:53:49,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10.
[2021-12-22 19:53:49,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 19:53:49,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions.
[2021-12-22 19:53:49,593 INFO  L704         BuchiCegarLoop]: Abstraction has 10 states and 11 transitions.
[2021-12-22 19:53:49,593 INFO  L587         BuchiCegarLoop]: Abstraction has 10 states and 11 transitions.
[2021-12-22 19:53:49,593 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2021-12-22 19:53:49,593 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions.
[2021-12-22 19:53:49,594 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2021-12-22 19:53:49,594 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-12-22 19:53:49,594 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-12-22 19:53:49,595 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-12-22 19:53:49,595 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1]
[2021-12-22 19:53:49,595 INFO  L791   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 
[2021-12-22 19:53:49,596 INFO  L793   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 
[2021-12-22 19:53:49,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,596 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2021-12-22 19:53:49,597 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,597 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756349813]
[2021-12-22 19:53:49,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,598 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,639 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 19:53:49,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:49,648 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 19:53:49,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:49,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times
[2021-12-22 19:53:49,649 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:49,649 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183591922]
[2021-12-22 19:53:49,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,649 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:49,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 19:53:49,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:49,727 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 19:53:49,727 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183591922]
[2021-12-22 19:53:49,728 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183591922] provided 0 perfect and 1 imperfect interpolant sequences
[2021-12-22 19:53:49,728 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399150100]
[2021-12-22 19:53:49,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:49,729 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-12-22 19:53:49,729 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 19:53:49,740 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-12-22 19:53:49,741 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2021-12-22 19:53:49,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 19:53:49,802 INFO  L263         TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core
[2021-12-22 19:53:49,806 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 19:53:49,860 INFO  L387             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
[2021-12-22 19:53:49,930 INFO  L353             Elim1Store]: treesize reduction 16, result has 65.2 percent of original size
[2021-12-22 19:53:49,930 INFO  L387             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
[2021-12-22 19:53:50,033 INFO  L387             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
[2021-12-22 19:53:50,049 INFO  L387             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
[2021-12-22 19:53:50,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:50,057 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 19:53:50,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:50,091 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [399150100] provided 0 perfect and 2 imperfect interpolant sequences
[2021-12-22 19:53:50,091 INFO  L186   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2021-12-22 19:53:50,091 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10
[2021-12-22 19:53:50,091 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943083065]
[2021-12-22 19:53:50,091 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2021-12-22 19:53:50,092 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-12-22 19:53:50,092 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 19:53:50,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-22 19:53:50,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2021-12-22 19:53:50,093 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)
[2021-12-22 19:53:50,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 19:53:50,145 INFO  L93              Difference]: Finished difference Result 20 states and 21 transitions.
[2021-12-22 19:53:50,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-22 19:53:50,146 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions.
[2021-12-22 19:53:50,146 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 18
[2021-12-22 19:53:50,147 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions.
[2021-12-22 19:53:50,147 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 20
[2021-12-22 19:53:50,147 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 20
[2021-12-22 19:53:50,147 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions.
[2021-12-22 19:53:50,147 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 19:53:50,147 INFO  L681         BuchiCegarLoop]: Abstraction has 20 states and 21 transitions.
[2021-12-22 19:53:50,148 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions.
[2021-12-22 19:53:50,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19.
[2021-12-22 19:53:50,149 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)
[2021-12-22 19:53:50,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions.
[2021-12-22 19:53:50,149 INFO  L704         BuchiCegarLoop]: Abstraction has 19 states and 20 transitions.
[2021-12-22 19:53:50,149 INFO  L587         BuchiCegarLoop]: Abstraction has 19 states and 20 transitions.
[2021-12-22 19:53:50,149 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2021-12-22 19:53:50,149 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions.
[2021-12-22 19:53:50,150 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2021-12-22 19:53:50,150 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-12-22 19:53:50,150 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-12-22 19:53:50,150 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-12-22 19:53:50,151 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1]
[2021-12-22 19:53:50,151 INFO  L791   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 
[2021-12-22 19:53:50,151 INFO  L793   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 
[2021-12-22 19:53:50,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:50,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2021-12-22 19:53:50,152 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:50,152 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652013536]
[2021-12-22 19:53:50,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:50,152 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:50,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:50,161 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 19:53:50,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 19:53:50,167 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 19:53:50,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 19:53:50,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times
[2021-12-22 19:53:50,168 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 19:53:50,168 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146675780]
[2021-12-22 19:53:50,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 19:53:50,169 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 19:53:50,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 19:53:50,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:50,558 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 19:53:50,559 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146675780]
[2021-12-22 19:53:50,559 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146675780] provided 0 perfect and 1 imperfect interpolant sequences
[2021-12-22 19:53:50,559 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41593281]
[2021-12-22 19:53:50,559 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2021-12-22 19:53:50,559 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-12-22 19:53:50,559 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 19:53:50,561 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-12-22 19:53:50,562 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2021-12-22 19:53:50,657 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-12-22 19:53:50,657 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-12-22 19:53:50,659 INFO  L263         TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core
[2021-12-22 19:53:50,665 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 19:53:50,677 INFO  L387             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
[2021-12-22 19:53:50,712 INFO  L353             Elim1Store]: treesize reduction 16, result has 65.2 percent of original size
[2021-12-22 19:53:50,713 INFO  L387             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
[2021-12-22 19:53:50,802 INFO  L387             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
[2021-12-22 19:53:50,895 INFO  L353             Elim1Store]: treesize reduction 16, result has 65.2 percent of original size
[2021-12-22 19:53:50,896 INFO  L387             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
[2021-12-22 19:53:50,981 INFO  L387             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
[2021-12-22 19:53:51,073 INFO  L353             Elim1Store]: treesize reduction 16, result has 65.2 percent of original size
[2021-12-22 19:53:51,074 INFO  L387             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
[2021-12-22 19:53:51,174 INFO  L387             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
[2021-12-22 19:53:51,242 INFO  L353             Elim1Store]: treesize reduction 16, result has 65.2 percent of original size
[2021-12-22 19:53:51,242 INFO  L387             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
[2021-12-22 19:53:51,323 INFO  L387             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
[2021-12-22 19:53:51,330 INFO  L387             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
[2021-12-22 19:53:51,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 19:53:51,334 INFO  L328         TraceCheckSpWp]: Computing backward predicates...