./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:48:53,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:48:53,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:48:53,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:48:53,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:48:53,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:48:53,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:48:53,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:48:53,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:48:53,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:48:53,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:48:53,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:48:53,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:48:53,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:48:53,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:48:53,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:48:53,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:48:53,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:48:53,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:48:53,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:48:53,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:48:53,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:53,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:53,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:53,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:48:53,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:48:53,938 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-jdk21/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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2025-01-09 02:48:54,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:48:54,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:48:54,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:48:54,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:48:54,239 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:48:54,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2025-01-09 02:48:55,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cad8b2eb/beca7388b1c147368c14b8b1f5fa03c5/FLAGdd1d95118 [2025-01-09 02:48:55,911 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:48:55,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2025-01-09 02:48:55,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cad8b2eb/beca7388b1c147368c14b8b1f5fa03c5/FLAGdd1d95118 [2025-01-09 02:48:55,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cad8b2eb/beca7388b1c147368c14b8b1f5fa03c5 [2025-01-09 02:48:55,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:48:55,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:48:55,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:55,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:48:55,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:48:55,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:55" (1/1) ... [2025-01-09 02:48:55,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f311073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:55, skipping insertion in model container [2025-01-09 02:48:55,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:55" (1/1) ... [2025-01-09 02:48:55,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:48:56,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2025-01-09 02:48:56,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:56,308 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:48:56,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2025-01-09 02:48:56,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:56,377 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:48:56,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56 WrapperNode [2025-01-09 02:48:56,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:56,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:56,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:48:56,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:48:56,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,430 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2025-01-09 02:48:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:56,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:48:56,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:48:56,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:48:56,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,470 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 14, 7]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-01-09 02:48:56,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:48:56,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:48:56,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:48:56,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:48:56,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (1/1) ... [2025-01-09 02:48:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:56,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:48:56,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:48:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 02:48:56,570 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 02:48:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:48:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:48:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:48:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:48:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:48:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:48:56,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:48:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:48:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:48:56,708 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:48:56,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:48:56,735 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 02:48:56,933 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-01-09 02:48:56,934 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:48:56,946 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:48:56,946 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:48:56,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:56 BoogieIcfgContainer [2025-01-09 02:48:56,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:48:56,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:48:56,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:48:56,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:48:56,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:55" (1/3) ... [2025-01-09 02:48:56,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3260db22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:56, skipping insertion in model container [2025-01-09 02:48:56,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:56" (2/3) ... [2025-01-09 02:48:56,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3260db22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:56, skipping insertion in model container [2025-01-09 02:48:56,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:56" (3/3) ... [2025-01-09 02:48:56,956 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2025-01-09 02:48:56,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:48:56,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_unequal.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:48:57,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:48:57,025 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bf5017f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:48:57,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:48:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 27 states have internal predecessors, (36), 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-01-09 02:48:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:48:57,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:57,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:57,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -69826392, now seen corresponding path program 1 times [2025-01-09 02:48:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034854279] [2025-01-09 02:48:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:57,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:48:57,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:48:57,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:57,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:57,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034854279] [2025-01-09 02:48:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034854279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652154988] [2025-01-09 02:48:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:57,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:57,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:57,409 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 27 states have internal predecessors, (36), 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.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 02:48:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:57,441 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2025-01-09 02:48:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-01-09 02:48:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:57,448 INFO L225 Difference]: With dead ends: 56 [2025-01-09 02:48:57,448 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 02:48:57,450 INFO L434 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-01-09 02:48:57,453 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 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-01-09 02:48:57,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 02:48:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-01-09 02:48:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-01-09 02:48:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-01-09 02:48:57,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2025-01-09 02:48:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:57,485 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-01-09 02:48:57,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 02:48:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-01-09 02:48:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 02:48:57,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:57,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:57,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:48:57,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1344636173, now seen corresponding path program 1 times [2025-01-09 02:48:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416599905] [2025-01-09 02:48:57,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:57,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:48:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:48:57,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:57,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416599905] [2025-01-09 02:48:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416599905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354560289] [2025-01-09 02:48:57,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:57,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:57,639 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:57,666 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-01-09 02:48:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:57,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 02:48:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:57,667 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:48:57,667 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:48:57,667 INFO L434 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-01-09 02:48:57,668 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-01-09 02:48:57,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:48:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:48:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-01-09 02:48:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-01-09 02:48:57,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2025-01-09 02:48:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:57,675 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-09 02:48:57,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-01-09 02:48:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 02:48:57,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:57,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:57,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:48:57,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:57,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1086470735, now seen corresponding path program 1 times [2025-01-09 02:48:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:57,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988112014] [2025-01-09 02:48:57,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:57,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:48:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:48:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:57,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988112014] [2025-01-09 02:48:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988112014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725777726] [2025-01-09 02:48:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:57,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:48:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:48:57,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:48:57,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:57,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:57,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:48:57,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:58,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:58,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725777726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:58,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:58,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:48:58,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656694753] [2025-01-09 02:48:58,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:58,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:48:58,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:58,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:48:58,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:58,083 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:58,109 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-01-09 02:48:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:48:58,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 02:48:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:58,110 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:48:58,110 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:48:58,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-01-09 02:48:58,111 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 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-01-09 02:48:58,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:48:58,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 02:48:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-01-09 02:48:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-01-09 02:48:58,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2025-01-09 02:48:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:58,115 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-01-09 02:48:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-01-09 02:48:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:48:58,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:58,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:58,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:48:58,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:58,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash 466418570, now seen corresponding path program 1 times [2025-01-09 02:48:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121186517] [2025-01-09 02:48:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:58,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:48:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:48:58,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:58,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:48:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121186517] [2025-01-09 02:48:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121186517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:48:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308695841] [2025-01-09 02:48:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:48:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:59,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:48:59,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:48:59,327 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-01-09 02:48:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:59,518 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-01-09 02:48:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:48:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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 22 [2025-01-09 02:48:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:59,521 INFO L225 Difference]: With dead ends: 28 [2025-01-09 02:48:59,521 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:48:59,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:48:59,522 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:59,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:48:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:48:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 02:48:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-01-09 02:48:59,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 22 [2025-01-09 02:48:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:59,528 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-01-09 02:48:59,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-01-09 02:48:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-01-09 02:48:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:48:59,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:59,529 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-01-09 02:48:59,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:48:59,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1551694341, now seen corresponding path program 1 times [2025-01-09 02:48:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:59,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908840306] [2025-01-09 02:48:59,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:59,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:48:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:48:59,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:59,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908840306] [2025-01-09 02:49:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908840306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:00,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:00,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:49:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102260275] [2025-01-09 02:49:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:49:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:00,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:49:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:49:00,568 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:49:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:00,785 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-01-09 02:49:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:49:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 02:49:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:00,786 INFO L225 Difference]: With dead ends: 45 [2025-01-09 02:49:00,786 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 02:49:00,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:49:00,787 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:00,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:49:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 02:49:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 02:49:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:49:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-09 02:49:00,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2025-01-09 02:49:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:00,792 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-09 02:49:00,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:49:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-09 02:49:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:49:00,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:00,793 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-01-09 02:49:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:49:00,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:00,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1551687397, now seen corresponding path program 1 times [2025-01-09 02:49:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126801969] [2025-01-09 02:49:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:00,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:00,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126801969] [2025-01-09 02:49:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126801969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68650057] [2025-01-09 02:49:02,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:02,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:02,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:49:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:02,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:02,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:02,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-09 02:49:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:02,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:02,571 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:02,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:02,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-01-09 02:49:02,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:49:02,957 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:49:02,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:49:03,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:49:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 02:49:03,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 02:49:03,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:49:03,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:03,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2025-01-09 02:49:03,228 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:03,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:03,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2025-01-09 02:49:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:03,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2025-01-09 02:49:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 02:49:03,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 33 [2025-01-09 02:49:03,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2025-01-09 02:49:03,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-01-09 02:49:03,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-01-09 02:49:03,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 02:49:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:03,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:03,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= v_ArrVal_521 (let ((.cse1 (+ (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_521 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_521) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_523) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_522) .cse3) .cse4)))))))) is different from false [2025-01-09 02:49:03,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:03,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 120 [2025-01-09 02:49:03,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:03,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 237 [2025-01-09 02:49:03,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 180 [2025-01-09 02:49:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2025-01-09 02:49:03,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:03,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 269 [2025-01-09 02:49:03,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2025-01-09 02:49:04,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse24 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse12 (select .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse11 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (= .cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse18 (+ .cse12 8))) (let ((.cse10 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse11 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse29 .cse11) .cse18 (select v_ArrVal_521 .cse18)))))))) (.cse19 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520) .cse11 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select |c_#memory_int#1| .cse11) .cse18 (select v_ArrVal_521 .cse18))))))) (.cse8 (not .cse4))) (let ((.cse15 (or .cse4 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 .cse11 v_ArrVal_521) v_arrayElimCell_18) .cse12)) (not (= v_ArrVal_521 (store (select .cse27 .cse11) .cse18 (select v_ArrVal_521 .cse18))))))))) (.cse16 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (let ((.cse25 (store .cse26 .cse11 v_ArrVal_521))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_20) v_arrayElimCell_23)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_18) .cse12)) (not (= v_ArrVal_521 (store (select .cse26 .cse11) .cse18 (select v_ArrVal_521 .cse18))))))))) (.cse6 (or .cse7 .cse8)) (.cse13 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse0 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse19)) (.cse14 (or .cse10 .cse8)) (.cse1 (or .cse4 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (or (not (= v_ArrVal_521 (store (select .cse23 .cse11) .cse18 (select v_ArrVal_521 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 .cse11 v_ArrVal_521) v_arrayElimCell_18) v_arrayElimCell_21))))))) (.cse2 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 .cse11 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_521 v_arrayElimCell_21)) (not (= v_ArrVal_521 (store (select .cse22 .cse11) .cse18 (select v_ArrVal_521 .cse18)))))))) (.cse3 (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (let ((.cse20 (store .cse21 .cse11 v_ArrVal_521))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse21 .cse11) .cse18 (select v_ArrVal_521 .cse18)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_18) v_arrayElimCell_21))))))) (.cse9 (= .cse11 .cse19)) (.cse5 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_21 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520) .cse11) .cse18 v_DerPreprocessor_1) v_arrayElimCell_21))))) (and (or .cse0 (and .cse1 .cse2 .cse3 (or .cse4 .cse5) .cse6 (or .cse7 .cse8 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (not .cse9) .cse10) (or .cse9 (forall ((v_ArrVal_520 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520) .cse11) .cse12)))) (or .cse13 (and .cse14 .cse15 .cse16)) (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 .cse11 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_521 .cse12)) (not (= v_ArrVal_521 (store (select .cse17 .cse11) .cse18 (select v_ArrVal_521 .cse18))))))) (or (and .cse15 .cse16 .cse6) .cse0) (or .cse13 (and (or .cse7 .cse0 .cse8) .cse14 .cse1 .cse2 .cse3 (or .cse9 .cse5))))))))) is different from false [2025-01-09 02:49:04,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse19 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse6 (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse8 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse14 (= .cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse9 (+ .cse6 8))) (let ((.cse11 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse8 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse29 .cse8) .cse9 (select v_ArrVal_521 .cse9)))))))) (.cse20 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (or (not (= v_ArrVal_521 (store (select |c_#memory_int#1| .cse8) .cse9 (select v_ArrVal_521 .cse9)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520) .cse8 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23))))) (.cse18 (not .cse14))) (let ((.cse0 (or .cse14 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 .cse8 v_ArrVal_521) v_arrayElimCell_18) .cse6)) (not (= v_ArrVal_521 (store (select .cse27 .cse8) .cse9 (select v_ArrVal_521 .cse9))))))))) (.cse1 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (let ((.cse25 (store .cse26 .cse8 v_ArrVal_521))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_18) .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse26 .cse8) .cse9 (select v_ArrVal_521 .cse9))))))))) (.cse5 (or .cse17 .cse18)) (.cse12 (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (let ((.cse23 (store .cse24 .cse8 v_ArrVal_521))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_20) v_arrayElimCell_23)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_18) v_arrayElimCell_21)) (not (= v_ArrVal_521 (store (select .cse24 .cse8) .cse9 (select v_ArrVal_521 .cse9))))))))) (.cse4 (= .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse2 (or .cse18 .cse11)) (.cse13 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_521 v_arrayElimCell_21)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 .cse8 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse22 .cse8) .cse9 (select v_ArrVal_521 .cse9)))))))) (.cse16 (or .cse14 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 .cse8 v_ArrVal_521) v_arrayElimCell_18) v_arrayElimCell_21)) (not (= v_ArrVal_521 (store (select .cse21 .cse8) .cse9 (select v_ArrVal_521 .cse9))))))))) (.cse10 (= .cse20 .cse8)) (.cse15 (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_21 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520) .cse8) .cse9 v_DerPreprocessor_1) v_arrayElimCell_21)))) (.cse3 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (and (or (and .cse0 .cse1 .cse2) .cse3) (or .cse4 (and .cse0 .cse1 .cse5)) (forall ((v_ArrVal_520 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_521 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 .cse8 v_ArrVal_521) v_arrayElimCell_20) v_arrayElimCell_23)) (not (= v_ArrVal_521 (store (select .cse7 .cse8) .cse9 (select v_ArrVal_521 .cse9))))))) (or (not .cse10) .cse11) (or .cse4 (and .cse12 .cse5 .cse13 (or .cse14 .cse15) .cse16)) (or (forall ((v_ArrVal_520 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_520) .cse8) .cse6))) .cse10) (or (and .cse12 (or .cse4 .cse17 .cse18) .cse2 .cse13 .cse16 (or .cse10 .cse15)) .cse3))))))) is different from false [2025-01-09 02:49:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 117 [2025-01-09 02:49:05,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2025-01-09 02:49:05,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-09 02:49:05,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-01-09 02:49:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-01-09 02:49:05,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-01-09 02:49:05,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2025-01-09 02:49:05,682 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:05,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 02:49:05,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:49:05,778 INFO L349 Elim1Store]: treesize reduction 82, result has 45.7 percent of original size [2025-01-09 02:49:05,779 INFO L378 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 517 treesize of output 551 [2025-01-09 02:49:05,800 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:05,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 279 [2025-01-09 02:49:05,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:05,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 261 [2025-01-09 02:49:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2025-01-09 02:49:05,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 02:49:06,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 02:49:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68650057] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:06,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2025-01-09 02:49:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634491315] [2025-01-09 02:49:06,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:06,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 02:49:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:06,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 02:49:06,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1751, Unknown=5, NotChecked=258, Total=2162 [2025-01-09 02:49:06,434 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 47 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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-01-09 02:49:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:10,951 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-01-09 02:49:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:49:10,952 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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-01-09 02:49:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:10,953 INFO L225 Difference]: With dead ends: 35 [2025-01-09 02:49:10,953 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 02:49:10,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=322, Invalid=3219, Unknown=11, NotChecked=354, Total=3906 [2025-01-09 02:49:10,955 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 5 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:10,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 620 Invalid, 34 Unknown, 95 Unchecked, 2.6s Time] [2025-01-09 02:49:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 02:49:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-01-09 02:49:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-01-09 02:49:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-01-09 02:49:10,962 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 24 [2025-01-09 02:49:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:10,964 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-01-09 02:49:10,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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-01-09 02:49:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-01-09 02:49:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:49:10,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:10,965 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-01-09 02:49:10,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:49:11,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:11,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:11,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash 817984160, now seen corresponding path program 1 times [2025-01-09 02:49:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817227017] [2025-01-09 02:49:11,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:11,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:11,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:11,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817227017] [2025-01-09 02:49:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817227017] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350377749] [2025-01-09 02:49:12,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:12,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:12,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:49:12,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:12,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:12,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:12,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 02:49:12,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:12,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:12,559 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:12,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:12,607 INFO L378 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-01-09 02:49:12,665 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:12,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2025-01-09 02:49:12,817 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:12,817 INFO L378 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 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:12,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2025-01-09 02:49:12,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 02:49:12,980 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2025-01-09 02:49:13,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2025-01-09 02:49:13,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:13,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:13,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:13,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:13,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 64 [2025-01-09 02:49:13,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 82 [2025-01-09 02:49:13,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 02:49:13,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-09 02:49:13,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:13,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 treesize of output 3 [2025-01-09 02:49:13,378 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2025-01-09 02:49:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 32 [2025-01-09 02:49:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:13,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:13,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:13,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 192 [2025-01-09 02:49:13,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 383 treesize of output 382 [2025-01-09 02:49:13,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 322 [2025-01-09 02:49:14,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2025-01-09 02:49:14,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 113 [2025-01-09 02:49:14,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2025-01-09 02:49:14,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2025-01-09 02:49:14,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2025-01-09 02:49:14,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:14,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2025-01-09 02:49:15,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 128 [2025-01-09 02:49:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2025-01-09 02:49:15,224 INFO L349 Elim1Store]: treesize reduction 35, result has 53.3 percent of original size [2025-01-09 02:49:15,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 93 [2025-01-09 02:49:15,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:15,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2025-01-09 02:49:16,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:16,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2025-01-09 02:49:16,013 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:16,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:16,016 INFO L378 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 61 treesize of output 43 [2025-01-09 02:49:16,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-01-09 02:49:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 02:49:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350377749] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:17,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2025-01-09 02:49:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703593975] [2025-01-09 02:49:17,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 02:49:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 02:49:17,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1828, Unknown=6, NotChecked=0, Total=1980 [2025-01-09 02:49:17,528 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 45 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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-01-09 02:49:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:23,094 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-01-09 02:49:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 02:49:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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-01-09 02:49:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:23,095 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:49:23,095 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 02:49:23,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=359, Invalid=4191, Unknown=6, NotChecked=0, Total=4556 [2025-01-09 02:49:23,097 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:23,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 142 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 02:49:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 02:49:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2025-01-09 02:49:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:49:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-01-09 02:49:23,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2025-01-09 02:49:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:23,102 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-01-09 02:49:23,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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-01-09 02:49:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-01-09 02:49:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:49:23,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:23,103 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-01-09 02:49:23,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:49:23,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:23,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash 817977216, now seen corresponding path program 1 times [2025-01-09 02:49:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:23,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795613422] [2025-01-09 02:49:23,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:23,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:23,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:23,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:23,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795613422] [2025-01-09 02:49:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795613422] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615013392] [2025-01-09 02:49:24,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:24,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:24,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:24,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:49:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:49:24,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:49:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:24,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-01-09 02:49:24,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:24,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:25,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 7 [2025-01-09 02:49:25,131 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:25,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:25,185 INFO L378 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 18 treesize of output 7 [2025-01-09 02:49:25,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:49:25,201 INFO L378 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 18 treesize of output 7 [2025-01-09 02:49:25,264 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:25,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-01-09 02:49:25,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 02:49:25,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-01-09 02:49:25,429 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:25,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:25,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:49:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2025-01-09 02:49:25,526 INFO L378 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-01-09 02:49:25,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 44 [2025-01-09 02:49:25,622 INFO L378 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-01-09 02:49:25,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2025-01-09 02:49:25,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:25,712 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:25,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:25,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 82 treesize of output 64 [2025-01-09 02:49:25,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:25,724 INFO L378 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 32 treesize of output 19 [2025-01-09 02:49:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:25,736 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:25,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 48 [2025-01-09 02:49:25,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 107 [2025-01-09 02:49:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 02:49:25,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:25,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:26,241 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2025-01-09 02:49:26,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 55 [2025-01-09 02:49:26,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2025-01-09 02:49:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:26,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:26,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (+ (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_873) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2025-01-09 02:49:26,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_869 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19| Int) (v_ArrVal_873 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse13 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (+ .cse13 8)) (.cse11 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19| 4))) (let ((.cse4 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 .cse13)))) (store .cse12 .cse0 (store (select .cse12 .cse0) .cse10 |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19|)))) (.cse1 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 .cse0)))) (store .cse9 .cse0 (store (select .cse9 .cse0) .cse10 |c_ULTIMATE.start_node_create_#res#1.base|)))) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_869) .cse0 v_ArrVal_873) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))))) is different from false [2025-01-09 02:49:26,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:26,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 384 [2025-01-09 02:49:26,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:26,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 330 [2025-01-09 02:49:27,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 182 [2025-01-09 02:49:27,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 210 [2025-01-09 02:49:28,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_869 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19| Int) (v_ArrVal_861 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int) (v_ArrVal_873 (Array Int Int)) (v_ArrVal_862 (Array Int Int))) (let ((.cse6 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19| 4))) (let ((.cse0 (select v_arrayElimArr_14 .cse6)) (.cse1 (select v_arrayElimArr_15 .cse6))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (+ .cse1 8))) (let ((.cse5 (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_861) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_arrayElimArr_15))) (store .cse9 .cse0 (store (select .cse9 .cse0) .cse8 |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_19|)))) (.cse2 (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_862) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_arrayElimArr_14))) (store .cse7 .cse0 (store (select .cse7 .cse0) .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|))))) (let ((.cse3 (select (select .cse2 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|) .cse6)) (.cse4 (+ (select (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|) .cse6) 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_860)) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_869) .cse0 v_ArrVal_873) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))))) is different from false [2025-01-09 02:49:28,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 453 treesize of output 384 [2025-01-09 02:49:28,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 363 treesize of output 294 [2025-01-09 02:49:28,280 INFO L349 Elim1Store]: treesize reduction 46, result has 66.9 percent of original size [2025-01-09 02:49:28,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 25944 treesize of output 24455 [2025-01-09 02:49:28,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 9785 treesize of output 7393 [2025-01-09 02:49:28,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7209 treesize of output 7133 [2025-01-09 02:49:28,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 2204 treesize of output 1720 [2025-01-09 02:49:28,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 235 [2025-01-09 02:49:28,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 154 [2025-01-09 02:49:28,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 164 [2025-01-09 02:49:28,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 160 [2025-01-09 02:49:28,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:28,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:28,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:28,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 02:49:29,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-01-09 02:49:29,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-01-09 02:49:30,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 02:49:30,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:30,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2025-01-09 02:49:30,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 02:49:30,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2025-01-09 02:49:30,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:30,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:49:30,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:30,805 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 02:49:30,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 02:49:30,887 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 02:49:30,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:30,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:30,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 02:49:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2025-01-09 02:49:31,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:31,055 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 02:49:31,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-01-09 02:49:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:49:31,751 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 02:49:31,753 WARN L214 Elim1Store]: Array PQE input equivalent to true