./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:47:19,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:47:19,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:47:20,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:47:20,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:47:20,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:47:20,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:47:20,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:47:20,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:47:20,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:47:20,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:47:20,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:47:20,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:47:20,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:47:20,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:47:20,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:47:20,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:47:20,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:47:20,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:47:20,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:47:20,073 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:47:20,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:47:20,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:47:20,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:47:20,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:47:20,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:47:20,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:47:20,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:47:20,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:47:20,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:47:20,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:47:20,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:47:20,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:47:20,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:47:20,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:47:20,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:47:20,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:47:20,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:47:20,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:47:20,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:47:20,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:47:20,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:47:20,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:47:20,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:47:20,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:47:20,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:47:20,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:47:20,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:47:20,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:47:20,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:47:20,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:47:20,127 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:47:20,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:47:20,128 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:47:20,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:47:20,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:47:20,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:47:20,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:47:20,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:47:20,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:47:20,129 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:47:20,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:47:20,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:47:20,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:47:20,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:47:20,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:47:20,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:47:20,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:47:20,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:47:20,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:47:20,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:47:20,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:47:20,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:47:20,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:47:20,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:47:20,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:47:20,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 [2022-07-22 14:47:20,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:47:20,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:47:20,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:47:20,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:47:20,378 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:47:20,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2022-07-22 14:47:20,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627a13f1e/8d115dbce3d44f4ba2bc3d6cb8e82235/FLAG1c9df8c41 [2022-07-22 14:47:20,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:47:20,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2022-07-22 14:47:20,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627a13f1e/8d115dbce3d44f4ba2bc3d6cb8e82235/FLAG1c9df8c41 [2022-07-22 14:47:21,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627a13f1e/8d115dbce3d44f4ba2bc3d6cb8e82235 [2022-07-22 14:47:21,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:47:21,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:47:21,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:47:21,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:47:21,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:47:21,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36353c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21, skipping insertion in model container [2022-07-22 14:47:21,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:47:21,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:47:21,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2022-07-22 14:47:21,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:47:21,588 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:47:21,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i[23210,23223] [2022-07-22 14:47:21,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:47:21,677 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:47:21,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21 WrapperNode [2022-07-22 14:47:21,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:47:21,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:47:21,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:47:21,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:47:21,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,741 INFO L137 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-07-22 14:47:21,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:47:21,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:47:21,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:47:21,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:47:21,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:47:21,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:47:21,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:47:21,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:47:21,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (1/1) ... [2022-07-22 14:47:21,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:47:21,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:47:21,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:47:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:47:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-22 14:47:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-22 14:47:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:47:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:47:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:47:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:47:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:47:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:47:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:47:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:47:21,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:47:21,940 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:47:21,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:47:22,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-22 14:47:22,157 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:47:22,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:47:22,163 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:47:22,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:47:22 BoogieIcfgContainer [2022-07-22 14:47:22,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:47:22,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:47:22,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:47:22,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:47:22,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:47:21" (1/3) ... [2022-07-22 14:47:22,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14aca60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:47:22, skipping insertion in model container [2022-07-22 14:47:22,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:47:21" (2/3) ... [2022-07-22 14:47:22,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14aca60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:47:22, skipping insertion in model container [2022-07-22 14:47:22,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:47:22" (3/3) ... [2022-07-22 14:47:22,185 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2022-07-22 14:47:22,196 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:47:22,210 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:47:22,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:47:22,270 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e58b7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cfdda31 [2022-07-22 14:47:22,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:47:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:47:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:47:22,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:22,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:22,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2087165485, now seen corresponding path program 1 times [2022-07-22 14:47:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:22,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870074211] [2022-07-22 14:47:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:22,468 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-22 14:47:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:22,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870074211] [2022-07-22 14:47:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870074211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:47:22,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:47:22,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:47:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633652762] [2022-07-22 14:47:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:47:22,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:47:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:47:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:47:22,509 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 4.5) internal successors, (9), 2 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-22 14:47:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:22,525 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-07-22 14:47:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:47:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) Word has length 9 [2022-07-22 14:47:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:22,533 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:47:22,533 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 14:47:22,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:47:22,540 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:22,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:47:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 14:47:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-22 14:47:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-22 14:47:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-22 14:47:22,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2022-07-22 14:47:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:22,573 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-22 14:47:22,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-22 14:47:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-22 14:47:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 14:47:22,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:22,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:22,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:47:22,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2034265922, now seen corresponding path program 1 times [2022-07-22 14:47:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:22,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062987407] [2022-07-22 14:47:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:22,656 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-22 14:47:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:22,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062987407] [2022-07-22 14:47:22,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062987407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:47:22,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:47:22,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:47:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590078517] [2022-07-22 14:47:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:47:22,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:47:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:47:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:47:22,662 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 14:47:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:22,692 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-07-22 14:47:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:47:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2022-07-22 14:47:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:22,693 INFO L225 Difference]: With dead ends: 28 [2022-07-22 14:47:22,693 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 14:47:22,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:47:22,699 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:22,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:47:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 14:47:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 14:47:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:47:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-22 14:47:22,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-07-22 14:47:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:22,707 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 14:47:22,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 14:47:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-22 14:47:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 14:47:22,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:22,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:22,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:47:22,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1977007620, now seen corresponding path program 1 times [2022-07-22 14:47:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002824387] [2022-07-22 14:47:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:22,755 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-22 14:47:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:22,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002824387] [2022-07-22 14:47:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002824387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:47:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:47:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:47:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559239015] [2022-07-22 14:47:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:47:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:47:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:47:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:47:22,758 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 14:47:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:22,788 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-07-22 14:47:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:47:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Word has length 11 [2022-07-22 14:47:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:22,789 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:47:22,790 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 14:47:22,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:47:22,791 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:22,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:47:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 14:47:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-07-22 14:47:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-22 14:47:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-22 14:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-07-22 14:47:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:22,796 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-22 14:47:22,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 14:47:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-22 14:47:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:47:22,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:22,797 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:22,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:47:22,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1102443704, now seen corresponding path program 1 times [2022-07-22 14:47:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:22,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17564057] [2022-07-22 14:47:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:47:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:22,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17564057] [2022-07-22 14:47:22,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17564057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:47:22,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:47:22,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:47:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923516574] [2022-07-22 14:47:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:47:22,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:47:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:22,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:47:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:47:22,892 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 14:47:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:22,935 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-07-22 14:47:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:47:22,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Word has length 16 [2022-07-22 14:47:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:22,937 INFO L225 Difference]: With dead ends: 32 [2022-07-22 14:47:22,937 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:47:22,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:47:22,940 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:22,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:47:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:47:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-07-22 14:47:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:47:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 14:47:22,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-07-22 14:47:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:22,949 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 14:47:22,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 14:47:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 14:47:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 14:47:22,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:22,950 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:22,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:47:22,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash 379985990, now seen corresponding path program 1 times [2022-07-22 14:47:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:22,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325270735] [2022-07-22 14:47:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:23,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325270735] [2022-07-22 14:47:23,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325270735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:47:23,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912737128] [2022-07-22 14:47:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:23,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:47:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:47:23,067 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-22 14:47:23,070 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-22 14:47:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:23,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:47:23,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:47:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:23,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:47:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:23,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912737128] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:47:23,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:47:23,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-22 14:47:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716312485] [2022-07-22 14:47:23,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:47:23,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:47:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:47:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:47:23,257 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-22 14:47:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:23,348 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-07-22 14:47:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 14:47:23,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) Word has length 21 [2022-07-22 14:47:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:23,350 INFO L225 Difference]: With dead ends: 56 [2022-07-22 14:47:23,350 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 14:47:23,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:47:23,351 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:23,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:47:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 14:47:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-22 14:47:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:47:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-07-22 14:47:23,357 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2022-07-22 14:47:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-07-22 14:47:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-22 14:47:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-07-22 14:47:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 14:47:23,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:23,358 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:23,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 14:47:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:47:23,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1481516270, now seen corresponding path program 2 times [2022-07-22 14:47:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:23,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215059496] [2022-07-22 14:47:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:23,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215059496] [2022-07-22 14:47:23,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215059496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:47:23,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192250083] [2022-07-22 14:47:23,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:47:23,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:47:23,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:47:23,776 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-22 14:47:23,787 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-22 14:47:23,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:47:23,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:47:23,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 14:47:23,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:47:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:23,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:47:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:47:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192250083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:47:24,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:47:24,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-22 14:47:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436203930] [2022-07-22 14:47:24,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:47:24,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 14:47:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:47:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 14:47:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-07-22 14:47:24,074 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-22 14:47:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:47:24,268 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-07-22 14:47:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 14:47:24,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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) Word has length 36 [2022-07-22 14:47:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:47:24,270 INFO L225 Difference]: With dead ends: 86 [2022-07-22 14:47:24,270 INFO L226 Difference]: Without dead ends: 70 [2022-07-22 14:47:24,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-07-22 14:47:24,271 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:47:24,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 87 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:47:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-22 14:47:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-22 14:47:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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-22 14:47:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-07-22 14:47:24,279 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2022-07-22 14:47:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:47:24,279 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-07-22 14:47:24,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-22 14:47:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-07-22 14:47:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 14:47:24,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:47:24,281 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:47:24,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:47:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 14:47:24,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:47:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:47:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1904311442, now seen corresponding path program 3 times [2022-07-22 14:47:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:47:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412126338] [2022-07-22 14:47:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:47:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:47:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:47:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-22 14:47:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:47:25,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412126338] [2022-07-22 14:47:25,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412126338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:47:25,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436079975] [2022-07-22 14:47:25,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:47:25,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:47:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:47:25,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:47:25,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:47:34,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-22 14:47:34,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:47:34,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-22 14:47:34,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:47:34,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:47:34,535 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:47:34,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:47:34,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:47:34,626 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:47:34,627 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 1 case distinctions, treesize of input 36 treesize of output 34 [2022-07-22 14:47:34,691 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:47:34,692 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-22 14:47:34,749 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:34,750 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 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-22 14:47:34,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 14:47:34,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:47:34,861 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:47:34,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 34 [2022-07-22 14:47:34,926 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:34,926 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-22 14:47:35,007 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-07-22 14:47:35,083 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:35,084 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-22 14:47:35,130 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-07-22 14:47:35,182 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:35,183 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-22 14:47:35,232 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-07-22 14:47:35,284 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:35,284 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-22 14:47:35,341 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-07-22 14:47:35,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:47:35,386 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-22 14:47:35,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:47:35,464 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-07-22 14:47:35,558 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-22 14:47:35,558 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 39 treesize of output 56 [2022-07-22 14:47:35,568 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-22 14:47:35,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-22 14:47:35,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-22 14:47:35,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2022-07-22 14:47:35,760 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:47:35,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2022-07-22 14:47:35,866 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-22 14:47:35,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2022-07-22 14:47:35,972 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-22 14:47:35,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 45 [2022-07-22 14:47:37,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-07-22 14:47:37,409 INFO L356 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2022-07-22 14:47:37,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 78 [2022-07-22 14:47:37,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:47:37,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:47:39,190 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-22 14:47:39,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 172 [2022-07-22 14:47:39,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:39,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-07-22 14:47:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 69 proven. 145 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-22 14:47:39,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:47:39,991 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 78 treesize of output 74 [2022-07-22 14:47:40,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) (and (or .cse0 (< 2 |c_ULTIMATE.start_main_~counter~0#1|)) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) is different from false [2022-07-22 14:47:40,065 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) (and (or .cse0 (< 2 |c_ULTIMATE.start_main_~counter~0#1|)) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0))) |c_ULTIMATE.start_main_#t~short5#1|) is different from false [2022-07-22 14:47:40,083 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_619 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) is different from false [2022-07-22 14:47:40,098 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_619 (Array Int Int)) (v_subst_2 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_2 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_619 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) is different from false [2022-07-22 14:47:40,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:40,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2022-07-22 14:47:40,150 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_ArrVal_619 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:40,210 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_2 Int)) (or (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_ArrVal_619 (Array Int Int)) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_1) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:40,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:40,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2022-07-22 14:47:40,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:40,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2022-07-22 14:47:40,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:40,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 116 [2022-07-22 14:47:40,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-22 14:47:40,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-22 14:47:40,707 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (select v_arrayElimArr_2 4))) (or (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse1 0) (= .cse0 .cse1)))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse3 (select v_prenex_5 4))) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse2 v_prenex_5) .cse3 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse2 0) (= (select v_arrayElimArr_1 4) 0) (= .cse3 0) (= .cse2 .cse3)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 14:47:40,835 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (.cse1 (select v_arrayElimArr_2 4))) (or (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_4 v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse0 .cse1) (= .cse1 0)))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (.cse3 (select v_prenex_5 4))) (or (= .cse2 .cse3) (= .cse2 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_3 v_arrayElimArr_3) .cse2 v_prenex_5) .cse3 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 4) 0) (= .cse3 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 14:47:40,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:40,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 120 [2022-07-22 14:47:40,979 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse0 .cse1) (= .cse0 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= .cse3 0) (= .cse2 0))))))) is different from false [2022-07-22 14:47:41,134 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= .cse0 .cse1) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse0 0) (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= .cse3 0) (= .cse2 0)))) (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:41,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:41,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 136 [2022-07-22 14:47:41,318 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= .cse0 .cse1) (= .cse0 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= .cse3 0) (= .cse2 0)))) (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:41,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_11 4) 0) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse1 .cse0) (= .cse1 0) (= .cse0 0)))) (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_7 Int) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_prenex_9 4)) (.cse3 (select v_prenex_5 4))) (or (= .cse2 .cse3) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_7 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse2 v_prenex_5) .cse3 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse2 0) (= (select v_arrayElimArr_1 4) 0) (= .cse3 0) (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 14:47:41,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:41,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 152 [2022-07-22 14:47:41,755 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= .cse0 .cse1) (= .cse0 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (= (select v_arrayElimArr_4 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_prenex_4 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= .cse3 0) (= .cse2 0))))))) is different from false [2022-07-22 14:47:41,993 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse0 .cse1) (= .cse0 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_ArrVal_619 (Array Int Int)) (v_subst_4 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int)) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= .cse3 0) (= .cse2 0)))) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:42,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:42,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 168 [2022-07-22 14:47:42,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int) (v_subst_8 Int) (v_ArrVal_619 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_10 v_prenex_15) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse1 .cse0) (= .cse1 0) (= .cse0 0) (= (select v_prenex_15 4) 0)))) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse2 (select v_prenex_9 4)) (.cse3 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_6 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse2 v_prenex_5) .cse3 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse2 .cse3) (= .cse2 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse3 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 14:47:42,550 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_6 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_12 v_arrayElimArr_7) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse0 .cse1) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= .cse0 0) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int) (v_subst_8 Int) (v_ArrVal_619 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_2 4)) (.cse3 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse2 .cse3) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_11 v_arrayElimArr_7) v_subst_10 v_prenex_15) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse3 v_arrayElimArr_2) .cse2 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse2 0) (= .cse3 0) (= (select v_prenex_15 4) 0)))) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0)))) is different from false [2022-07-22 14:47:42,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:42,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 184 [2022-07-22 14:47:42,833 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int) (v_subst_8 Int) (v_ArrVal_619 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_11 v_prenex_17) v_subst_10 v_prenex_15) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse1 .cse0) (= 0 (select v_prenex_17 4)) (= .cse1 0) (= .cse0 0) (= (select v_prenex_15 4) 0)))) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse2 (select v_prenex_9 4)) (.cse3 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_6 4) 0) (= .cse2 .cse3) (= .cse2 0) (= 0 (select v_arrayElimArr_7 4)) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_12 v_arrayElimArr_7) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse2 v_prenex_5) .cse3 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse3 0) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 14:47:43,148 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= .cse0 .cse1) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) v_subst_14 v_arrayElimArr_8) v_subst_12 v_arrayElimArr_7) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= .cse0 0) (= 0 (select v_arrayElimArr_7 4)) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_569 (Array Int Int))) (or (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int) (v_subst_8 Int) (v_ArrVal_619 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) v_subst_13 v_arrayElimArr_8) v_subst_11 v_prenex_17) v_subst_10 v_prenex_15) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= 0 (select v_prenex_17 4)) (= .cse3 0) (= .cse2 0) (= (select v_prenex_15 4) 0))))))) is different from false [2022-07-22 14:47:43,365 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_12 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_2 Int) (v_prenex_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int))) (let ((.cse0 (select v_prenex_9 4)) (.cse1 (select v_prenex_5 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_8 4) 0) (= .cse0 .cse1) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) v_subst_14 v_arrayElimArr_8) v_subst_12 v_arrayElimArr_7) v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_13) v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_9) .cse0 v_prenex_5) .cse1 v_arrayElimArr_1) v_subst_2 v_prenex_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= .cse0 0) (= 0 (select v_arrayElimArr_7 4)) (= (select v_prenex_13 4) 0) (= (select v_arrayElimArr_1 4) 0) (= .cse1 0) (= (select v_arrayElimArr_4 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_569 (Array Int Int))) (or (= (select v_arrayElimArr_8 4) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_13 Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_11 Int) (v_prenex_4 (Array Int Int)) (v_subst_10 Int) (v_subst_1 Int) (v_subst_8 Int) (v_ArrVal_619 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_2 4)) (.cse2 (select v_arrayElimArr_3 4))) (or (= (select v_prenex_11 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) v_subst_13 v_arrayElimArr_8) v_subst_11 v_prenex_17) v_subst_10 v_prenex_15) v_subst_8 v_arrayElimArr_5) v_subst_6 v_prenex_11) v_subst_4 v_arrayElimArr_3) .cse2 v_arrayElimArr_2) .cse3 v_prenex_4) v_subst_1 v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= (select v_prenex_4 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= .cse3 .cse2) (= 0 (select v_prenex_17 4)) (= .cse3 0) (= .cse2 0) (= (select v_prenex_15 4) 0))))))) is different from false [2022-07-22 14:47:43,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:47:43,616 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55