./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:13:13,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:13:13,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:13:13,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:13:13,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:13:13,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:13:13,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:13:13,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:13:13,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:13:13,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:13:13,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:13:13,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:13:13,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:13:13,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:13:13,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:13:13,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:13:13,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:13:13,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:13,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:13,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:13,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:13:13,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:13:13,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:13:13,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:13:13,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:13:13,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2025-04-30 10:13:13,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:13:13,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:13:13,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:13:13,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:13:13,456 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:13:13,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2025-04-30 10:13:14,840 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a68e51b/9b335aad1f164bcfa417188712473359/FLAGfc77d54d2 [2025-04-30 10:13:15,098 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:13:15,098 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2025-04-30 10:13:15,114 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a68e51b/9b335aad1f164bcfa417188712473359/FLAGfc77d54d2 [2025-04-30 10:13:15,890 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a68e51b/9b335aad1f164bcfa417188712473359 [2025-04-30 10:13:15,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:13:15,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:13:15,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:15,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:13:15,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:13:15,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:15" (1/1) ... [2025-04-30 10:13:15,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5a9e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:15, skipping insertion in model container [2025-04-30 10:13:15,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:15" (1/1) ... [2025-04-30 10:13:15,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:13:16,248 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2025-04-30 10:13:16,255 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:16,265 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:13:16,339 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2025-04-30 10:13:16,341 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:16,363 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:13:16,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16 WrapperNode [2025-04-30 10:13:16,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:16,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:16,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:13:16,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:13:16,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,401 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 153 [2025-04-30 10:13:16,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:16,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:13:16,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:13:16,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:13:16,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,445 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-04-30 10:13:16,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:13:16,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:13:16,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:13:16,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:13:16,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (1/1) ... [2025-04-30 10:13:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:16,501 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) [2025-04-30 10:13:16,505 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 [2025-04-30 10:13:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-30 10:13:16,527 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:13:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:13:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:13:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:13:16,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:13:16,640 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:13:16,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:13:16,658 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-30 10:13:16,844 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-04-30 10:13:16,844 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:13:16,853 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:13:16,853 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:13:16,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:16 BoogieIcfgContainer [2025-04-30 10:13:16,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:13:16,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:13:16,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:13:16,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:13:16,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:13:15" (1/3) ... [2025-04-30 10:13:16,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cb5b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:16, skipping insertion in model container [2025-04-30 10:13:16,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:16" (2/3) ... [2025-04-30 10:13:16,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cb5b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:16, skipping insertion in model container [2025-04-30 10:13:16,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:16" (3/3) ... [2025-04-30 10:13:16,862 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2025-04-30 10:13:16,873 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:13:16,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_unequal.i that has 2 procedures, 35 locations, 52 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-30 10:13:16,916 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:13:16,927 INFO L340 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;@5fd9fae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:13:16,927 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:13:16,931 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 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) [2025-04-30 10:13:16,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:13:16,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:16,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:16,937 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:16,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 44296471, now seen corresponding path program 1 times [2025-04-30 10:13:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:16,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405398147] [2025-04-30 10:13:16,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:17,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:13:17,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:13:17,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:17,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:17,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405398147] [2025-04-30 10:13:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405398147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:17,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264932543] [2025-04-30 10:13:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:17,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:17,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:17,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:17,348 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 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 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) [2025-04-30 10:13:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:17,382 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2025-04-30 10:13:17,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:17,384 INFO L79 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 [2025-04-30 10:13:17,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:17,389 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:13:17,390 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:13:17,393 INFO L436 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 [2025-04-30 10:13:17,397 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 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 [2025-04-30 10:13:17,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:13:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-04-30 10:13:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2025-04-30 10:13:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-04-30 10:13:17,425 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 14 [2025-04-30 10:13:17,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:17,425 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-04-30 10:13:17,426 INFO L486 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) [2025-04-30 10:13:17,426 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-04-30 10:13:17,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:13:17,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:17,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:17,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:13:17,428 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:17,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -982223710, now seen corresponding path program 1 times [2025-04-30 10:13:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:17,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017156232] [2025-04-30 10:13:17,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:17,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:13:17,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:13:17,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:17,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017156232] [2025-04-30 10:13:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017156232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112158202] [2025-04-30 10:13:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:17,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:17,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:17,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:17,544 INFO L87 Difference]: Start difference. First operand 26 states and 36 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) [2025-04-30 10:13:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:17,567 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2025-04-30 10:13:17,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:17,569 INFO L79 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 [2025-04-30 10:13:17,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:17,570 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:13:17,570 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:13:17,571 INFO L436 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 [2025-04-30 10:13:17,571 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 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 [2025-04-30 10:13:17,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:13:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:13:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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) [2025-04-30 10:13:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-04-30 10:13:17,577 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2025-04-30 10:13:17,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:17,577 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-04-30 10:13:17,577 INFO L486 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) [2025-04-30 10:13:17,577 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-04-30 10:13:17,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:13:17,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:17,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:17,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:13:17,578 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:17,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1993340960, now seen corresponding path program 1 times [2025-04-30 10:13:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:17,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855947034] [2025-04-30 10:13:17,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:17,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:17,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:13:17,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:13:17,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:17,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:17,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855947034] [2025-04-30 10:13:17,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855947034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:17,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144174452] [2025-04-30 10:13:17,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:17,735 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) [2025-04-30 10:13:17,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:13:17,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:13:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:13:17,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:17,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:17,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:13:17,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:17,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144174452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:17,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:13:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6163283] [2025-04-30 10:13:17,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:17,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:13:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:17,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:13:17,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:13:17,957 INFO L87 Difference]: Start difference. First operand 29 states and 39 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) [2025-04-30 10:13:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:17,996 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2025-04-30 10:13:17,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:13:17,998 INFO L79 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 [2025-04-30 10:13:17,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:17,998 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:13:17,998 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:13:17,998 INFO L436 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 [2025-04-30 10:13:17,999 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:17,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:13:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-30 10:13:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:13:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-04-30 10:13:18,006 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 19 [2025-04-30 10:13:18,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:18,006 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-04-30 10:13:18,006 INFO L486 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) [2025-04-30 10:13:18,006 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-04-30 10:13:18,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:13:18,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:18,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:18,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:13:18,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:18,214 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:18,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -20370567, now seen corresponding path program 1 times [2025-04-30 10:13:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:18,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552360102] [2025-04-30 10:13:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:18,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:13:18,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:13:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:18,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552360102] [2025-04-30 10:13:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552360102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910796613] [2025-04-30 10:13:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:18,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:18,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:18,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:18,309 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2025-04-30 10:13:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:18,330 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2025-04-30 10:13:18,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:18,331 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 [2025-04-30 10:13:18,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:18,331 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:13:18,331 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:13:18,331 INFO L436 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 [2025-04-30 10:13:18,332 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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 [2025-04-30 10:13:18,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:13:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-30 10:13:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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) [2025-04-30 10:13:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-04-30 10:13:18,334 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 24 [2025-04-30 10:13:18,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:18,337 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-04-30 10:13:18,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) [2025-04-30 10:13:18,337 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-04-30 10:13:18,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:13:18,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:18,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:18,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:13:18,338 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:18,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1711375531, now seen corresponding path program 1 times [2025-04-30 10:13:18,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:18,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225341715] [2025-04-30 10:13:18,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:18,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:13:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:13:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:18,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:19,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225341715] [2025-04-30 10:13:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225341715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:19,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468503273] [2025-04-30 10:13:19,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:19,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:19,913 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) [2025-04-30 10:13:19,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:13:19,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:13:20,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:13:20,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:20,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:20,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-30 10:13:20,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:20,326 INFO L354 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 [2025-04-30 10:13:20,457 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:20,457 INFO L354 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 [2025-04-30 10:13:20,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-04-30 10:13:20,561 INFO L354 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 [2025-04-30 10:13:20,608 INFO L354 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 [2025-04-30 10:13:20,616 INFO L354 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 [2025-04-30 10:13:20,819 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:13:20,820 INFO L354 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 [2025-04-30 10:13:20,922 INFO L354 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 [2025-04-30 10:13:20,932 INFO L354 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 [2025-04-30 10:13:21,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-30 10:13:21,123 INFO L354 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-04-30 10:13:21,127 INFO L354 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 [2025-04-30 10:13:21,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:21,179 INFO L354 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 31 treesize of output 15 [2025-04-30 10:13:21,218 INFO L354 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 19 treesize of output 11 [2025-04-30 10:13:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:21,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:21,293 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_479) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_479 (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_479 .cse0))))))) is different from false [2025-04-30 10:13:21,317 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_475)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_478))) (or (not (= v_ArrVal_479 (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 (select v_ArrVal_479 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_479) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-04-30 10:13:21,347 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2 v_ArrVal_475)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_478))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| 8))) (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) .cse1 (select v_ArrVal_479 .cse1))) v_ArrVal_479)) (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| v_ArrVal_479) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2025-04-30 10:13:21,365 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) .cse1 v_ArrVal_475)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_478))) (or (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= (select (select (store .cse2 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| v_ArrVal_479) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_479 (let ((.cse3 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| 8))) (store (select .cse2 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) .cse3 (select v_ArrVal_479 .cse3))))))))) is different from false [2025-04-30 10:13:21,389 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| .cse2 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_472) .cse2) .cse3 v_ArrVal_475)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_478))) (or (not (= v_ArrVal_479 (let ((.cse1 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| 8))) (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) .cse1 (select v_ArrVal_479 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| v_ArrVal_479) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_15| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_470) .cse2) .cse3)))))) is different from false [2025-04-30 10:13:21,434 INFO L354 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 118 treesize of output 90 [2025-04-30 10:13:21,440 INFO L354 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 94 treesize of output 74 [2025-04-30 10:13:21,862 INFO L325 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2025-04-30 10:13:21,863 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 314 treesize of output 296 [2025-04-30 10:13:21,888 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:21,889 INFO L354 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 471 treesize of output 465 [2025-04-30 10:13:21,921 INFO L325 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2025-04-30 10:13:21,921 INFO L354 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 2 case distinctions, treesize of input 352 treesize of output 324 [2025-04-30 10:13:21,973 INFO L325 Elim1Store]: treesize reduction 63, result has 45.7 percent of original size [2025-04-30 10:13:21,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 337 treesize of output 372 [2025-04-30 10:13:22,007 INFO L325 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-04-30 10:13:22,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 284 treesize of output 271 [2025-04-30 10:13:22,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,035 INFO L354 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-04-30 10:13:22,082 INFO L354 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 69 treesize of output 57 [2025-04-30 10:13:22,116 INFO L354 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 62 treesize of output 54 [2025-04-30 10:13:22,139 INFO L354 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 28 treesize of output 24 [2025-04-30 10:13:22,238 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 6 [2025-04-30 10:13:22,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,717 INFO L354 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 28 treesize of output 30 [2025-04-30 10:13:22,782 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,783 INFO L354 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 28 treesize of output 32 [2025-04-30 10:13:22,807 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,808 INFO L354 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 22 treesize of output 26 [2025-04-30 10:13:22,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,909 INFO L354 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 28 treesize of output 32 [2025-04-30 10:13:22,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,950 INFO L354 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 22 treesize of output 26 [2025-04-30 10:13:22,980 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:22,981 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 497 treesize of output 545 [2025-04-30 10:13:23,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 142 [2025-04-30 10:13:23,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 141 [2025-04-30 10:13:23,971 INFO L325 Elim1Store]: treesize reduction 103, result has 45.2 percent of original size [2025-04-30 10:13:23,972 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 814 treesize of output 882 [2025-04-30 10:13:24,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:24,556 INFO L354 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 194 treesize of output 204 [2025-04-30 10:13:24,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:24,610 INFO L354 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 194 treesize of output 204 [2025-04-30 10:13:24,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:24,734 INFO L354 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 194 treesize of output 204 [2025-04-30 10:13:24,864 INFO L325 Elim1Store]: treesize reduction 69, result has 48.5 percent of original size [2025-04-30 10:13:24,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 238 treesize of output 260 [2025-04-30 10:13:24,925 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:24,929 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:24,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:24,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 149 [2025-04-30 10:13:25,159 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:25,159 INFO L354 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 52 treesize of output 50 [2025-04-30 10:13:25,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:25,174 INFO L354 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 87 treesize of output 91 [2025-04-30 10:13:25,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:25,185 INFO L354 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 78 treesize of output 70 [2025-04-30 10:13:25,195 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:25,195 INFO L354 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 81 treesize of output 85 [2025-04-30 10:13:25,199 INFO L354 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 41 treesize of output 29 [2025-04-30 10:13:25,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:25,213 INFO L354 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 81 treesize of output 85 [2025-04-30 10:13:25,221 INFO L354 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 41 treesize of output 29 [2025-04-30 10:13:25,230 INFO L354 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 21 treesize of output 17 [2025-04-30 10:13:25,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:25,241 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:25,245 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:25,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-04-30 10:13:25,263 INFO L354 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 7 treesize of output 3 [2025-04-30 10:13:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-30 10:13:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468503273] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:25,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-04-30 10:13:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773499035] [2025-04-30 10:13:25,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:25,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:13:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:25,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:13:25,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1508, Unknown=11, NotChecked=410, Total=2070 [2025-04-30 10:13:25,564 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 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) [2025-04-30 10:13:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:27,169 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2025-04-30 10:13:27,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:13:27,169 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 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 25 [2025-04-30 10:13:27,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:27,170 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:13:27,170 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:13:27,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=2594, Unknown=11, NotChecked=540, Total=3422 [2025-04-30 10:13:27,171 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:27,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 360 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1215 Invalid, 0 Unknown, 354 Unchecked, 0.9s Time] [2025-04-30 10:13:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:13:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2025-04-30 10:13:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 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) [2025-04-30 10:13:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2025-04-30 10:13:27,178 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 25 [2025-04-30 10:13:27,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:27,178 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2025-04-30 10:13:27,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 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) [2025-04-30 10:13:27,178 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2025-04-30 10:13:27,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:13:27,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:27,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:27,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:27,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:27,382 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:27,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1711382475, now seen corresponding path program 1 times [2025-04-30 10:13:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:27,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090428808] [2025-04-30 10:13:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:27,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:13:27,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:13:27,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:27,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:27,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090428808] [2025-04-30 10:13:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090428808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:27,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:27,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:13:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6799565] [2025-04-30 10:13:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:27,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:13:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:27,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:13:27,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:13:27,641 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2025-04-30 10:13:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:27,843 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2025-04-30 10:13:27,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:13:27,843 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 25 [2025-04-30 10:13:27,843 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:27,844 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:13:27,844 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:13:27,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:13:27,844 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:27,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:13:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:13:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2025-04-30 10:13:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2025-04-30 10:13:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-04-30 10:13:27,853 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 25 [2025-04-30 10:13:27,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:27,853 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-04-30 10:13:27,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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) [2025-04-30 10:13:27,853 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2025-04-30 10:13:27,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:13:27,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:27,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:27,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:13:27,853 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:27,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1894329579, now seen corresponding path program 1 times [2025-04-30 10:13:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:27,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587684333] [2025-04-30 10:13:27,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:27,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:13:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:13:27,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:27,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:27,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587684333] [2025-04-30 10:13:27,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587684333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:27,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:13:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552622547] [2025-04-30 10:13:27,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:27,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:13:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:13:27,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:13:27,928 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2025-04-30 10:13:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:27,938 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-04-30 10:13:27,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:13:27,939 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 25 [2025-04-30 10:13:27,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:27,939 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:13:27,939 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:13:27,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:13:27,940 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 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 [2025-04-30 10:13:27,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:13:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-04-30 10:13:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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) [2025-04-30 10:13:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-04-30 10:13:27,944 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 25 [2025-04-30 10:13:27,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:27,944 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-04-30 10:13:27,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2025-04-30 10:13:27,944 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2025-04-30 10:13:27,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:13:27,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:27,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:27,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:13:27,945 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:27,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash -439070279, now seen corresponding path program 2 times [2025-04-30 10:13:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:27,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725884785] [2025-04-30 10:13:27,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:13:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:27,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-30 10:13:27,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:27,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:13:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:28,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725884785] [2025-04-30 10:13:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725884785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:28,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:28,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:13:28,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366033667] [2025-04-30 10:13:28,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:28,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:13:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:28,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:13:28,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:13:28,036 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:13:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:28,053 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-04-30 10:13:28,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:13:28,053 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:13:28,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:28,054 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:13:28,054 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:13:28,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:13:28,054 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:28,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:13:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-04-30 10:13:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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) [2025-04-30 10:13:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-04-30 10:13:28,058 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 26 [2025-04-30 10:13:28,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:28,058 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-04-30 10:13:28,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:13:28,058 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-04-30 10:13:28,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:13:28,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:28,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:28,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:13:28,058 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:28,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 250191907, now seen corresponding path program 1 times [2025-04-30 10:13:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:28,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844410782] [2025-04-30 10:13:28,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:28,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:28,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:28,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:28,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:28,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844410782] [2025-04-30 10:13:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844410782] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:28,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853638145] [2025-04-30 10:13:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:28,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:28,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:28,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:13:28,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:28,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:28,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:28,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:28,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:13:28,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:28,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853638145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:28,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-30 10:13:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307148219] [2025-04-30 10:13:28,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:28,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:13:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:28,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:13:28,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:13:28,312 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:13:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:28,368 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-04-30 10:13:28,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:13:28,369 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:13:28,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:28,369 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:13:28,369 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:13:28,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:13:28,370 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:28,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:13:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-30 10:13:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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) [2025-04-30 10:13:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-04-30 10:13:28,373 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2025-04-30 10:13:28,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:28,374 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-04-30 10:13:28,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:13:28,374 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-04-30 10:13:28,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:13:28,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:28,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:28,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:28,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:28,579 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:28,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash 307450209, now seen corresponding path program 1 times [2025-04-30 10:13:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:28,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155813570] [2025-04-30 10:13:28,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:28,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:28,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:28,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:28,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:28,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155813570] [2025-04-30 10:13:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155813570] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:28,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017235104] [2025-04-30 10:13:28,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:28,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:28,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:28,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:13:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:13:28,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:13:28,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:28,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:28,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:13:28,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:28,845 INFO L354 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 16 treesize of output 8 [2025-04-30 10:13:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:28,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:28,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017235104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:28,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-04-30 10:13:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452769166] [2025-04-30 10:13:28,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:28,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:13:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:13:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:13:28,873 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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) [2025-04-30 10:13:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:28,941 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-04-30 10:13:28,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:13:28,941 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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) Word has length 26 [2025-04-30 10:13:28,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:28,942 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:13:28,942 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:13:28,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:13:28,942 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:28,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:13:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-30 10:13:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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) [2025-04-30 10:13:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-30 10:13:28,945 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 26 [2025-04-30 10:13:28,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:28,945 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-30 10:13:28,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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) [2025-04-30 10:13:28,946 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-30 10:13:28,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:13:28,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:28,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:28,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:13:29,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:29,147 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:29,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -340563642, now seen corresponding path program 1 times [2025-04-30 10:13:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:29,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404688957] [2025-04-30 10:13:29,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:13:29,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:13:29,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:13:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:29,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404688957] [2025-04-30 10:13:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404688957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:29,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787824419] [2025-04-30 10:13:29,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:29,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:29,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:13:29,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:13:29,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:13:29,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:29,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:29,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:13:29,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:29,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:13:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787824419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:29,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-30 10:13:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681684250] [2025-04-30 10:13:29,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:29,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:13:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:29,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:13:29,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:13:29,504 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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) [2025-04-30 10:13:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:29,579 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-04-30 10:13:29,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:13:29,580 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 27 [2025-04-30 10:13:29,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:29,580 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:13:29,580 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:13:29,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:13:29,580 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:29,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 169 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:13:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-04-30 10:13:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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) [2025-04-30 10:13:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-04-30 10:13:29,584 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2025-04-30 10:13:29,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:29,585 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-04-30 10:13:29,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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) [2025-04-30 10:13:29,585 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-04-30 10:13:29,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:13:29,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:29,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:29,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:29,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:13:29,787 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:29,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -340556698, now seen corresponding path program 1 times [2025-04-30 10:13:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:29,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237066140] [2025-04-30 10:13:29,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:29,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:13:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:13:29,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:29,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:30,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237066140] [2025-04-30 10:13:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237066140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:30,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126698527] [2025-04-30 10:13:30,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:30,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:30,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:30,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:13:30,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:13:30,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:13:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:30,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-04-30 10:13:30,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:30,974 INFO L354 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 [2025-04-30 10:13:31,029 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:31,030 INFO L354 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 [2025-04-30 10:13:31,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-04-30 10:13:31,117 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:13:31,117 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-04-30 10:13:31,213 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:13:31,214 INFO L354 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 28 treesize of output 30 [2025-04-30 10:13:31,291 INFO L354 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 11 treesize of output 7 [2025-04-30 10:13:31,296 INFO L354 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 48 treesize of output 31 [2025-04-30 10:13:31,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:31,492 INFO L354 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 40 treesize of output 22 [2025-04-30 10:13:31,505 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:13:31,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2025-04-30 10:13:31,520 INFO L325 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-04-30 10:13:31,520 INFO L354 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 73 [2025-04-30 10:13:31,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2025-04-30 10:13:31,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-04-30 10:13:31,597 INFO L354 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 63 treesize of output 40 [2025-04-30 10:13:31,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-04-30 10:13:31,607 INFO L354 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 20 treesize of output 15 [2025-04-30 10:13:31,666 INFO L354 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 61 treesize of output 37 [2025-04-30 10:13:31,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-04-30 10:13:31,722 INFO L354 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 [2025-04-30 10:13:31,777 INFO L354 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 15 treesize of output 7 [2025-04-30 10:13:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:31,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:31,847 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1350) .cse0) .cse1))))) is different from false [2025-04-30 10:13:31,862 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:31,862 INFO L354 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 91 treesize of output 92 [2025-04-30 10:13:31,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:31,876 INFO L354 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 346 treesize of output 345 [2025-04-30 10:13:31,883 INFO L354 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 322 treesize of output 306 [2025-04-30 10:13:31,892 INFO L354 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 156 treesize of output 148 [2025-04-30 10:13:32,225 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5))) (let ((.cse20 (not .cse9)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse17 4)) (.cse8 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5))) (let ((.cse10 (not .cse8)) (.cse16 (or .cse20 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)) v_arrayElimCell_100))))) (.cse18 (or (and (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (= (select (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)) v_arrayElimCell_97) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse8) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)))) (or (= (select .cse24 v_arrayElimCell_97) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_99)))))) .cse9)) (.cse19 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_100)) (= (select .cse21 v_arrayElimCell_97) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (or (and (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_99))))) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse8)) .cse9) (or .cse10 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_100)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_99)))))) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)) v_arrayElimCell_99))) .cse10) (or (and (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340))) (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_100))))) .cse16) .cse8) (or (= .cse17 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse18 (or (and .cse19 .cse16) .cse8))) (or (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse5) (and .cse18 (or (and (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_42) .cse3 v_ArrVal_1344)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1351) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1352) .cse5) .cse6)) v_arrayElimCell_100) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse20) .cse19) .cse8)))))))) is different from false [2025-04-30 10:13:32,569 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse29 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse6 (select .cse28 .cse29)) (.cse19 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse0))) (let ((.cse3 (not .cse13)) (.cse4 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse28 .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (+ .cse19 4)) (.cse9 (= .cse6 .cse0))) (let ((.cse10 (not .cse9)) (.cse2 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_97)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_100)))))) (.cse1 (or (and (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_97)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_99))))) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)) v_arrayElimCell_97))) .cse9)) .cse13)) (.cse18 (or .cse3 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)) v_arrayElimCell_100)))))) (and (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse0) (and .cse1 (or (and .cse2 (or .cse3 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344)) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)) v_arrayElimCell_100) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse9))) (or .cse10 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_99)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_100)))))) (or .cse13 (and (or .cse9 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 v_arrayElimCell_99))))))) (or .cse10 (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)) v_arrayElimCell_99)))) (or (and (or .cse9 (and .cse18 .cse2)) .cse1) (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse19)) (or (and .cse18 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1340))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_42) .cse5 v_ArrVal_1344))) .cse6 v_ArrVal_1351) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1338) .cse6 v_ArrVal_1352) .cse0) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_100)))))) .cse9)))))) is different from false [2025-04-30 10:13:32,770 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse31 (+ .cse11 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select .cse30 .cse31)) (.cse21 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse0))) (let ((.cse4 (not .cse21)) (.cse10 (= .cse7 .cse0)) (.cse5 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse30 .cse31 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse9 (+ .cse12 4))) (let ((.cse3 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse29 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_100)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_97)))))) (.cse2 (or (and (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse25 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse25 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)) v_arrayElimCell_97))) .cse10) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse27 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse27 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_99)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_97)))))) .cse21)) (.cse16 (not .cse10)) (.cse13 (or .cse4 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse24 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse24 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)) v_arrayElimCell_100)))))) (and (or (= .cse0 .cse1) (and .cse2 (or (and .cse3 (or .cse4 (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_1340) |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344)) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)) v_arrayElimCell_100))))) .cse10))) (or (= .cse11 .cse12) (and (or (and .cse3 .cse13) .cse10) .cse2)) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse15 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse15 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_99)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_100))))) .cse16) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse17 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse17 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)) v_arrayElimCell_99))) .cse16) (or (and (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_arrayElimCell_99 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse19 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse19 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 v_arrayElimCell_99)) (= (select .cse18 |c_ULTIMATE.start_node_create_#res#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (= (select (select (store (let ((.cse20 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse20 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse20 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)) |c_ULTIMATE.start_node_create_#res#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse10)) .cse21) (or (and (forall ((v_ArrVal_1338 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (v_DerPreprocessor_42 Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#1| .cse1 v_ArrVal_1340))) (store .cse23 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse23 |c_ULTIMATE.start_node_create_#res#1.base|) .cse5 v_DerPreprocessor_42) .cse6 v_ArrVal_1344))) .cse7 v_ArrVal_1351) (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1338) .cse7 v_ArrVal_1352) .cse0) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_100)) (= (select .cse22 |c_ULTIMATE.start_node_create_#res#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse13) .cse10))))))) is different from false [2025-04-30 10:13:32,897 INFO L325 Elim1Store]: treesize reduction 406, result has 50.8 percent of original size [2025-04-30 10:13:32,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 36144 treesize of output 34372 [2025-04-30 10:13:32,921 INFO L354 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 3226 treesize of output 3224 [2025-04-30 10:13:32,934 INFO L354 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 3224 treesize of output 3216 [2025-04-30 10:13:32,965 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:32,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3600 treesize of output 3734 [2025-04-30 10:13:32,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:32,990 INFO L354 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 3768 treesize of output 3757 [2025-04-30 10:13:33,022 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:33,023 INFO L354 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 3408 treesize of output 3401 [2025-04-30 10:13:35,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:35,772 INFO L354 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 153 treesize of output 157 [2025-04-30 10:13:40,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:40,346 INFO L354 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 6053 treesize of output 5967 [2025-04-30 10:13:41,434 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,435 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:41,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,453 INFO L354 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 35 treesize of output 39 [2025-04-30 10:13:41,485 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,485 INFO L354 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 35 treesize of output 39 [2025-04-30 10:13:41,522 INFO L354 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 5 treesize of output 3 [2025-04-30 10:13:41,540 INFO L354 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 6 treesize of output 4 [2025-04-30 10:13:41,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,555 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:41,583 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,583 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:41,608 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:41,608 INFO L354 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 363 treesize of output 381 [2025-04-30 10:13:42,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:42,067 INFO L354 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 2716 treesize of output 2700 [2025-04-30 10:13:43,687 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:43,730 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:43,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7837 treesize of output 7731 [2025-04-30 10:13:45,085 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-30 10:13:45,089 INFO L354 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 5 treesize of output 3 [2025-04-30 10:13:45,155 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,158 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 211 [2025-04-30 10:13:45,188 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:45,229 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:45,264 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,264 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,266 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2025-04-30 10:13:45,289 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,290 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,291 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-04-30 10:13:45,308 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,308 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,309 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,309 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-04-30 10:13:45,322 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,322 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 257 [2025-04-30 10:13:45,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:45,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1483 treesize of output 1459 [2025-04-30 10:13:45,432 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1013 treesize of output 995 [2025-04-30 10:13:45,463 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1071 treesize of output 1051 [2025-04-30 10:13:45,497 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,497 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 979 treesize of output 961 [2025-04-30 10:13:45,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1483 treesize of output 1459 [2025-04-30 10:13:45,560 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,561 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:45,563 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 113 treesize of output 109 [2025-04-30 10:13:45,589 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 106 [2025-04-30 10:13:45,607 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1071 treesize of output 1051 [2025-04-30 10:13:45,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1483 treesize of output 1459 [2025-04-30 10:13:45,723 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 106 [2025-04-30 10:13:45,745 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1071 treesize of output 1051 [2025-04-30 10:13:45,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1483 treesize of output 1459 [2025-04-30 10:13:45,843 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1013 treesize of output 995 [2025-04-30 10:13:45,879 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,879 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-30 10:13:45,922 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,923 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,924 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2025-04-30 10:13:45,943 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,944 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,945 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,945 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-04-30 10:13:45,960 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,964 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,967 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2025-04-30 10:13:45,994 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,994 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:45,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 979 treesize of output 961 [2025-04-30 10:13:46,017 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:46,019 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:46,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 155 [2025-04-30 10:13:46,046 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:46,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1013 treesize of output 995 [2025-04-30 10:13:46,275 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:46,276 INFO L354 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 5026 treesize of output 4960 [2025-04-30 10:13:46,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:46,667 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:46,745 INFO L354 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 6 treesize of output 4 [2025-04-30 10:13:46,999 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:47,000 INFO L354 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 5919 treesize of output 5839 [2025-04-30 10:13:47,521 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:47,521 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:49,211 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:49,212 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:49,223 INFO L354 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 5 treesize of output 3 [2025-04-30 10:13:49,268 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:49,295 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:49,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,422 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,424 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 211 [2025-04-30 10:13:49,446 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,450 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:49,477 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:49,504 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,504 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,506 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2025-04-30 10:13:49,520 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,520 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,521 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-04-30 10:13:49,534 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,534 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,535 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,535 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-04-30 10:13:49,545 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,545 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 257 [2025-04-30 10:13:49,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:49,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,640 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:49,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,718 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,718 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 257 [2025-04-30 10:13:49,733 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:49,753 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,754 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:49,755 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 113 treesize of output 109 [2025-04-30 10:13:49,780 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:49,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,831 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 106 [2025-04-30 10:13:49,856 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:49,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:49,908 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 106 [2025-04-30 10:13:49,935 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:49,965 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:49,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:49,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:50,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:50,101 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,102 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 211 [2025-04-30 10:13:50,129 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:50,166 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:50,197 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,198 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,199 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2025-04-30 10:13:50,216 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,216 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,217 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-04-30 10:13:50,232 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,233 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,234 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,234 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-04-30 10:13:50,246 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,246 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,251 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 257 [2025-04-30 10:13:50,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:50,283 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 347 [2025-04-30 10:13:50,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 719 treesize of output 707 [2025-04-30 10:13:50,341 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,342 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 257 [2025-04-30 10:13:50,359 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 291 [2025-04-30 10:13:50,387 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,387 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:50,389 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:50,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 113 treesize of output 109 [2025-04-30 10:13:50,405 INFO L354 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 962 treesize of output 946 [2025-04-30 10:13:50,428 INFO L354 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 5 treesize of output 3 [2025-04-30 10:13:50,432 INFO L354 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 967 treesize of output 949 [2025-04-30 10:13:50,492 INFO L354 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 962 treesize of output 946 [2025-04-30 10:13:50,515 INFO L354 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 5 treesize of output 3 [2025-04-30 10:13:50,521 INFO L354 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 967 treesize of output 949 [2025-04-30 10:13:50,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:50,545 INFO L354 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 628 treesize of output 642 [2025-04-30 10:13:50,973 INFO L354 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 967 treesize of output 949 [2025-04-30 10:13:51,011 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:51,012 INFO L354 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 6019 treesize of output 5937 [2025-04-30 10:13:51,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:51,836 INFO L354 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 11 treesize of output 15 [2025-04-30 10:13:51,865 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:13:51,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:51,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5474 treesize of output 5414 [2025-04-30 10:13:54,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:54,973 INFO L354 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 6987 treesize of output 6905 [2025-04-30 10:13:56,105 INFO L354 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 6 treesize of output 4 [2025-04-30 10:13:56,118 INFO L354 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 962 treesize of output 946 [2025-04-30 10:13:56,204 INFO L354 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 6 treesize of output 4 [2025-04-30 10:13:56,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:56,256 INFO L354 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 3194 treesize of output 3174 [2025-04-30 10:13:56,781 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:56,781 INFO L354 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 2318 treesize of output 2312 [2025-04-30 10:13:57,435 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:57,435 INFO L354 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 11 treesize of output 15 [2025-04-30 10:14:01,571 INFO L325 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2025-04-30 10:14:01,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 20671 treesize of output 19659 [2025-04-30 10:14:01,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:01,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1513 treesize of output 1445 [2025-04-30 10:14:01,619 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:01,620 INFO L354 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 1657 treesize of output 1645 [2025-04-30 10:14:01,656 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:01,657 INFO L354 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 1043 treesize of output 1035 [2025-04-30 10:14:04,012 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:04,012 INFO L354 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 153 treesize of output 157 [2025-04-30 10:14:05,594 INFO L354 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 6 treesize of output 4 [2025-04-30 10:14:05,639 INFO L325 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2025-04-30 10:14:05,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 20671 treesize of output 19659 [2025-04-30 10:14:05,662 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:05,662 INFO L354 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 1513 treesize of output 1445 [2025-04-30 10:14:05,681 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:05,681 INFO L354 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 1517 treesize of output 1509 [2025-04-30 10:14:05,705 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:05,705 INFO L354 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 1043 treesize of output 1035 [2025-04-30 10:14:09,041 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:09,041 INFO L354 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 351 treesize of output 355 [2025-04-30 10:14:18,107 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 1251 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-30 10:14:18,108 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:18,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 2404 treesize of output 4732 Killed by 15