./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-simple/dll2n_prepend_equal.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 --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:58:04,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:58:04,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:58:04,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:58:04,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:58:04,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:58:04,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:58:04,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:58:04,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:58:04,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:58:04,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:58:04,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:58:04,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:58:04,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:58:04,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:58:04,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:58:04,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:58:04,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:58:04,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:58:04,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:58:04,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:58:04,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:58:04,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:58:04,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:58:04,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:58:04,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:58:04,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:58:04,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:58:04,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:58:04,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:58:04,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:58:04,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:58:04,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:04,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:58:04,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:58:04,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:58:04,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:58:04,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-08 13:58:04,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:58:04,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:58:04,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:58:04,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:58:04,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:58:04,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-08 13:58:05,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:58:05,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:58:05,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-08 13:58:05,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39befde0/45afc7aec16c4ecf8a9bc1341d4c1dc1/FLAGa0fe9dd92 [2024-11-08 13:58:06,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39befde0/45afc7aec16c4ecf8a9bc1341d4c1dc1 [2024-11-08 13:58:06,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:58:06,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:58:06,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:06,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:58:06,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:58:06,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06, skipping insertion in model container [2024-11-08 13:58:06,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:58:06,517 WARN L250 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-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-08 13:58:06,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:06,525 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:58:06,553 WARN L250 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-simple/dll2n_prepend_equal.i[24361,24374] [2024-11-08 13:58:06,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:06,584 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:58:06,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06 WrapperNode [2024-11-08 13:58:06,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:06,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:06,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:58:06,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:58:06,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,622 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2024-11-08 13:58:06,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:06,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:58:06,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:58:06,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:58:06,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,652 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-08 13:58:06,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:58:06,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:58:06,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:58:06,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:58:06,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (1/1) ... [2024-11-08 13:58:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:06,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:58:06,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:58:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 13:58:06,741 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:58:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:58:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:58:06,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:58:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:58:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:58:06,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:58:06,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:58:06,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:58:06,884 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 13:58:07,002 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-08 13:58:07,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:58:07,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:58:07,019 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:58:07,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:07 BoogieIcfgContainer [2024-11-08 13:58:07,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:58:07,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:58:07,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:58:07,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:58:07,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:58:06" (1/3) ... [2024-11-08 13:58:07,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7d310f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:07, skipping insertion in model container [2024-11-08 13:58:07,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:06" (2/3) ... [2024-11-08 13:58:07,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7d310f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:07, skipping insertion in model container [2024-11-08 13:58:07,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:07" (3/3) ... [2024-11-08 13:58:07,027 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-08 13:58:07,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:58:07,040 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:58:07,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:58:07,111 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eb4df27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:58:07,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:58:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 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) [2024-11-08 13:58:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 13:58:07,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:07,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:07,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:07,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 692830707, now seen corresponding path program 1 times [2024-11-08 13:58:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838067839] [2024-11-08 13:58:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838067839] [2024-11-08 13:58:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838067839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:07,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:58:07,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998664451] [2024-11-08 13:58:07,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:58:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:58:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:58:07,305 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-11-08 13:58:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:07,316 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-11-08 13:58:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:58:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2024-11-08 13:58:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:07,322 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:58:07,322 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 13:58:07,326 INFO L431 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 [2024-11-08 13:58:07,329 INFO L432 NwaCegarLoop]: 36 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, 36 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 [2024-11-08 13:58:07,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 13:58:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-08 13:58:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2024-11-08 13:58:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 13:58:07,353 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-11-08 13:58:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 13:58:07,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2024-11-08 13:58:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 13:58:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 13:58:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:07,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:58:07,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1759740954, now seen corresponding path program 1 times [2024-11-08 13:58:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175590916] [2024-11-08 13:58:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175590916] [2024-11-08 13:58:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175590916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629883515] [2024-11-08 13:58:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:07,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:07,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:07,502 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-08 13:58:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:07,515 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-08 13:58:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-08 13:58:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:07,516 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:58:07,516 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 13:58:07,516 INFO L431 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 [2024-11-08 13:58:07,517 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 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 [2024-11-08 13:58:07,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 13:58:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-08 13:58:07,523 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) [2024-11-08 13:58:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-08 13:58:07,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2024-11-08 13:58:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:07,524 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-08 13:58:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-08 13:58:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-08 13:58:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:58:07,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:07,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:07,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:58:07,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 675600054, now seen corresponding path program 1 times [2024-11-08 13:58:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:07,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171769514] [2024-11-08 13:58:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171769514] [2024-11-08 13:58:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171769514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342997217] [2024-11-08 13:58:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:07,634 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-08 13:58:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:07,661 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-08 13:58:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-08 13:58:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:07,662 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:58:07,662 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 13:58:07,663 INFO L431 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 [2024-11-08 13:58:07,664 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:07,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 13:58:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 13:58:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2024-11-08 13:58:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-08 13:58:07,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2024-11-08 13:58:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:07,671 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-08 13:58:07,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-08 13:58:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-08 13:58:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:58:07,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:07,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:07,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:58:07,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:07,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -335517196, now seen corresponding path program 1 times [2024-11-08 13:58:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609474935] [2024-11-08 13:58:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609474935] [2024-11-08 13:58:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609474935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231505207] [2024-11-08 13:58:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:07,783 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) [2024-11-08 13:58:07,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:58:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:07,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:58:07,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:08,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231505207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:08,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:08,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 13:58:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463749416] [2024-11-08 13:58:08,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:08,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:58:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:58:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:58:08,042 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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) [2024-11-08 13:58:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:08,058 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-08 13:58:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:58:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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) Word has length 19 [2024-11-08 13:58:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:08,060 INFO L225 Difference]: With dead ends: 39 [2024-11-08 13:58:08,061 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:58:08,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:58:08,062 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:08,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:58:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 13:58:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2024-11-08 13:58:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-08 13:58:08,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2024-11-08 13:58:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:08,065 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-08 13:58:08,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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) [2024-11-08 13:58:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-08 13:58:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:58:08,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:08,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:08,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:58:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:08,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1568046744, now seen corresponding path program 1 times [2024-11-08 13:58:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498356126] [2024-11-08 13:58:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498356126] [2024-11-08 13:58:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498356126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 13:58:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342548922] [2024-11-08 13:58:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:08,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:58:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:58:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:58:08,964 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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) [2024-11-08 13:58:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:09,136 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-08 13:58:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:58:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 24 [2024-11-08 13:58:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:09,137 INFO L225 Difference]: With dead ends: 32 [2024-11-08 13:58:09,137 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 13:58:09,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:58:09,139 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:09,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 60 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 13:58:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-08 13:58:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2024-11-08 13:58:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-08 13:58:09,144 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2024-11-08 13:58:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:09,144 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-08 13:58:09,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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) [2024-11-08 13:58:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-08 13:58:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:58:09,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:09,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:58:09,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1568048418, now seen corresponding path program 1 times [2024-11-08 13:58:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594536225] [2024-11-08 13:58:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:09,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:09,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594536225] [2024-11-08 13:58:09,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594536225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:09,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:58:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768174962] [2024-11-08 13:58:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:09,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:58:09,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:58:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:58:09,333 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:09,375 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-08 13:58:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:58:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 13:58:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:09,376 INFO L225 Difference]: With dead ends: 31 [2024-11-08 13:58:09,377 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:58:09,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:58:09,378 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:09,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:58:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:58:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2024-11-08 13:58:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-08 13:58:09,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-11-08 13:58:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:09,384 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-08 13:58:09,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-08 13:58:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 13:58:09,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:09,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:58:09,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 640634787, now seen corresponding path program 1 times [2024-11-08 13:58:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872113514] [2024-11-08 13:58:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872113514] [2024-11-08 13:58:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872113514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760513832] [2024-11-08 13:58:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:10,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:10,423 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) [2024-11-08 13:58:10,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:58:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:10,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-08 13:58:10,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:10,595 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:10,683 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:10,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-08 13:58:10,784 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 13:58:10,968 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-08 13:58:10,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 13:58:11,047 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:58:11,104 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-08 13:58:11,111 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:58:11,119 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-08 13:58:11,192 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:11,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-08 13:58:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:11,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-08 13:58:11,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:11,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-08 13:58:11,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-08 13:58:11,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:11,292 INFO L378 Elim1Store]: Elim1 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 50 treesize of output 30 [2024-11-08 13:58:11,333 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 15 [2024-11-08 13:58:11,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:11,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:11,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (+ (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8)) (.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_556)) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_557) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 v_ArrVal_558)) .cse2) .cse3)))))) is different from false [2024-11-08 13:58:11,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,610 INFO L378 Elim1Store]: Elim1 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 166 treesize of output 167 [2024-11-08 13:58:11,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 332 treesize of output 331 [2024-11-08 13:58:11,650 INFO L378 Elim1Store]: Elim1 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 151 treesize of output 135 [2024-11-08 13:58:11,660 INFO L378 Elim1Store]: Elim1 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 1782 treesize of output 1662 [2024-11-08 13:58:50,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse88 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse89 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse4 (select .cse89 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select .cse88 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse74 (+ .cse2 4)) (.cse54 (= .cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse53 (not .cse54)) (.cse48 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse74)) (.cse6 (+ .cse2 8)) (.cse83 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse89 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse88 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (= .cse73 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse10 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse83)) (.cse8 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse87 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse87 .cse4 (store (select .cse87 .cse4) .cse6 v_ArrVal_556))) v_arrayElimCell_19) v_ArrVal_558)))) (.cse22 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse86 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse85 (select (store .cse86 .cse4 (store (select .cse86 .cse4) .cse6 v_ArrVal_556)) v_arrayElimCell_19))) (or (= (select .cse85 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse85 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse86 v_arrayElimCell_19) .cse2))))))) (.cse38 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse84 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (or (= (select (select (store .cse84 .cse4 (store (select .cse84 .cse4) .cse6 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse84 v_arrayElimCell_19) .cse2)))))) (.cse42 (= .cse4 .cse83)) (.cse69 (or .cse53 (and (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse80 (select (let ((.cse81 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse81 .cse4 (store (select .cse81 .cse4) .cse6 v_ArrVal_556))) v_arrayElimCell_19))) (or (forall ((v_ArrVal_558 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse80 v_ArrVal_558))) (= (select .cse80 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|)))) (or .cse48 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (= (select (select (let ((.cse82 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse82 .cse4 (store (select .cse82 .cse4) .cse6 v_ArrVal_556))) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|))))))) (let ((.cse27 (and (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse75 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse76 (store (select .cse75 .cse4) .cse6 v_ArrVal_556))) (or (= (select (select (store .cse75 .cse4 .cse76) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse76 v_arrayElimCell_20)))))) .cse48) .cse69 (forall ((v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse78 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse79 (store (select .cse78 .cse4) .cse6 v_ArrVal_556))) (or (forall ((v_arrayElimCell_19 Int)) (let ((.cse77 (select (store .cse78 .cse4 .cse79) v_arrayElimCell_19))) (or (forall ((v_ArrVal_558 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse77 v_ArrVal_558))) (= (select .cse77 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse79 v_arrayElimCell_20)))))))) (.cse7 (not .cse42)) (.cse0 (= .cse73 .cse74)) (.cse32 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse71 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse72 (store (select .cse71 .cse4) .cse6 v_ArrVal_556))) (let ((.cse70 (select (store .cse71 .cse4 .cse72) v_arrayElimCell_19))) (or (= (select .cse70 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse70 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse71 v_arrayElimCell_19) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse72 v_arrayElimCell_20)))))))) (.cse21 (and (forall ((v_arrayElimCell_18 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse46 (let ((.cse47 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse47 .cse4 (store (select .cse47 .cse4) .cse6 v_ArrVal_556))))) (or (forall ((v_arrayElimCell_19 Int)) (let ((.cse45 (select .cse46 v_arrayElimCell_19))) (or (forall ((v_ArrVal_558 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 v_ArrVal_558))) (= (select .cse45 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse46 v_arrayElimCell_18) v_arrayElimCell_20))))) (or (not .cse48) (and (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse50 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse49 (store .cse50 .cse4 (store (select .cse50 .cse4) .cse6 v_ArrVal_556)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_arrayElimCell_18) v_arrayElimCell_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_18) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_arrayElimCell_19) v_ArrVal_558)))))) (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse51 (let ((.cse52 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse52 .cse4 (store (select .cse52 .cse4) .cse6 v_ArrVal_556))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_18) v_arrayElimCell_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_19) v_ArrVal_558))))) (or .cse8 .cse53))) (or .cse54 (and (forall ((v_arrayElimCell_18 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse55 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_18) .cse2)) (forall ((v_arrayElimCell_20 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse55 .cse4 (store (select .cse55 .cse4) .cse6 v_ArrVal_556)) v_arrayElimCell_18) v_arrayElimCell_20)))))) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse56 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse56 .cse4 (store (select .cse56 .cse4) .cse6 v_ArrVal_556))) v_arrayElimCell_18) v_arrayElimCell_20))))) (or .cse22 .cse53) (or .cse48 (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse57 (let ((.cse58 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (store .cse58 .cse4 (store (select .cse58 .cse4) .cse6 v_ArrVal_556))))) (or (= (select (select .cse57 v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_18) v_arrayElimCell_20)))))) (or .cse48 (and (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse60 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse59 (store .cse60 .cse4 (store (select .cse60 .cse4) .cse6 v_ArrVal_556)))) (or (= (select (select .cse59 v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_18) v_arrayElimCell_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse60 v_arrayElimCell_19) .cse2)))))) (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse62 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse61 (store .cse62 .cse4 (store (select .cse62 .cse4) .cse6 v_ArrVal_556)))) (or (= (select (select .cse61 v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse61 v_arrayElimCell_18) v_arrayElimCell_20))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_18) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse62 v_arrayElimCell_19) .cse2))))) (or .cse53 .cse38))) (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse65 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse64 (store .cse65 .cse4 (store (select .cse65 .cse4) .cse6 v_ArrVal_556)))) (let ((.cse63 (select .cse64 v_arrayElimCell_19))) (or (= (select .cse63 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_18) v_arrayElimCell_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_18) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse65 v_arrayElimCell_19) .cse2))))))) (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse68 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse67 (store .cse68 .cse4 (store (select .cse68 .cse4) .cse6 v_ArrVal_556)))) (let ((.cse66 (select .cse67 v_arrayElimCell_19))) (or (= (select .cse66 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_18) v_arrayElimCell_20)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_19) .cse2))))))) .cse69)) (.cse12 (not .cse10)) (.cse15 (not .cse11))) (and (or (not .cse0) (let ((.cse9 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse17 (store (select .cse16 .cse4) .cse6 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 .cse4 .cse17) v_arrayElimCell_19) v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_20)))))))) (and (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse1 (select .cse3 .cse4))) (let ((.cse5 (store .cse1 .cse6 v_ArrVal_556))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse3 .cse4 .cse5) v_arrayElimCell_19) v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 v_arrayElimCell_20))))))) (or .cse7 .cse8) (or .cse9 .cse10) (or .cse11 .cse9) (or .cse12 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse13 (select .cse14 .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 .cse4 (store .cse13 .cse6 v_ArrVal_556)) v_arrayElimCell_19) v_ArrVal_558)))))) .cse15)))) (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse18 (select .cse20 .cse4))) (let ((.cse19 (select (store .cse20 .cse4 (store .cse18 .cse6 v_ArrVal_556)) v_arrayElimCell_19))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 .cse2)) (= (select .cse19 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_19) .cse2))))))) .cse12 .cse15) (or .cse11 .cse21) (or .cse7 .cse22) (or (and (or .cse7 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_ArrVal_556 Int)) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 .cse4 (store (select .cse23 .cse4) .cse6 v_ArrVal_556)) v_arrayElimCell_19) v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_19) .cse2)))))) (or (and (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 .cse4) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_19) .cse2))))) (or .cse7 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) v_arrayElimCell_19) .cse2))))) .cse0) (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse25 (select .cse26 .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_19) .cse2)) (forall ((v_ArrVal_558 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse26 .cse4 (store .cse25 .cse6 v_ArrVal_556)) v_arrayElimCell_19) v_ArrVal_558)))))))) .cse12 .cse15) (or .cse11 .cse27) (or .cse27 .cse10) (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse28 (select .cse30 .cse4))) (let ((.cse31 (store .cse28 .cse6 v_ArrVal_556))) (let ((.cse29 (select (store .cse30 .cse4 .cse31) v_arrayElimCell_19))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse2)) (= (select .cse29 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_19) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_20)))))))) (or .cse10 .cse32) (or (let ((.cse39 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse40 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse41 (store (select .cse40 .cse4) .cse6 v_ArrVal_556))) (or (= (select (select (store .cse40 .cse4 .cse41) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_19) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 v_arrayElimCell_20)))))))) (and (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse33 (select .cse34 .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_arrayElimCell_19) .cse2)) (forall ((v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse35 (store .cse33 .cse6 v_ArrVal_556))) (or (= (select (select (store .cse34 .cse4 .cse35) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 v_arrayElimCell_20))))))))) (or .cse12 (forall ((v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse37 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552))) (let ((.cse36 (select .cse37 .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse2)) (= (select (select (store .cse37 .cse4 (store .cse36 .cse6 v_ArrVal_556)) v_arrayElimCell_19) v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_arrayElimCell_19) .cse2)))))) .cse15) (or .cse7 .cse38) (or .cse11 .cse39) (or .cse39 .cse10))) .cse0) (or .cse11 .cse32) (or .cse10 .cse21) (or .cse42 (let ((.cse43 (forall ((v_ArrVal_552 (Array Int Int)) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) .cse4) .cse6 v_ArrVal_556) v_arrayElimCell_20))))) (and (or .cse43 .cse10) (or .cse11 .cse43) (or .cse12 (forall ((v_ArrVal_552 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) .cse4) .cse2))) .cse15) (forall ((v_ArrVal_552 (Array Int Int)) (v_ArrVal_556 Int)) (let ((.cse44 (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse2)) (forall ((v_arrayElimCell_20 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store .cse44 .cse6 v_ArrVal_556) v_arrayElimCell_20)))))))))))))))) is different from false [2024-11-08 13:58:51,964 INFO L378 Elim1Store]: Elim1 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 977 treesize of output 833 [2024-11-08 13:58:51,977 INFO L378 Elim1Store]: Elim1 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 837 treesize of output 641 [2024-11-08 13:58:52,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:52,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-08 13:58:56,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse12 (= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) 0)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (forall ((v_prenex_62 (Array Int Int)) (v_prenex_92 Int) (v_prenex_94 Int)) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_62) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store .cse0 .cse1 v_prenex_94) v_prenex_92)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|))) (or .cse2 (forall ((v_prenex_83 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_86 Int) (v_prenex_82 Int)) (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548))) (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store v_prenex_83 .cse1 v_prenex_86)) v_prenex_82))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_prenex_85)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_83) v_prenex_82) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_prenex_84))))))) (or (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_70 (Array Int Int)) (v_prenex_69 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse5 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548))) (or (= (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store v_prenex_70 .cse1 v_prenex_72)) v_prenex_69) v_prenex_71) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_70) v_prenex_69) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) .cse2) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_93 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_93) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|))) (or (and (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_46 Int) (v_prenex_47 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_47))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse1 v_prenex_49)) v_prenex_46) v_prenex_48)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_prenex_46) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_78 Int) (v_prenex_79 (Array Int Int)) (v_prenex_81 Int) (v_prenex_80 Int)) (let ((.cse10 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_79))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse9 (store .cse8 .cse1 v_prenex_81))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_prenex_80)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_prenex_78) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) v_prenex_78) v_prenex_80))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) (or .cse2 (forall ((v_ArrVal_548 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_prenex_53 Int) (v_prenex_50 Int)) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_51) v_prenex_50) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store v_prenex_51 .cse1 v_prenex_53)) v_prenex_50) v_prenex_52))))))) .cse12) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_64 (Array Int Int)) (v_prenex_63 Int) (v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_556 Int)) (let ((.cse16 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_64))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse13 (store .cse15 .cse1 v_ArrVal_556))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13) v_prenex_63))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 v_arrayElimCell_20)) (= (select .cse14 v_arrayElimCell_20) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_ArrVal_558)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_prenex_63) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) (or (and (or (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_552 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_552) v_arrayElimCell_19) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) .cse2) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_44 Int) (v_prenex_45 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_45))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_44) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0))))) .cse12) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (forall ((v_prenex_67 Int) (v_prenex_68 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_66))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse18 .cse1 v_prenex_68)) v_prenex_65) v_prenex_67)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (and (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_58 Int) (v_prenex_91 Int) (v_prenex_61 Int) (v_prenex_60 Int) (v_prenex_59 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_59))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse20 (store .cse22 4 v_prenex_61))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_prenex_91)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse20) v_prenex_58) v_prenex_60)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 (- 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_90 Int) (v_prenex_89 Int) (v_prenex_87 (Array Int Int)) (v_prenex_88 Int)) (let ((.cse24 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_87))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 (- 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 4 v_prenex_89)) v_prenex_90) v_prenex_88)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) (or .cse2 (forall ((v_ArrVal_548 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_prenex_56 Int) (v_prenex_54 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_2) v_prenex_54) v_prenex_56))))) (not .cse12)) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int)) (or (forall ((v_prenex_77 Int) (v_prenex_74 (Array Int Int)) (v_prenex_73 Int) (v_prenex_76 Int) (v_prenex_75 Int)) (let ((.cse25 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_prenex_74))) (let ((.cse27 (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse26 (select (store .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse27 .cse1 v_prenex_77)) v_prenex_73))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_prenex_73) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_prenex_75)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_prenex_76))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))))) is different from false [2024-11-08 13:58:58,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:58,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 25486 treesize of output 25860 [2024-11-08 13:58:59,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:59,434 INFO L378 Elim1Store]: Elim1 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 7014 treesize of output 6975 [2024-11-08 13:58:59,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:59,809 INFO L378 Elim1Store]: Elim1 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 7026 treesize of output 7011 [2024-11-08 13:59:00,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,209 INFO L378 Elim1Store]: Elim1 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 7026 treesize of output 7027 [2024-11-08 13:59:00,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,576 INFO L378 Elim1Store]: Elim1 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 7018 treesize of output 7023 [2024-11-08 13:59:00,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,998 INFO L378 Elim1Store]: Elim1 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 7110 treesize of output 7075 [2024-11-08 13:59:01,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:01,387 INFO L378 Elim1Store]: Elim1 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 7114 treesize of output 7101 [2024-11-08 13:59:01,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:01,776 INFO L378 Elim1Store]: Elim1 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 7140 treesize of output 7133 [2024-11-08 13:59:02,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:02,195 INFO L378 Elim1Store]: Elim1 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 7220 treesize of output 7197 [2024-11-08 13:59:02,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:02,596 INFO L378 Elim1Store]: Elim1 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 7200 treesize of output 7205 [2024-11-08 13:59:03,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:03,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7388 treesize of output 7337 [2024-11-08 13:59:03,418 INFO L378 Elim1Store]: Elim1 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 7312 treesize of output 7310 [2024-11-08 13:59:03,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:03,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7418 treesize of output 7403 [2024-11-08 13:59:04,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7594 treesize of output 7539 [2024-11-08 13:59:04,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:04,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7614 treesize of output 7603 [2024-11-08 13:59:05,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7622 treesize of output 7635 [2024-11-08 13:59:05,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7610 treesize of output 7629 [2024-11-08 13:59:06,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:06,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7700 treesize of output 7687 [2024-11-08 13:59:06,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:06,915 INFO L378 Elim1Store]: Elim1 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 7686 treesize of output 7687 [2024-11-08 13:59:07,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:07,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7728 treesize of output 7737 [2024-11-08 13:59:08,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:08,012 INFO L378 Elim1Store]: Elim1 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 7788 treesize of output 7763 [2024-11-08 13:59:08,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:08,553 INFO L378 Elim1Store]: Elim1 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 7792 treesize of output 7785 [2024-11-08 13:59:09,043 INFO L378 Elim1Store]: Elim1 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 7774 treesize of output 7770 [2024-11-08 13:59:09,541 INFO L378 Elim1Store]: Elim1 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 7770 treesize of output 7768 [2024-11-08 13:59:10,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:10,124 INFO L378 Elim1Store]: Elim1 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 7768 treesize of output 7773 [2024-11-08 13:59:10,694 INFO L378 Elim1Store]: Elim1 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 7764 treesize of output 7752 [2024-11-08 13:59:11,230 INFO L378 Elim1Store]: Elim1 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 7752 treesize of output 7746 [2024-11-08 13:59:11,747 INFO L378 Elim1Store]: Elim1 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 7746 treesize of output 7744 [2024-11-08 13:59:12,268 INFO L378 Elim1Store]: Elim1 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 7744 treesize of output 7740