./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:42:36,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:42:36,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:42:36,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:42:36,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:42:36,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:42:36,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:42:36,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:42:36,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:42:36,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:42:36,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:42:36,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:42:36,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:42:36,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:42:36,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:42:36,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:36,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:42:36,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:36,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:42:36,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:42:36,526 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2025-01-09 22:42:36,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:42:36,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:42:36,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:42:36,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:42:36,745 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:42:36,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-01-09 22:42:37,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79846e7ca/a45e355c04774435adb6246af28e7860/FLAG958cb50b0 [2025-01-09 22:42:38,204 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:42:38,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-01-09 22:42:38,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79846e7ca/a45e355c04774435adb6246af28e7860/FLAG958cb50b0 [2025-01-09 22:42:38,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79846e7ca/a45e355c04774435adb6246af28e7860 [2025-01-09 22:42:38,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:42:38,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:42:38,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:38,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:42:38,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:42:38,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da11f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38, skipping insertion in model container [2025-01-09 22:42:38,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:42:38,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:38,431 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:42:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:38,483 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:42:38,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38 WrapperNode [2025-01-09 22:42:38,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:38,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:38,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:42:38,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:42:38,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,522 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-01-09 22:42:38,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:38,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:42:38,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:42:38,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:42:38,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,555 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 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 22:42:38,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:42:38,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:42:38,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:42:38,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:42:38,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (1/1) ... [2025-01-09 22:42:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:38,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:38,596 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 22:42:38,598 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 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 22:42:38,614 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:42:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:42:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:42:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:42:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:42:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:42:38,698 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:42:38,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:42:38,941 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2025-01-09 22:42:38,942 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:42:38,950 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:42:38,950 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:42:38,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:38 BoogieIcfgContainer [2025-01-09 22:42:38,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:42:38,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:42:38,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:42:38,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:42:38,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:42:38" (1/3) ... [2025-01-09 22:42:38,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30d05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:38, skipping insertion in model container [2025-01-09 22:42:38,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:38" (2/3) ... [2025-01-09 22:42:38,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30d05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:38, skipping insertion in model container [2025-01-09 22:42:38,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:38" (3/3) ... [2025-01-09 22:42:38,956 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2025-01-09 22:42:38,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:42:38,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_unequal.i that has 2 procedures, 144 locations, 1 initial locations, 5 loop locations, and 62 error locations. [2025-01-09 22:42:39,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:42:39,020 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=None, 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;@167e715e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:42:39,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-09 22:42:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 77 states have (on average 2.012987012987013) internal successors, (155), 139 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:39,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 896260437, now seen corresponding path program 1 times [2025-01-09 22:42:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017542620] [2025-01-09 22:42:39,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:39,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:39,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:39,192 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 22:42:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017542620] [2025-01-09 22:42:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017542620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:39,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967022034] [2025-01-09 22:42:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:39,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:39,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:39,218 INFO L87 Difference]: Start difference. First operand has 144 states, 77 states have (on average 2.012987012987013) internal successors, (155), 139 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,314 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-01-09 22:42:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,319 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:42:39,320 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:42:39,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:42:39,322 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:39,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:42:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-09 22:42:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 74 states have (on average 1.945945945945946) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-01-09 22:42:39,348 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2025-01-09 22:42:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:39,348 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-01-09 22:42:39,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-01-09 22:42:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:39,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:42:39,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:39,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash 896260438, now seen corresponding path program 1 times [2025-01-09 22:42:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316340905] [2025-01-09 22:42:39,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:39,451 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 22:42:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:39,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316340905] [2025-01-09 22:42:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316340905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897053782] [2025-01-09 22:42:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:39,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:39,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:39,457 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,524 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-01-09 22:42:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:39,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,525 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:42:39,525 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:42:39,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:42:39,526 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:39,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 235 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:42:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 22:42:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 74 states have (on average 1.9189189189189189) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-01-09 22:42:39,531 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2025-01-09 22:42:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-01-09 22:42:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-01-09 22:42:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:42:39,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:42:39,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1449750292, now seen corresponding path program 1 times [2025-01-09 22:42:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468445558] [2025-01-09 22:42:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:42:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:42:39,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:39,624 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 22:42:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468445558] [2025-01-09 22:42:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468445558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538773423] [2025-01-09 22:42:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:39,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:39,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:39,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:39,630 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,641 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-01-09 22:42:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:42:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,642 INFO L225 Difference]: With dead ends: 143 [2025-01-09 22:42:39,642 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 22:42:39,643 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 22:42:39,643 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 5 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 287 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 22:42:39,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 22:42:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2025-01-09 22:42:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 132 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-01-09 22:42:39,649 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 13 [2025-01-09 22:42:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-01-09 22:42:39,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-01-09 22:42:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:39,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:42:39,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2109577399, now seen corresponding path program 1 times [2025-01-09 22:42:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064505669] [2025-01-09 22:42:39,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:39,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:39,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:39,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:39,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064505669] [2025-01-09 22:42:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064505669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:39,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:39,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405390095] [2025-01-09 22:42:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:39,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:39,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:39,820 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,996 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-01-09 22:42:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,997 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:42:39,999 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:42:39,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:39,999 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:39,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:42:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:42:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 22:42:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8933333333333333) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-01-09 22:42:40,009 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 22 [2025-01-09 22:42:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,009 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-01-09 22:42:40,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-01-09 22:42:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:40,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:42:40,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2109577400, now seen corresponding path program 1 times [2025-01-09 22:42:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453302638] [2025-01-09 22:42:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:40,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:40,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,232 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 22:42:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453302638] [2025-01-09 22:42:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453302638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626374685] [2025-01-09 22:42:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:40,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:40,235 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:40,390 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-01-09 22:42:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:40,391 INFO L225 Difference]: With dead ends: 135 [2025-01-09 22:42:40,391 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 22:42:40,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:40,392 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:40,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 476 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 22:42:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-09 22:42:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.88) internal successors, (141), 130 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-01-09 22:42:40,403 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 22 [2025-01-09 22:42:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,403 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-01-09 22:42:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-01-09 22:42:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:40,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:42:40,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1836164582, now seen corresponding path program 1 times [2025-01-09 22:42:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149392835] [2025-01-09 22:42:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:40,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:40,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149392835] [2025-01-09 22:42:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149392835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136039000] [2025-01-09 22:42:40,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:40,572 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 22:42:40,574 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 22:42:40,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:40,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:40,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:42:40,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:40,712 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 22:42:40,759 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-01-09 22:42:40,801 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:42:40,802 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 19 treesize of output 16 [2025-01-09 22:42:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:40,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136039000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:40,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-01-09 22:42:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453049495] [2025-01-09 22:42:40,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:42:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:42:40,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:42:40,861 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:41,156 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-01-09 22:42:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-01-09 22:42:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:41,157 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:42:41,157 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:42:41,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-01-09 22:42:41,158 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:41,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 743 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 525 Invalid, 0 Unknown, 139 Unchecked, 0.2s Time] [2025-01-09 22:42:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:42:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-09 22:42:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-01-09 22:42:41,162 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 25 [2025-01-09 22:42:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-01-09 22:42:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-01-09 22:42:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:41,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:41,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:41,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:41,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:41,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1836164581, now seen corresponding path program 1 times [2025-01-09 22:42:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104840224] [2025-01-09 22:42:41,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:41,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:41,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104840224] [2025-01-09 22:42:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104840224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435808160] [2025-01-09 22:42:41,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:41,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:41,687 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 22:42:41,689 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 22:42:41,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:41,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:41,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:42:41,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:41,771 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 8 treesize of output 1 [2025-01-09 22:42:41,947 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:42:41,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:42:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:41,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435808160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:42,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-01-09 22:42:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964619093] [2025-01-09 22:42:42,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:42,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:42:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:42,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:42:42,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:42:42,103 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:42,602 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2025-01-09 22:42:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:42:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-01-09 22:42:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:42,604 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:42:42,604 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:42:42,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:42:42,605 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:42,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 906 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:42:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:42:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-01-09 22:42:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 128 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-01-09 22:42:42,613 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 25 [2025-01-09 22:42:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-01-09 22:42:42,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-01-09 22:42:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:42:42,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:42,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:42,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:42,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -431252876, now seen corresponding path program 1 times [2025-01-09 22:42:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387385882] [2025-01-09 22:42:42,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:42,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:42,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:42,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387385882] [2025-01-09 22:42:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387385882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359324478] [2025-01-09 22:42:43,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:43,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:43,227 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 22:42:43,229 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 22:42:43,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:43,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:43,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:43,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:42:43,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:43,337 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 22:42:43,345 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 22:42:43,353 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-01-09 22:42:43,387 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:42:43,387 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 19 treesize of output 16 [2025-01-09 22:42:43,401 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 22:42:43,409 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-01-09 22:42:43,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:43,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:43,454 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-01-09 22:42:43,471 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:42:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:42:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2025-01-09 22:42:43,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:43,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359324478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:43,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2025-01-09 22:42:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494922423] [2025-01-09 22:42:43,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:42:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:43,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:42:43,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=168, Unknown=3, NotChecked=84, Total=306 [2025-01-09 22:42:43,649 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:42:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:44,050 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-01-09 22:42:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:44,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-01-09 22:42:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:44,051 INFO L225 Difference]: With dead ends: 143 [2025-01-09 22:42:44,051 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 22:42:44,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=241, Unknown=3, NotChecked=102, Total=420 [2025-01-09 22:42:44,052 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 146 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:44,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 450 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 504 Invalid, 0 Unknown, 447 Unchecked, 0.3s Time] [2025-01-09 22:42:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 22:42:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2025-01-09 22:42:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 119 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-01-09 22:42:44,056 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 37 [2025-01-09 22:42:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:44,056 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-01-09 22:42:44,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:42:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-01-09 22:42:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:42:44,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:44,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:44,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:42:44,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:44,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:44,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -431252875, now seen corresponding path program 1 times [2025-01-09 22:42:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:44,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965641903] [2025-01-09 22:42:44,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:44,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965641903] [2025-01-09 22:42:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965641903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027548806] [2025-01-09 22:42:44,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:44,846 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 22:42:44,847 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 22:42:44,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:44,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:44,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:44,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:44,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:42:44,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:44,957 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 8 treesize of output 1 [2025-01-09 22:42:44,961 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 22:42:44,966 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-01-09 22:42:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:44,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:45,011 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 22:42:45,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:45,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:45,106 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 22:42:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:45,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027548806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 14 [2025-01-09 22:42:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467272243] [2025-01-09 22:42:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:42:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:42:45,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:42:45,141 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:45,270 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2025-01-09 22:42:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-01-09 22:42:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:45,272 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:42:45,272 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:42:45,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:42:45,273 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:45,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 308 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2025-01-09 22:42:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:42:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-01-09 22:42:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2025-01-09 22:42:45,279 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 37 [2025-01-09 22:42:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2025-01-09 22:42:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2025-01-09 22:42:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:42:45,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:45,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:45,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 22:42:45,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1207248437, now seen corresponding path program 1 times [2025-01-09 22:42:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9730056] [2025-01-09 22:42:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:45,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:45,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:45,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:45,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9730056] [2025-01-09 22:42:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9730056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030770151] [2025-01-09 22:42:45,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:45,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:45,736 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:42:45,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:42:45,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:45,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:45,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:45,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:45,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:42:45,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:45,932 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 22:42:46,037 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 9 treesize of output 3 [2025-01-09 22:42:46,042 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-01-09 22:42:46,076 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:42:46,076 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 23 treesize of output 24 [2025-01-09 22:42:46,084 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 17 treesize of output 9 [2025-01-09 22:42:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:46,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030770151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:46,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2025-01-09 22:42:46,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647172209] [2025-01-09 22:42:46,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:46,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:42:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:46,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:42:46,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:42:46,137 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:46,636 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-01-09 22:42:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:42:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-01-09 22:42:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:46,637 INFO L225 Difference]: With dead ends: 149 [2025-01-09 22:42:46,637 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 22:42:46,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=763, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:42:46,638 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:46,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 922 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 912 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2025-01-09 22:42:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 22:42:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2025-01-09 22:42:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 116 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2025-01-09 22:42:46,641 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 40 [2025-01-09 22:42:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:46,641 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2025-01-09 22:42:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2025-01-09 22:42:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:42:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:46,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:46,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:42:46,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1207248436, now seen corresponding path program 1 times [2025-01-09 22:42:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203458007] [2025-01-09 22:42:46,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:46,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:46,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:46,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203458007] [2025-01-09 22:42:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203458007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809196635] [2025-01-09 22:42:47,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:47,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:47,202 INFO L229 MonitoredProcess]: Starting monitored process 7 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 22:42:47,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:42:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:47,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:42:47,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:47,642 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 8 treesize of output 1 [2025-01-09 22:42:47,644 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 22:42:47,844 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 9 treesize of output 3 [2025-01-09 22:42:47,846 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 9 treesize of output 3 [2025-01-09 22:42:47,919 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-01-09 22:42:47,944 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:42:47,944 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 15 treesize of output 15 [2025-01-09 22:42:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-09 22:42:48,000 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 17 treesize of output 9 [2025-01-09 22:42:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-01-09 22:42:48,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809196635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:48,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2025-01-09 22:42:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282728067] [2025-01-09 22:42:48,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:42:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:48,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:42:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=730, Unknown=1, NotChecked=54, Total=870 [2025-01-09 22:42:48,165 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:48,896 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2025-01-09 22:42:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:42:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-01-09 22:42:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:48,898 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:42:48,898 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:42:48,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=1261, Unknown=1, NotChecked=72, Total=1482 [2025-01-09 22:42:48,899 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 251 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:48,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 939 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1167 Invalid, 0 Unknown, 166 Unchecked, 0.5s Time] [2025-01-09 22:42:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:42:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2025-01-09 22:42:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 122 states have internal predecessors, (134), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2025-01-09 22:42:48,902 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 40 [2025-01-09 22:42:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:48,902 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2025-01-09 22:42:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2025-01-09 22:42:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:42:48,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:48,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:48,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:42:49,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:42:49,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:49,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1230010143, now seen corresponding path program 1 times [2025-01-09 22:42:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116219951] [2025-01-09 22:42:49,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:42:49,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:42:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116219951] [2025-01-09 22:42:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116219951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072386774] [2025-01-09 22:42:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:49,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:49,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:49,160 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:49,167 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-01-09 22:42:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:49,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-09 22:42:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:49,168 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:42:49,168 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:42:49,169 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 22:42:49,170 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:49,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:42:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 22:42:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 123 states have internal predecessors, (135), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2025-01-09 22:42:49,173 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 41 [2025-01-09 22:42:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:49,173 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2025-01-09 22:42:49,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2025-01-09 22:42:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:49,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:49,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:42:49,175 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 917955868, now seen corresponding path program 1 times [2025-01-09 22:42:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634116759] [2025-01-09 22:42:49,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:49,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:49,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:49,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:49,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:42:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634116759] [2025-01-09 22:42:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634116759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016426029] [2025-01-09 22:42:49,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:49,312 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:42:49,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:42:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:49,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:49,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:42:49,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:49,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016426029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 22:42:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400980125] [2025-01-09 22:42:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:49,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:42:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:49,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:42:49,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:49,452 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:49,475 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-01-09 22:42:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:42:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-09 22:42:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:49,476 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:42:49,476 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:42:49,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:42:49,476 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 75 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:49,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:42:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-01-09 22:42:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-01-09 22:42:49,481 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 43 [2025-01-09 22:42:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:49,481 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-01-09 22:42:49,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-01-09 22:42:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:49,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:49,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:49,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:49,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:49,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 923988352, now seen corresponding path program 1 times [2025-01-09 22:42:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162954507] [2025-01-09 22:42:49,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:49,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:49,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:49,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:42:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162954507] [2025-01-09 22:42:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162954507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404069291] [2025-01-09 22:42:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:49,789 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,123 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2025-01-09 22:42:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:50,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-01-09 22:42:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,127 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:42:50,127 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:42:50,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:50,128 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 18 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 367 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:42:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:42:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 22:42:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.5421686746987953) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2025-01-09 22:42:50,131 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 43 [2025-01-09 22:42:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,131 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2025-01-09 22:42:50,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2025-01-09 22:42:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:50,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:42:50,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 923988353, now seen corresponding path program 1 times [2025-01-09 22:42:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981451323] [2025-01-09 22:42:50,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:50,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:50,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981451323] [2025-01-09 22:42:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981451323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:42:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217619197] [2025-01-09 22:42:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:50,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:50,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:50,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:50,201 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,215 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2025-01-09 22:42:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-09 22:42:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,217 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:42:50,217 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:42:50,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:42:50,218 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 74 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 275 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:42:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2025-01-09 22:42:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 116 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2025-01-09 22:42:50,222 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 43 [2025-01-09 22:42:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,222 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2025-01-09 22:42:50,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2025-01-09 22:42:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:42:50,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:42:50,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1608133138, now seen corresponding path program 1 times [2025-01-09 22:42:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804063295] [2025-01-09 22:42:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:42:50,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:42:50,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804063295] [2025-01-09 22:42:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804063295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260237079] [2025-01-09 22:42:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:50,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:50,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:50,266 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,334 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-01-09 22:42:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-09 22:42:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,335 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:42:50,335 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:42:50,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:50,336 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:42:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 22:42:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.524390243902439) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2025-01-09 22:42:50,342 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 44 [2025-01-09 22:42:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,343 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2025-01-09 22:42:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2025-01-09 22:42:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:42:50,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:42:50,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1608133137, now seen corresponding path program 1 times [2025-01-09 22:42:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629778813] [2025-01-09 22:42:50,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:42:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:42:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:50,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:50,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629778813] [2025-01-09 22:42:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629778813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:50,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:50,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294607664] [2025-01-09 22:42:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:50,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:50,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:50,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:50,412 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,507 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2025-01-09 22:42:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:50,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-09 22:42:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,508 INFO L225 Difference]: With dead ends: 120 [2025-01-09 22:42:50,508 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 22:42:50,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:50,508 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 22:42:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 22:42:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-01-09 22:42:50,511 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 44 [2025-01-09 22:42:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,511 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-01-09 22:42:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-01-09 22:42:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:42:50,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:42:50,512 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1687480290, now seen corresponding path program 1 times [2025-01-09 22:42:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439173162] [2025-01-09 22:42:50,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:42:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:42:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:42:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439173162] [2025-01-09 22:42:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439173162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:42:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775895050] [2025-01-09 22:42:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:50,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:42:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:50,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:42:50,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:42:50,630 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,722 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2025-01-09 22:42:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-01-09 22:42:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,723 INFO L225 Difference]: With dead ends: 117 [2025-01-09 22:42:50,723 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 22:42:50,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:42:50,724 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 15 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 402 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 22:42:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 22:42:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.475609756097561) internal successors, (121), 111 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2025-01-09 22:42:50,727 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 45 [2025-01-09 22:42:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2025-01-09 22:42:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2025-01-09 22:42:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:42:50,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:42:50,729 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1829078557, now seen corresponding path program 1 times [2025-01-09 22:42:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648878002] [2025-01-09 22:42:50,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:42:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:42:50,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:42:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648878002] [2025-01-09 22:42:50,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648878002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888180922] [2025-01-09 22:42:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:50,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:50,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:50,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:50,838 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,907 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2025-01-09 22:42:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:50,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-01-09 22:42:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,908 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:42:50,909 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:42:50,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:42:50,909 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 77 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 257 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:42:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 22:42:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 107 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-01-09 22:42:50,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 47 [2025-01-09 22:42:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,913 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-01-09 22:42:50,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-01-09 22:42:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:42:50,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:42:50,914 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:50,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1102868442, now seen corresponding path program 1 times [2025-01-09 22:42:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17981050] [2025-01-09 22:42:50,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:50,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:50,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17981050] [2025-01-09 22:42:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17981050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452120051] [2025-01-09 22:42:51,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:51,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:51,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:51,071 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:42:51,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:42:51,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:51,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:51,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:51,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:51,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:42:51,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:51,270 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 9 treesize of output 3 [2025-01-09 22:42:51,282 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-01-09 22:42:51,300 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-01-09 22:42:51,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-01-09 22:42:51,326 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 17 treesize of output 9 [2025-01-09 22:42:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:42:51,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452120051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-01-09 22:42:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727207320] [2025-01-09 22:42:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:42:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:42:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=112, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:42:51,331 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:51,527 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2025-01-09 22:42:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:42:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-01-09 22:42:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:51,528 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:42:51,528 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:42:51,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:42:51,529 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 75 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:51,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 446 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 379 Invalid, 0 Unknown, 223 Unchecked, 0.2s Time] [2025-01-09 22:42:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:42:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 114. [2025-01-09 22:42:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2025-01-09 22:42:51,532 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 49 [2025-01-09 22:42:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2025-01-09 22:42:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2025-01-09 22:42:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:42:51,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:51,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:51,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:42:51,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:51,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1102868441, now seen corresponding path program 1 times [2025-01-09 22:42:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801328666] [2025-01-09 22:42:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:51,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:51,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:51,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:51,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801328666] [2025-01-09 22:42:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801328666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035923807] [2025-01-09 22:42:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:52,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:52,322 INFO L229 MonitoredProcess]: Starting monitored process 10 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 22:42:52,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:42:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:52,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:52,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:52,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:52,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 22:42:52,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:52,475 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 8 treesize of output 1 [2025-01-09 22:42:52,599 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 9 treesize of output 3 [2025-01-09 22:42:52,603 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 9 treesize of output 3 [2025-01-09 22:42:52,640 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-01-09 22:42:52,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:52,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-09 22:42:52,679 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:42:52,680 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 15 treesize of output 15 [2025-01-09 22:42:52,730 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 17 treesize of output 9 [2025-01-09 22:42:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-01-09 22:42:52,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035923807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:52,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 25 [2025-01-09 22:42:52,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056538871] [2025-01-09 22:42:52,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:52,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:42:52,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:52,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:42:52,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=731, Unknown=1, NotChecked=54, Total=870 [2025-01-09 22:42:52,907 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 26 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:53,637 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2025-01-09 22:42:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:42:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-01-09 22:42:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:53,638 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:42:53,638 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:42:53,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1332, Unknown=1, NotChecked=74, Total=1560 [2025-01-09 22:42:53,640 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 169 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 937 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1156 Invalid, 0 Unknown, 162 Unchecked, 0.5s Time] [2025-01-09 22:42:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:42:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 116. [2025-01-09 22:42:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.375) internal successors, (121), 110 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-01-09 22:42:53,644 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 49 [2025-01-09 22:42:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:53,644 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-01-09 22:42:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-01-09 22:42:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:42:53,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:53,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:53,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:53,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:53,845 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1942037, now seen corresponding path program 1 times [2025-01-09 22:42:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288809607] [2025-01-09 22:42:53,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:53,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:42:53,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:42:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288809607] [2025-01-09 22:42:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288809607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645354531] [2025-01-09 22:42:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:53,964 INFO L229 MonitoredProcess]: Starting monitored process 11 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 22:42:53,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:42:54,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:42:54,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:42:54,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:54,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:54,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:42:54,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:54,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:54,141 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2025-01-09 22:42:54,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:54,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:42:54,256 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:54,256 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 11 treesize of output 11 [2025-01-09 22:42:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:54,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:54,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645354531] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:42:54,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:42:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-01-09 22:42:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498130252] [2025-01-09 22:42:54,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:54,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:42:54,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:54,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:42:54,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:42:54,543 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 22:42:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:54,791 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-01-09 22:42:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:42:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 50 [2025-01-09 22:42:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:54,792 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:42:54,792 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:42:54,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=472, Unknown=9, NotChecked=46, Total=650 [2025-01-09 22:42:54,794 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 228 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:54,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 615 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2025-01-09 22:42:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:42:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:42:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-01-09 22:42:54,796 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 50 [2025-01-09 22:42:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:54,796 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-01-09 22:42:54,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 22:42:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-01-09 22:42:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:42:54,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:54,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:54,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:55,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:55,001 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:42:55,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -734909109, now seen corresponding path program 1 times [2025-01-09 22:42:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886365109] [2025-01-09 22:42:55,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:55,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:42:55,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:42:55,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:55,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886365109] [2025-01-09 22:42:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886365109] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283263389] [2025-01-09 22:42:56,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:56,147 INFO L229 MonitoredProcess]: Starting monitored process 12 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 22:42:56,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:42:56,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:42:56,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:42:56,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:56,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:56,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 22:42:56,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:56,423 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 22:42:56,585 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:42:56,675 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:42:56,675 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 22:42:56,770 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 25 treesize of output 13 [2025-01-09 22:42:56,843 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 18 treesize of output 13 [2025-01-09 22:42:57,052 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 17 treesize of output 3 [2025-01-09 22:42:57,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:42:57,121 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 22:42:57,121 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 22:42:57,125 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 26 treesize of output 21 [2025-01-09 22:42:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:57,434 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 33 treesize of output 21 [2025-01-09 22:42:57,488 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 26 treesize of output 21 [2025-01-09 22:42:57,542 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 25 treesize of output 17 [2025-01-09 22:42:57,544 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 21 treesize of output 13 [2025-01-09 22:42:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:57,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:57,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1796) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-01-09 22:42:58,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1795 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| v_ArrVal_1795)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1796) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|))) is different from false [2025-01-09 22:42:58,215 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1795 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| v_ArrVal_1795)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1796) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|))) is different from false [2025-01-09 22:42:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283263389] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:58,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 58 [2025-01-09 22:42:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441834440] [2025-01-09 22:42:58,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-09 22:42:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:58,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-09 22:42:58,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3899, Unknown=61, NotChecked=384, Total=4556 [2025-01-09 22:42:58,330 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:43:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:00,250 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2025-01-09 22:43:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:43:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-01-09 22:43:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:00,251 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:43:00,251 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:43:00,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=500, Invalid=7283, Unknown=61, NotChecked=528, Total=8372 [2025-01-09 22:43:00,253 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 135 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:00,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2140 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:43:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:43:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2025-01-09 22:43:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-01-09 22:43:00,255 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 53 [2025-01-09 22:43:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:00,255 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-01-09 22:43:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 50 states have internal predecessors, (86), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:43:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-01-09 22:43:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:43:00,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:00,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:00,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:00,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 22:43:00,460 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:43:00,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1909335817, now seen corresponding path program 1 times [2025-01-09 22:43:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671105491] [2025-01-09 22:43:00,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:00,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:00,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:00,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671105491] [2025-01-09 22:43:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671105491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586605559] [2025-01-09 22:43:00,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:00,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:00,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:00,986 INFO L229 MonitoredProcess]: Starting monitored process 13 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 22:43:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:43:01,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:01,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:01,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:01,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:01,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:43:01,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:43:01,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:43:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586605559] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:01,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 35 [2025-01-09 22:43:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267566952] [2025-01-09 22:43:01,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:43:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:43:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:43:01,420 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 32 states have internal predecessors, (89), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:02,194 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-01-09 22:43:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 22:43:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 32 states have internal predecessors, (89), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2025-01-09 22:43:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:02,199 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:43:02,199 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:43:02,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=2502, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:43:02,200 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 61 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:02,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1203 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:43:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:43:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2025-01-09 22:43:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-01-09 22:43:02,208 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 55 [2025-01-09 22:43:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-01-09 22:43:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 32 states have internal predecessors, (89), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-01-09 22:43:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:43:02,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:02,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:02,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:02,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:02,410 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:43:02,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1909335730, now seen corresponding path program 1 times [2025-01-09 22:43:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112197215] [2025-01-09 22:43:02,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:02,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:02,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112197215] [2025-01-09 22:43:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112197215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639809920] [2025-01-09 22:43:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:03,160 INFO L229 MonitoredProcess]: Starting monitored process 14 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 22:43:03,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:43:03,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:03,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:03,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:03,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:03,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-01-09 22:43:03,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:03,348 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 8 treesize of output 1 [2025-01-09 22:43:03,350 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 22:43:03,598 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:43:03,599 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 22:43:03,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-01-09 22:43:03,686 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 11 treesize of output 7 [2025-01-09 22:43:03,690 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 11 treesize of output 7 [2025-01-09 22:43:03,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:03,798 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 59 treesize of output 52 [2025-01-09 22:43:03,800 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 22:43:03,938 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 43 treesize of output 19 [2025-01-09 22:43:03,941 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 11 treesize of output 3 [2025-01-09 22:43:03,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:03,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:43:04,224 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:43:04,224 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 22:43:04,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:04,232 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 51 treesize of output 34 [2025-01-09 22:43:04,244 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-01-09 22:43:04,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-01-09 22:43:04,260 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:43:04,260 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 22:43:04,533 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-01-09 22:43:04,533 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 1 case distinctions, treesize of input 53 treesize of output 48 [2025-01-09 22:43:04,545 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-01-09 22:43:04,546 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 1 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 22:43:04,711 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:43:04,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2025-01-09 22:43:04,725 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:43:04,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2025-01-09 22:43:04,759 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 22:43:04,798 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 22:43:04,809 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 22:43:05,020 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 192 treesize of output 124 [2025-01-09 22:43:05,386 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 81 [2025-01-09 22:43:05,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:05,414 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 85 treesize of output 89 [2025-01-09 22:43:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:05,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:06,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2090 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2090) .cse0) .cse1)))) (forall ((v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2090 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2090) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2091) .cse0) .cse1)))))) is different from false [2025-01-09 22:43:06,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2090 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2090) .cse0) .cse1) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2091) .cse0) .cse1)))) (forall ((v_ArrVal_2090 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2090) .cse0) .cse1) 4))))) is different from false [2025-01-09 22:43:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639809920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:06,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2025-01-09 22:43:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798373574] [2025-01-09 22:43:06,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 22:43:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:06,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 22:43:06,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3008, Unknown=34, NotChecked=222, Total=3422 [2025-01-09 22:43:06,570 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:09,781 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2025-01-09 22:43:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-09 22:43:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2025-01-09 22:43:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:09,782 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:43:09,782 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:43:09,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=461, Invalid=7698, Unknown=39, NotChecked=358, Total=8556 [2025-01-09 22:43:09,784 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 174 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:09,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1807 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:43:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:43:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 92. [2025-01-09 22:43:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-01-09 22:43:09,787 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 55 [2025-01-09 22:43:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:09,787 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-01-09 22:43:09,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-01-09 22:43:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:43:09,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:09,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:09,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:43:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:09,988 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-01-09 22:43:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 67400666, now seen corresponding path program 1 times [2025-01-09 22:43:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-01-09 22:43:09,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:10,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:43:10,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:43:10,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733892872] [2025-01-09 22:43:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733892872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111761002] [2025-01-09 22:43:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:10,980 INFO L229 MonitoredProcess]: Starting monitored process 15 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 22:43:10,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:43:11,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:43:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:43:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:11,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-01-09 22:43:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:11,383 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 22:43:11,646 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 9 treesize of output 3 [2025-01-09 22:43:11,744 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:11,846 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:43:11,846 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 15 treesize of output 15 [2025-01-09 22:43:12,199 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 19 treesize of output 11 [2025-01-09 22:43:12,202 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 19 treesize of output 11 [2025-01-09 22:43:12,207 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 22:43:12,279 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-09 22:43:12,280 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 119 treesize of output 76 [2025-01-09 22:43:12,282 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 36 treesize of output 15 [2025-01-09 22:43:12,287 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 55 treesize of output 19 [2025-01-09 22:43:12,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-01-09 22:43:12,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:43:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:43:12,623 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 15 treesize of output 7 [2025-01-09 22:43:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:12,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:12,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2247) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2246) .cse0) .cse1) 4)))) (not (= v_ArrVal_2248 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) is different from false [2025-01-09 22:43:12,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:12,802 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 61 treesize of output 62 [2025-01-09 22:43:12,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:12,816 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 120 treesize of output 123 [2025-01-09 22:43:12,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:12,823 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 100 treesize of output 92 [2025-01-09 22:43:12,831 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 44 treesize of output 38 [2025-01-09 22:43:12,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:12,842 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 158 treesize of output 149 [2025-01-09 22:43:12,849 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 29 treesize of output 23 [2025-01-09 22:43:14,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse3 (not .cse9)) (.cse4 (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (or (not (= v_ArrVal_2248 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))) (.cse12 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse10 (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| 0))) (let ((.cse0 (let ((.cse23 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| (+ .cse23 1)) .cse10) (or (< .cse23 1) .cse10)))) (.cse1 (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248))) (or (not (= (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_97) .cse12)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))))) (.cse5 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= (select (select .cse20 v_arrayElimCell_97) (+ v_arrayElimCell_100 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))))) (.cse6 (or .cse9 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (or (not (= (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_97) (+ v_arrayElimCell_100 4)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse7 (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_97) .cse12))))) .cse9)) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| .cse16)) (.cse11 (or .cse3 .cse4)) (.cse8 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2248 (+ v_arrayElimCell_100 4))) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))))) (and (or .cse0 (and .cse1 (or .cse2 .cse3 .cse4) .cse5 .cse6 .cse7)) (or .cse0 (and .cse8 (or (forall ((v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_DerPreprocessor_5 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_5) (+ v_arrayElimCell_100 4)))) .cse9))) (or .cse2 .cse10 (and .cse1 .cse11 .cse5 .cse6 .cse7)) (or .cse9 (forall ((v_ArrVal_2244 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse12) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse10) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2248 .cse12)) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))) .cse10) (or .cse2 (and .cse11 (or .cse9 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_DerPreprocessor_6 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_100 4))))) .cse8) .cse10) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2244))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4)))))) .cse3 .cse10)))))) is different from false [2025-01-09 22:43:15,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse10 (not .cse2)) (.cse11 (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse3 v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (not (= v_ArrVal_2248 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse6 (< .cse25 0))) (let ((.cse0 (let ((.cse24 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (< .cse24 1) .cse6) (or (< .cse25 (+ .cse24 1)) .cse6)))) (.cse7 (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse23 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_97) .cse4)) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))))) (.cse8 (or .cse2 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse21 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_97) (+ v_arrayElimCell_100 4))) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))))) (.cse12 (or .cse2 (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_97 Int)) (let ((.cse20 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_97) .cse4)) (not (= (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))))) (.cse13 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (let ((.cse19 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_97) (+ v_arrayElimCell_100 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))))) (.cse9 (= .cse3 .cse17)) (.cse1 (forall ((v_ArrVal_2248 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse16 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2248 (+ v_arrayElimCell_100 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (not (= (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248)))))) (.cse15 (or .cse10 .cse11))) (and (or .cse0 (and .cse1 (or .cse2 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_DerPreprocessor_5 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse3 v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_5) (+ v_arrayElimCell_100 4))))))) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse5 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2248 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (not (= (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))) .cse6) (or .cse0 (and .cse7 .cse8 (or .cse9 .cse10 .cse11) .cse12 .cse13)) (or (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_98 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse3 v_ArrVal_2244))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2248) v_arrayElimCell_98) (+ v_arrayElimCell_101 4))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2248 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2248))))) .cse10 .cse6) (or .cse2 .cse6 (forall ((v_ArrVal_2244 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse3 v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4)))) (or .cse9 .cse6 (and .cse7 .cse8 .cse12 .cse13 .cse15)) (or .cse9 (and .cse1 (or .cse2 (forall ((v_arrayElimCell_100 Int) (v_ArrVal_2244 (Array Int Int)) (v_DerPreprocessor_6 Int)) (= (select (store (select (store |c_#memory_int#1| .cse3 v_ArrVal_2244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_100 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse15) .cse6)))))) is different from false [2025-01-09 22:43:17,738 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2025-01-09 22:43:17,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 3146 treesize of output 3327 [2025-01-09 22:43:17,850 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 1880 treesize of output 1876 [2025-01-09 22:43:18,053 INFO L224 Elim1Store]: Index analysis took 114 ms [2025-01-09 22:43:20,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:20,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2390 treesize of output 3840 [2025-01-09 22:43:21,000 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:43:21,001 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 2181 treesize of output 2215 [2025-01-09 22:43:21,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2168 treesize of output 2176 [2025-01-09 22:43:22,285 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-01-09 22:43:22,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2163 treesize of output 2182 [2025-01-09 22:43:23,264 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:23,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2154 treesize of output 2169 [2025-01-09 22:43:23,912 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 2145 treesize of output 2143 [2025-01-09 22:43:24,472 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:24,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2143 treesize of output 2158 [2025-01-09 22:43:25,030 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:25,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2134 treesize of output 2149 [2025-01-09 22:43:25,605 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:43:25,606 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 2125 treesize of output 2159 [2025-01-09 22:43:26,190 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:26,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2112 treesize of output 2127 [2025-01-09 22:43:26,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:26,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2103 treesize of output 2111 [2025-01-09 22:43:27,712 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-01-09 22:43:27,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2098 treesize of output 2117 [2025-01-09 22:43:28,665 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 2089 treesize of output 2085 [2025-01-09 22:43:29,201 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 2099 treesize of output 2095 [2025-01-09 22:43:29,788 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:29,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2095 treesize of output 2110 [2025-01-09 22:43:30,470 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 2086 treesize of output 2082 [2025-01-09 22:43:31,054 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2082 treesize of output 2097 [2025-01-09 22:43:31,618 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 2087 treesize of output 2083