./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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-?-798a7b3-m [2025-03-04 07:57:42,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:57:42,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:57:42,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:57:42,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:57:42,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:57:42,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:57:42,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:57:42,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:57:42,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:57:42,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:57:42,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:57:42,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:57:42,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:57:42,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:57:42,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:57:42,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:57:42,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-03-04 07:57:42,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:57:42,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:57:42,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:57:42,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:57:42,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:57:42,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-03-04 07:57:43,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963144898/037385eef9364f10a8814be5e06e7f62/FLAGde7ab09ef [2025-03-04 07:57:43,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:57:43,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-03-04 07:57:43,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963144898/037385eef9364f10a8814be5e06e7f62/FLAGde7ab09ef [2025-03-04 07:57:44,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963144898/037385eef9364f10a8814be5e06e7f62 [2025-03-04 07:57:44,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:57:44,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:57:44,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:57:44,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:57:44,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:57:44,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5770b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44, skipping insertion in model container [2025-03-04 07:57:44,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:57:44,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:57:44,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:57:44,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:57:44,410 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:57:44,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44 WrapperNode [2025-03-04 07:57:44,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:57:44,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:57:44,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:57:44,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:57:44,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,441 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-03-04 07:57:44,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:57:44,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:57:44,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:57:44,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:57:44,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,462 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-03-04 07:57:44,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:57:44,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:57:44,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:57:44,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:57:44,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (1/1) ... [2025-03-04 07:57:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:57:44,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:44,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:57:44,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-04 07:57:44,511 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:57:44,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:57:44,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:57:44,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:57:44,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-04 07:57:44,859 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 07:57:44,873 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2025-03-04 07:57:44,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:57:44,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:57:44,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:57:44,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:57:44 BoogieIcfgContainer [2025-03-04 07:57:44,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:57:44,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:57:44,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:57:44,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:57:44,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:57:44" (1/3) ... [2025-03-04 07:57:44,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a59f9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:57:44, skipping insertion in model container [2025-03-04 07:57:44,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:57:44" (2/3) ... [2025-03-04 07:57:44,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a59f9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:57:44, skipping insertion in model container [2025-03-04 07:57:44,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:57:44" (3/3) ... [2025-03-04 07:57:44,892 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2025-03-04 07:57:44,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:57:44,903 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-03-04 07:57:44,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:57:44,936 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;@5e40543e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:57:44,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 07:57:44,940 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-03-04 07:57:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:57:44,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:44,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:57:44,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:44,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1088906869, now seen corresponding path program 1 times [2025-03-04 07:57:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479739375] [2025-03-04 07:57:44,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:57:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:57:45,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:45,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:57:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479739375] [2025-03-04 07:57:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479739375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:57:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596580987] [2025-03-04 07:57:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:45,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:57:45,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:45,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:57:45,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:57:45,213 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-03-04 07:57:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:45,316 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-04 07:57:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:57:45,318 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-03-04 07:57:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:45,324 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:57:45,324 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 07:57:45,325 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-03-04 07:57:45,327 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 07:57:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 07:57:45,357 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-03-04 07:57:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-03-04 07:57:45,362 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2025-03-04 07:57:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:45,362 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-03-04 07:57:45,362 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-03-04 07:57:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-03-04 07:57:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:57:45,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:45,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:57:45,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:57:45,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1088906868, now seen corresponding path program 1 times [2025-03-04 07:57:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794819847] [2025-03-04 07:57:45,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:45,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:57:45,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:57:45,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:45,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:57:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794819847] [2025-03-04 07:57:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794819847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:45,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:57:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516266808] [2025-03-04 07:57:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:45,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:57:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:45,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:57:45,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:57:45,424 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-03-04 07:57:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:45,521 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-04 07:57:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:57:45,521 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-03-04 07:57:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:45,522 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:57:45,523 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:57:45,524 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-03-04 07:57:45,524 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:57:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:57:45,533 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-03-04 07:57:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-04 07:57:45,536 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2025-03-04 07:57:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:45,536 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-04 07:57:45,536 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-03-04 07:57:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-04 07:57:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:57:45,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:45,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:57:45,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:57:45,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:45,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1226484269, now seen corresponding path program 1 times [2025-03-04 07:57:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829535310] [2025-03-04 07:57:45,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:45,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:57:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:57:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:57:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829535310] [2025-03-04 07:57:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829535310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:57:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338852792] [2025-03-04 07:57:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:45,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:57:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:57:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:57:45,639 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-03-04 07:57:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:45,654 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-03-04 07:57:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:57:45,655 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-03-04 07:57:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:45,656 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:57:45,656 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:57:45,656 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-03-04 07:57:45,656 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-03-04 07:57:45,657 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-03-04 07:57:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:57:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2025-03-04 07:57:45,668 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-03-04 07:57:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-03-04 07:57:45,670 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 13 [2025-03-04 07:57:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:45,670 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-03-04 07:57:45,671 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-03-04 07:57:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-03-04 07:57:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:57:45,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:45,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:57:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:57:45,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash -913393233, now seen corresponding path program 1 times [2025-03-04 07:57:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126769758] [2025-03-04 07:57:45,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:45,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:57:45,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:57:45,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:45,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126769758] [2025-03-04 07:57:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126769758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137852047] [2025-03-04 07:57:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:57:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:45,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:57:45,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:45,963 INFO L87 Difference]: Start difference. First operand 137 states and 149 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-03-04 07:57:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:46,120 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-04 07:57:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:57:46,120 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-03-04 07:57:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:46,121 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:57:46,121 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:57:46,121 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-03-04 07:57:46,122 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:46,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 476 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:57:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:57:46,125 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-03-04 07:57:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-04 07:57:46,126 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 22 [2025-03-04 07:57:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:46,126 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-04 07:57:46,126 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-03-04 07:57:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-04 07:57:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:57:46,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:46,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:57:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:57:46,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -913393234, now seen corresponding path program 1 times [2025-03-04 07:57:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278534015] [2025-03-04 07:57:46,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:57:46,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:57:46,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:57:46,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278534015] [2025-03-04 07:57:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278534015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:46,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027482105] [2025-03-04 07:57:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:46,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:57:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:57:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:46,199 INFO L87 Difference]: Start difference. First operand 136 states and 148 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-03-04 07:57:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:46,347 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-03-04 07:57:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:57:46,347 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-03-04 07:57:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:46,348 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:57:46,348 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:57:46,348 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-03-04 07:57:46,349 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:46,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:57:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 07:57:46,352 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-03-04 07:57:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-03-04 07:57:46,353 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 22 [2025-03-04 07:57:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:46,353 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-03-04 07:57:46,353 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-03-04 07:57:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-03-04 07:57:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:57:46,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:46,354 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-03-04 07:57:46,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:57:46,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:46,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2015063799, now seen corresponding path program 1 times [2025-03-04 07:57:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034077920] [2025-03-04 07:57:46,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:46,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:57:46,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:57:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034077920] [2025-03-04 07:57:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034077920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43263573] [2025-03-04 07:57:46,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:46,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:46,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:57:46,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:57:46,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:57:46,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:46,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:57:46,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:46,698 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-03-04 07:57:46,738 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-03-04 07:57:46,794 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:57:46,794 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-03-04 07:57:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:57:46,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43263573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:46,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:46,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-04 07:57:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047408124] [2025-03-04 07:57:46,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:57:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:46,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:57:46,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:57:46,872 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-03-04 07:57:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:47,194 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-03-04 07:57:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:57:47,194 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-03-04 07:57:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:47,195 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:57:47,195 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:57:47,195 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-03-04 07:57:47,196 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:47,196 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.3s Time] [2025-03-04 07:57:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:57:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-04 07:57:47,201 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-03-04 07:57:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-04 07:57:47,201 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 25 [2025-03-04 07:57:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:47,202 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-04 07:57:47,202 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-03-04 07:57:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-04 07:57:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:57:47,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:47,202 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-03-04 07:57:47,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:57:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:57:47,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:47,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2015063800, now seen corresponding path program 1 times [2025-03-04 07:57:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036414396] [2025-03-04 07:57:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:47,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:57:47,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:57:47,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036414396] [2025-03-04 07:57:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036414396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055503744] [2025-03-04 07:57:47,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:47,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:47,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:57:47,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:57:47,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:57:47,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:47,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:47,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:57:47,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:47,763 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-03-04 07:57:47,914 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:57:47,914 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-03-04 07:57:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:47,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055503744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:48,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 07:57:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426572526] [2025-03-04 07:57:48,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:57:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:48,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:57:48,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:57:48,070 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:57:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:48,514 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2025-03-04 07:57:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:57:48,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 2 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-03-04 07:57:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:48,515 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:57:48,515 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:57:48,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:57:48,516 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:48,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1036 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:57:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:57:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-03-04 07:57:48,519 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-03-04 07:57:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-03-04 07:57:48,520 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 25 [2025-03-04 07:57:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-03-04 07:57:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:57:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-03-04 07:57:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:57:48,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:48,521 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-03-04 07:57:48,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:57:48,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:57:48,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1827198731, now seen corresponding path program 1 times [2025-03-04 07:57:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350416975] [2025-03-04 07:57:48,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:57:48,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:57:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:57:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350416975] [2025-03-04 07:57:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350416975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698970523] [2025-03-04 07:57:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:49,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:49,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:49,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:49,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:57:49,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:57:49,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:57:49,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:49,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:49,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:57:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:49,285 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-03-04 07:57:49,295 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-03-04 07:57:49,301 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-03-04 07:57:49,325 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:57:49,326 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-03-04 07:57:49,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-03-04 07:57:49,355 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-03-04 07:57:49,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:57:49,391 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-03-04 07:57:49,434 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:57:49,435 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-03-04 07:57:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2025-03-04 07:57:49,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698970523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:49,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-03-04 07:57:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333574754] [2025-03-04 07:57:49,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:57:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:49,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:57:49,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2025-03-04 07:57:49,606 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:57:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:49,991 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-03-04 07:57:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:57:49,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-03-04 07:57:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:49,992 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:57:49,992 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:57:49,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2025-03-04 07:57:49,993 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 146 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:49,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 451 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 505 Invalid, 0 Unknown, 298 Unchecked, 0.3s Time] [2025-03-04 07:57:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:57:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2025-03-04 07:57:49,995 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-03-04 07:57:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-03-04 07:57:50,000 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 37 [2025-03-04 07:57:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:50,001 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-03-04 07:57:50,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:57:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-03-04 07:57:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:57:50,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:50,002 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-03-04 07:57:50,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:57:50,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:50,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1827198732, now seen corresponding path program 1 times [2025-03-04 07:57:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840318390] [2025-03-04 07:57:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:50,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:57:50,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:57:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:57:50,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840318390] [2025-03-04 07:57:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840318390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252321293] [2025-03-04 07:57:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:50,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:50,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:57:50,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:57:50,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:57:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:50,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:57:50,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:50,736 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-03-04 07:57:50,744 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-03-04 07:57:50,751 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-03-04 07:57:50,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:57:50,787 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-03-04 07:57:50,808 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-03-04 07:57:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:57:50,849 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-03-04 07:57:50,898 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-03-04 07:57:50,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:57:50,947 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-03-04 07:57:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:50,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:57:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252321293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:57:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2025-03-04 07:57:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832913044] [2025-03-04 07:57:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:57:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:57:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:57:50,956 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-03-04 07:57:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:51,080 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2025-03-04 07:57:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:57:51,080 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-03-04 07:57:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:51,081 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:57:51,081 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:57:51,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:57:51,083 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-03-04 07:57:51,083 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-03-04 07:57:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:57:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 07:57:51,085 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-03-04 07:57:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2025-03-04 07:57:51,086 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 37 [2025-03-04 07:57:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:51,086 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2025-03-04 07:57:51,086 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-03-04 07:57:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2025-03-04 07:57:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:57:51,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:51,087 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-03-04 07:57:51,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:57:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:51,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -338016043, now seen corresponding path program 1 times [2025-03-04 07:57:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154310295] [2025-03-04 07:57:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:57:51,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:57:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154310295] [2025-03-04 07:57:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154310295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757637003] [2025-03-04 07:57:51,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:51,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:51,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:51,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:51,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:57:51,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:57:51,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:57:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:51,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 07:57:51,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:51,783 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-03-04 07:57:51,885 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-03-04 07:57:51,915 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-03-04 07:57:51,937 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:57:51,938 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-03-04 07:57:51,946 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-03-04 07:57:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-03-04 07:57:51,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757637003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:51,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2025-03-04 07:57:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51614262] [2025-03-04 07:57:52,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:57:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:52,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:57:52,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=447, Unknown=1, NotChecked=42, Total=552 [2025-03-04 07:57:52,001 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 20 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-03-04 07:57:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:52,642 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-03-04 07:57:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:57:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 20 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-03-04 07:57:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:52,643 INFO L225 Difference]: With dead ends: 149 [2025-03-04 07:57:52,643 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 07:57:52,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=819, Unknown=1, NotChecked=58, Total=992 [2025-03-04 07:57:52,644 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 257 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:52,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1130 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1138 Invalid, 0 Unknown, 163 Unchecked, 0.5s Time] [2025-03-04 07:57:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 07:57:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2025-03-04 07:57:52,649 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-03-04 07:57:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2025-03-04 07:57:52,650 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 40 [2025-03-04 07:57:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:52,651 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2025-03-04 07:57:52,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 20 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-03-04 07:57:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2025-03-04 07:57:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:57:52,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:52,652 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-03-04 07:57:52,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:57:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:57:52,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -338016042, now seen corresponding path program 1 times [2025-03-04 07:57:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834367996] [2025-03-04 07:57:52,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:52,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:57:52,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:57:52,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:52,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834367996] [2025-03-04 07:57:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834367996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805554441] [2025-03-04 07:57:53,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:53,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:57:53,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:57:53,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:57:53,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:53,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:53,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 07:57:53,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:53,376 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-03-04 07:57:53,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:57:53,606 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-03-04 07:57:53,609 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-03-04 07:57:53,639 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-03-04 07:57:53,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:57:53,678 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-03-04 07:57:53,690 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:57:53,690 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-03-04 07:57:53,736 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-03-04 07:57:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:57:53,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805554441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:53,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:53,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-03-04 07:57:53,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538681217] [2025-03-04 07:57:53,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:57:53,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:53,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:57:53,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=795, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:57:53,945 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:57:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:55,057 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2025-03-04 07:57:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:57:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-03-04 07:57:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:55,058 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:57:55,058 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:57:55,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1805, Unknown=1, NotChecked=86, Total=2070 [2025-03-04 07:57:55,059 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 277 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:55,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1334 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1480 Invalid, 0 Unknown, 165 Unchecked, 0.7s Time] [2025-03-04 07:57:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:57:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2025-03-04 07:57:55,063 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-03-04 07:57:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2025-03-04 07:57:55,064 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 40 [2025-03-04 07:57:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:55,064 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2025-03-04 07:57:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:57:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2025-03-04 07:57:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:57:55,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:55,065 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-03-04 07:57:55,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:57:55,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:55,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:55,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1888561810, now seen corresponding path program 1 times [2025-03-04 07:57:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003852402] [2025-03-04 07:57:55,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:55,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:57:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:57:55,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:55,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003852402] [2025-03-04 07:57:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003852402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:57:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488476800] [2025-03-04 07:57:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:55,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:57:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:57:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:57:55,310 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-03-04 07:57:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:55,321 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-03-04 07:57:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:57:55,322 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-03-04 07:57:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:55,322 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:57:55,322 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:57:55,322 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-03-04 07:57:55,323 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-03-04 07:57:55,323 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-03-04 07:57:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:57:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 07:57:55,326 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-03-04 07:57:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2025-03-04 07:57:55,326 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 41 [2025-03-04 07:57:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2025-03-04 07:57:55,327 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-03-04 07:57:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2025-03-04 07:57:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:57:55,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:55,328 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-03-04 07:57:55,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:57:55,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1863323395, now seen corresponding path program 1 times [2025-03-04 07:57:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998509420] [2025-03-04 07:57:55,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:55,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:57:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:57:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:57:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998509420] [2025-03-04 07:57:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998509420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064333625] [2025-03-04 07:57:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:57:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:57:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:55,399 INFO L87 Difference]: Start difference. First operand 129 states and 141 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-03-04 07:57:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:55,510 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2025-03-04 07:57:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:57:55,510 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-03-04 07:57:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:55,511 INFO L225 Difference]: With dead ends: 126 [2025-03-04 07:57:55,512 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:57:55,512 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-03-04 07:57:55,512 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:55,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 371 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:57:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 07:57:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 120 states have internal predecessors, (132), 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-03-04 07:57:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2025-03-04 07:57:55,515 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 43 [2025-03-04 07:57:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2025-03-04 07:57:55,516 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-03-04 07:57:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2025-03-04 07:57:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:57:55,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:55,517 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-03-04 07:57:55,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:57:55,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1863323396, now seen corresponding path program 1 times [2025-03-04 07:57:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927659220] [2025-03-04 07:57:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:55,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:57:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:57:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:55,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:57:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927659220] [2025-03-04 07:57:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927659220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093095294] [2025-03-04 07:57:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:55,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:55,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:57:55,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:57:55,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:57:55,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:55,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:55,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:57:55,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:55,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:57:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093095294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:57:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-03-04 07:57:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406367984] [2025-03-04 07:57:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:57:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:55,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:57:55,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:57:55,784 INFO L87 Difference]: Start difference. First operand 126 states and 138 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-03-04 07:57:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:55,804 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2025-03-04 07:57:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:57:55,805 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-03-04 07:57:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:55,806 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:57:55,806 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:57:55,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:55,806 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:55,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:57:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:57:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-04 07:57:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 119 states have internal predecessors, (130), 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-03-04 07:57:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2025-03-04 07:57:55,811 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 43 [2025-03-04 07:57:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:55,811 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2025-03-04 07:57:55,811 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-03-04 07:57:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2025-03-04 07:57:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:57:55,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:55,812 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-03-04 07:57:55,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:57:56,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:56,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1862464581, now seen corresponding path program 1 times [2025-03-04 07:57:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42704457] [2025-03-04 07:57:56,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:57:56,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:57:56,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:56,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42704457] [2025-03-04 07:57:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42704457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951174557] [2025-03-04 07:57:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:57:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:57:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:57:56,114 INFO L87 Difference]: Start difference. First operand 125 states and 136 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-03-04 07:57:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:56,132 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2025-03-04 07:57:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:57:56,133 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-03-04 07:57:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:56,133 INFO L225 Difference]: With dead ends: 126 [2025-03-04 07:57:56,134 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:57:56,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:57:56,134 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 72 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:56,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:57:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:57:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2025-03-04 07:57:56,137 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-03-04 07:57:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2025-03-04 07:57:56,137 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 43 [2025-03-04 07:57:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:56,137 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2025-03-04 07:57:56,137 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-03-04 07:57:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2025-03-04 07:57:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:57:56,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:56,138 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-03-04 07:57:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:57:56,138 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1901828094, now seen corresponding path program 1 times [2025-03-04 07:57:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171637575] [2025-03-04 07:57:56,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:56,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:57:56,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:57:56,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:56,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171637575] [2025-03-04 07:57:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171637575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:56,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:56,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:57:56,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232367652] [2025-03-04 07:57:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:56,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:57:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:56,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:57:56,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:57:56,181 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-03-04 07:57:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:56,245 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-03-04 07:57:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:57:56,246 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-03-04 07:57:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:56,247 INFO L225 Difference]: With dead ends: 121 [2025-03-04 07:57:56,247 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:57:56,247 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-03-04 07:57:56,247 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-03-04 07:57:56,247 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-03-04 07:57:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:57:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 07:57:56,249 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-03-04 07:57:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2025-03-04 07:57:56,251 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 44 [2025-03-04 07:57:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:56,252 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2025-03-04 07:57:56,252 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-03-04 07:57:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2025-03-04 07:57:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:57:56,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:56,252 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-03-04 07:57:56,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:57:56,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1901828095, now seen corresponding path program 1 times [2025-03-04 07:57:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:56,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455268090] [2025-03-04 07:57:56,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:56,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:57:56,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:57:56,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455268090] [2025-03-04 07:57:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455268090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849916141] [2025-03-04 07:57:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:56,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:56,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:57:56,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:57:56,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:57:56,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:56,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:56,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:57:56,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:56,875 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 7 treesize of output 3 [2025-03-04 07:57:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:56,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:57:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849916141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:57:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2025-03-04 07:57:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385592958] [2025-03-04 07:57:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:56,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:57:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:56,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:57:56,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:57:56,922 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-03-04 07:57:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:56,970 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2025-03-04 07:57:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:57:56,970 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-03-04 07:57:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:56,970 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:57:56,970 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:57:56,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:57:56,971 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:56,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:57:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:57:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 07:57:56,973 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-03-04 07:57:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-03-04 07:57:56,973 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 44 [2025-03-04 07:57:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:56,976 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-03-04 07:57:56,976 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-03-04 07:57:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-03-04 07:57:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:57:56,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:56,976 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-03-04 07:57:56,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:57:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 07:57:57,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1172871169, now seen corresponding path program 1 times [2025-03-04 07:57:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752602185] [2025-03-04 07:57:57,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:57:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:57:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:57:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752602185] [2025-03-04 07:57:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752602185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168181173] [2025-03-04 07:57:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:57:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:57:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:57,306 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 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-03-04 07:57:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:57,408 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2025-03-04 07:57:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:57:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 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-03-04 07:57:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:57,409 INFO L225 Difference]: With dead ends: 117 [2025-03-04 07:57:57,409 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 07:57:57,409 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-03-04 07:57:57,410 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 13 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:57:57,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 371 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:57:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 07:57:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 07:57:57,412 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-03-04 07:57:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2025-03-04 07:57:57,412 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 45 [2025-03-04 07:57:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2025-03-04 07:57:57,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 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-03-04 07:57:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2025-03-04 07:57:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:57:57,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:57,413 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-03-04 07:57:57,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:57:57,413 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1847760932, now seen corresponding path program 1 times [2025-03-04 07:57:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:57,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928622278] [2025-03-04 07:57:57,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:57,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:57:57,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:57:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 07:57:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928622278] [2025-03-04 07:57:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928622278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:57:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:57:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955133576] [2025-03-04 07:57:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:57,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:57:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:57,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:57:57,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:57:57,512 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-03-04 07:57:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:57,584 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2025-03-04 07:57:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:57:57,584 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-03-04 07:57:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:57,585 INFO L225 Difference]: With dead ends: 114 [2025-03-04 07:57:57,585 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 07:57:57,585 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-03-04 07:57:57,586 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-03-04 07:57:57,586 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-03-04 07:57:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 07:57:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 07:57:57,589 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-03-04 07:57:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-03-04 07:57:57,590 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 47 [2025-03-04 07:57:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:57,590 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-03-04 07:57:57,590 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-03-04 07:57:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-03-04 07:57:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:57:57,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:57,590 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-03-04 07:57:57,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:57:57,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:57,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1876761609, now seen corresponding path program 1 times [2025-03-04 07:57:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446503178] [2025-03-04 07:57:57,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:57,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:57:57,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:57:57,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:57,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:57:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446503178] [2025-03-04 07:57:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446503178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461931676] [2025-03-04 07:57:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:57,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:57,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:57,724 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:57:57,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:57:57,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:57:57,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:57,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:57:57,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:57,903 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-03-04 07:57:57,914 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-03-04 07:57:57,930 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:57:57,930 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-03-04 07:57:57,951 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-03-04 07:57:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:57:57,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:57:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461931676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:57:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:57:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-03-04 07:57:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335633972] [2025-03-04 07:57:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:57:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:57:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:57,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:57:57,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=112, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:57:57,955 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-03-04 07:57:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:57:58,135 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2025-03-04 07:57:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:57:58,136 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-03-04 07:57:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:57:58,137 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:57:58,137 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:57:58,137 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-03-04 07:57:58,138 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-03-04 07:57:58,138 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-03-04 07:57:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:57:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 114. [2025-03-04 07:57:58,140 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-03-04 07:57:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2025-03-04 07:57:58,141 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 49 [2025-03-04 07:57:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:57:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2025-03-04 07:57:58,141 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-03-04 07:57:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2025-03-04 07:57:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:57:58,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:57:58,142 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-03-04 07:57:58,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:57:58,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:58,346 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:57:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:57:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1876761608, now seen corresponding path program 1 times [2025-03-04 07:57:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:57:58,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532642960] [2025-03-04 07:57:58,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:57:58,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:57:58,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:57:58,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:58,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:57:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:57:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532642960] [2025-03-04 07:57:58,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532642960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100401725] [2025-03-04 07:57:58,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:57:58,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:57:58,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:57:58,949 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:57:58,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:57:59,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 07:57:59,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:57:59,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:57:59,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:57:59,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:57:59,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:57:59,101 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-03-04 07:57:59,103 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-03-04 07:57:59,310 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-03-04 07:57:59,313 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-03-04 07:57:59,349 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$#1.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-03-04 07:57:59,389 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:57:59,389 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-03-04 07:57:59,392 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-03-04 07:57:59,438 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-03-04 07:57:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-03-04 07:57:59,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:57:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100401725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:57:59,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:57:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2025-03-04 07:57:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714250265] [2025-03-04 07:57:59,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:57:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:57:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:57:59,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:57:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=853, Unknown=1, NotChecked=58, Total=992 [2025-03-04 07:57:59,620 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 28 states, 26 states have (on average 2.730769230769231) internal successors, (71), 24 states have internal predecessors, (71), 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-03-04 07:58:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:58:00,556 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2025-03-04 07:58:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:58:00,556 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.730769230769231) internal successors, (71), 24 states have internal predecessors, (71), 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-03-04 07:58:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:58:00,557 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:58:00,557 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:58:00,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=2073, Unknown=1, NotChecked=92, Total=2352 [2025-03-04 07:58:00,558 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:58:00,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1197 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1544 Invalid, 0 Unknown, 164 Unchecked, 0.6s Time] [2025-03-04 07:58:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:58:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2025-03-04 07:58:00,560 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-03-04 07:58:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-03-04 07:58:00,560 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 49 [2025-03-04 07:58:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:58:00,561 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-03-04 07:58:00,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.730769230769231) internal successors, (71), 24 states have internal predecessors, (71), 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-03-04 07:58:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-03-04 07:58:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 07:58:00,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:58:00,565 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-03-04 07:58:00,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:58:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:58:00,765 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:58:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:58:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 789041807, now seen corresponding path program 1 times [2025-03-04 07:58:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:58:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914263948] [2025-03-04 07:58:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:58:00,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:58:00,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:58:00,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:00,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:58:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:58:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914263948] [2025-03-04 07:58:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914263948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609626612] [2025-03-04 07:58:00,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:00,867 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:58:00,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:58:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:58:01,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:58:01,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:01,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:01,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:58:01,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:58:01,021 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-03-04 07:58:01,033 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-03-04 07:58:01,048 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-03-04 07:58:01,070 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-03-04 07:58:01,096 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-03-04 07:58:01,141 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:58:01,141 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-03-04 07:58:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:58:01,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:58:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:58:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609626612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:58:01,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:58:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-03-04 07:58:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449714395] [2025-03-04 07:58:01,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:58:01,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:58:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:58:01,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:58:01,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:58:01,414 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-03-04 07:58:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:58:01,627 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-03-04 07:58:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:58:01,631 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-03-04 07:58:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:58:01,631 INFO L225 Difference]: With dead ends: 101 [2025-03-04 07:58:01,631 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:58:01,632 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-03-04 07:58:01,633 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 297 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:58:01,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 667 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 497 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2025-03-04 07:58:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:58:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 07:58:01,636 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-03-04 07:58:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-03-04 07:58:01,636 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 50 [2025-03-04 07:58:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:58:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-03-04 07:58:01,636 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-03-04 07:58:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-03-04 07:58:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:58:01,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:58:01,637 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-03-04 07:58:01,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:58:01,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:58:01,837 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:58:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:58:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1000867086, now seen corresponding path program 1 times [2025-03-04 07:58:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:58:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511310218] [2025-03-04 07:58:01,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:58:01,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:58:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:58:01,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:01,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:58:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:58:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511310218] [2025-03-04 07:58:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511310218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705326943] [2025-03-04 07:58:03,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:03,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:03,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:58:03,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:58:03,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:58:03,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:58:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:03,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-04 07:58:03,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:58:03,339 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-03-04 07:58:03,478 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-03-04 07:58:03,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:58:03,535 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-03-04 07:58:03,600 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-03-04 07:58:03,707 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-03-04 07:58:03,845 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 3 [2025-03-04 07:58:03,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-03-04 07:58:03,915 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:58:03,915 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 26 treesize of output 29 [2025-03-04 07:58:03,919 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 11 treesize of output 3 [2025-03-04 07:58:03,930 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:58:03,930 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-03-04 07:58:04,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:58:04,216 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 45 treesize of output 21 [2025-03-04 07:58:04,274 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-03-04 07:58:04,316 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-03-04 07:58:04,318 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-03-04 07:58:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:58:04,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:58:04,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1850) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_1849 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_1849)))) is different from false [2025-03-04 07:58:04,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1850) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| (select v_ArrVal_1849 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|)) v_ArrVal_1849)) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|))) is different from false [2025-03-04 07:58:04,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (or (not (= v_ArrVal_1849 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| (select v_ArrVal_1849 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|)))) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1850) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-03-04 07:58:04,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_1849) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1850) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< (select (select |c_#memory_$Pointer$#1.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|) (not (= (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| (select v_ArrVal_1849 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|)) v_ArrVal_1849))))) is different from false [2025-03-04 07:58:04,654 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| Int) (v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_1849) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1850) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< (select (select |c_#memory_$Pointer$#1.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|) (not (= (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23| (select v_ArrVal_1849 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_23|)) v_ArrVal_1849))))) is different from false [2025-03-04 07:58:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705326943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:04,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:58:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 59 [2025-03-04 07:58:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778972322] [2025-03-04 07:58:04,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:58:04,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-04 07:58:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:58:04,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-04 07:58:04,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3811, Unknown=20, NotChecked=640, Total=4692 [2025-03-04 07:58:04,765 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 59 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 51 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-03-04 07:58:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:58:06,191 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2025-03-04 07:58:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:58:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 51 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-03-04 07:58:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:58:06,192 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:58:06,192 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:58:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=440, Invalid=6870, Unknown=20, NotChecked=860, Total=8190 [2025-03-04 07:58:06,193 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 120 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:58:06,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 2420 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:58:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:58:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2025-03-04 07:58:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.309278350515464) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 07:58:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2025-03-04 07:58:06,196 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 53 [2025-03-04 07:58:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:58:06,196 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2025-03-04 07:58:06,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 51 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-03-04 07:58:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2025-03-04 07:58:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 07:58:06,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:58:06,197 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-03-04 07:58:06,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:58:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:58:06,398 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:58:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:58:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -147792229, now seen corresponding path program 1 times [2025-03-04 07:58:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:58:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913935276] [2025-03-04 07:58:06,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:58:06,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:58:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:58:06,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:06,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:58:06,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:58:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913935276] [2025-03-04 07:58:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913935276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549299687] [2025-03-04 07:58:06,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:06,955 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:58:06,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:58:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:58:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:58:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:07,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:58:07,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:58:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:58:07,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:58:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:58:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549299687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:58:07,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:58:07,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 35 [2025-03-04 07:58:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53436578] [2025-03-04 07:58:07,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:58:07,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:58:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:58:07,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:58:07,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:58:07,375 INFO L87 Difference]: Start difference. First operand 125 states and 137 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-03-04 07:58:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:58:08,131 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2025-03-04 07:58:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:58:08,132 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-03-04 07:58:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:58:08,133 INFO L225 Difference]: With dead ends: 126 [2025-03-04 07:58:08,133 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:58:08,133 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-03-04 07:58:08,133 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:58:08,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1217 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:58:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:58:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2025-03-04 07:58:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 110 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 07:58:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2025-03-04 07:58:08,136 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 55 [2025-03-04 07:58:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:58:08,136 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2025-03-04 07:58:08,136 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-03-04 07:58:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2025-03-04 07:58:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 07:58:08,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:58:08,137 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-03-04 07:58:08,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:58:08,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:58:08,338 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:58:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:58:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -147792212, now seen corresponding path program 1 times [2025-03-04 07:58:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:58:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251791729] [2025-03-04 07:58:08,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:58:08,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:58:08,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:58:08,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:08,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:58:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:58:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251791729] [2025-03-04 07:58:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251791729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982868878] [2025-03-04 07:58:09,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:09,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:09,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:58:09,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:58:09,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 07:58:09,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 07:58:09,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:09,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:09,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-04 07:58:09,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:58:09,196 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-03-04 07:58:09,198 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-03-04 07:58:09,389 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:58:09,389 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-03-04 07:58:09,397 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-03-04 07:58:09,464 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-03-04 07:58:09,472 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-03-04 07:58:09,570 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:58:09,570 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-03-04 07:58:09,575 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-03-04 07:58:09,697 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-03-04 07:58:09,700 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-03-04 07:58:09,703 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-03-04 07:58:09,706 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 11 treesize of output 3 [2025-03-04 07:58:09,986 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:58:09,986 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-03-04 07:58:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:58:09,996 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-03-04 07:58:10,007 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-04 07:58:10,007 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-03-04 07:58:10,026 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-04 07:58:10,027 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-03-04 07:58:10,352 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-03-04 07:58:10,352 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-03-04 07:58:10,366 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-03-04 07:58:10,366 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-03-04 07:58:10,519 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-04 07:58:10,519 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 98 treesize of output 82 [2025-03-04 07:58:10,531 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-04 07:58:10,531 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 107 treesize of output 109 [2025-03-04 07:58:10,570 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-03-04 07:58:10,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 5 treesize of output 3 [2025-03-04 07:58:10,627 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-03-04 07:58:10,833 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 195 treesize of output 127 [2025-03-04 07:58:11,152 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 124 treesize of output 84 [2025-03-04 07:58:11,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:11,160 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 88 treesize of output 92 [2025-03-04 07:58:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:58:11,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:58:11,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2146) .cse0) .cse1) 4))) (forall ((v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2146) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2145) .cse0) .cse1)))))) is different from false [2025-03-04 07:58:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982868878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:12,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:58:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2025-03-04 07:58:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135429130] [2025-03-04 07:58:12,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:58:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:58:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:58:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:58:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3004, Unknown=36, NotChecked=110, Total=3306 [2025-03-04 07:58:12,712 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 49 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 41 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-03-04 07:58:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:58:15,483 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2025-03-04 07:58:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 07:58:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 41 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-03-04 07:58:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:58:15,484 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:58:15,484 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 07:58:15,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=458, Invalid=7700, Unknown=36, NotChecked=178, Total=8372 [2025-03-04 07:58:15,486 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 173 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:58:15,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1675 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:58:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 07:58:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. [2025-03-04 07:58:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.22) internal successors, (122), 114 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 07:58:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2025-03-04 07:58:15,489 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 55 [2025-03-04 07:58:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:58:15,489 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2025-03-04 07:58:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 41 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-03-04 07:58:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2025-03-04 07:58:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 07:58:15,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:58:15,490 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-03-04 07:58:15,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:58:15,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:15,691 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:58:15,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:58:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash 554349617, now seen corresponding path program 1 times [2025-03-04 07:58:15,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:58:15,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446400136] [2025-03-04 07:58:15,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:58:15,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:58:15,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:58:15,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:15,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:58:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:58:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446400136] [2025-03-04 07:58:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446400136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:58:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991228507] [2025-03-04 07:58:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:58:16,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:58:16,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:16,534 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:58:16,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:58:16,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:58:16,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:58:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:58:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:58:16,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-04 07:58:16,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:58:16,826 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-03-04 07:58:17,022 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-03-04 07:58:17,095 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-03-04 07:58:17,180 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:58:17,181 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-03-04 07:58:17,508 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-03-04 07:58:17,512 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-03-04 07:58:17,516 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-03-04 07:58:17,587 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 07:58:17,588 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-03-04 07:58:17,590 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-03-04 07:58:17,594 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-03-04 07:58:17,662 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:58:17,662 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 15 treesize of output 7 [2025-03-04 07:58:17,761 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 11 treesize of output 3 [2025-03-04 07:58:17,766 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-03-04 07:58:17,838 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 8 treesize of output 4 [2025-03-04 07:58:17,842 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-03-04 07:58:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:58:17,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:58:18,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:18,081 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 69 treesize of output 70 [2025-03-04 07:58:18,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:18,091 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 136 treesize of output 139 [2025-03-04 07:58:18,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:18,096 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 116 treesize of output 108 [2025-03-04 07:58:18,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:18,107 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 202 treesize of output 193 [2025-03-04 07:58:18,111 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 43 treesize of output 37 [2025-03-04 07:58:18,114 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 37 treesize of output 31 [2025-03-04 07:58:18,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse5 (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse0 (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse12) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse12 (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305) (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (= (select (select (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_2305))) v_arrayElimCell_97) (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_2305))))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= (select (select .cse14 v_arrayElimCell_101) (+ v_arrayElimCell_102 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse14 v_arrayElimCell_97) (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse3 (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int)) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_97) .cse8))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302) v_arrayElimCell_97) .cse8)))))) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse9))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse0 .cse2) (or .cse3 .cse1) (or (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int) (v_ArrVal_2305 Int)) (= (select (select (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (not .cse5)) (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int)) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2025-03-04 07:58:19,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse0 (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int)) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (or (= (select (select .cse15 v_arrayElimCell_97) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4))))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int)) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302) v_arrayElimCell_97) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset|)) (.cse6 (= |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| .cse14)) (.cse7 (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse10) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (= (select .cse10 (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_97) (+ 4 v_arrayElimCell_99)))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_2305))) v_arrayElimCell_97) (+ 4 v_arrayElimCell_99))))) (or (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305) (+ 4 v_arrayElimCell_99)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse5)))) (and (or .cse0 .cse1) (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int)) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse4)))))) (or .cse5 (forall ((v_ArrVal_2302 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4)))) (or .cse0 .cse6) (or .cse1 .cse7) (or .cse6 .cse7) (or (not .cse5) (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int) (v_ArrVal_2305 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2302))) (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) v_arrayElimCell_101) (+ v_arrayElimCell_102 4))))))))) is different from false [2025-03-04 07:58:19,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse2 (= .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (and (or .cse2 (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_97 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse12 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) v_arrayElimCell_97) (+ 4 v_arrayElimCell_99))))) (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_2305))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_97) (+ 4 v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_101) (+ v_arrayElimCell_102 4))))))) (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (let ((.cse16 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (let ((.cse15 (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| v_ArrVal_2305))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 4 v_arrayElimCell_99))) (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))))))) (or .cse2 (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int) (v_arrayElimCell_99 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse3 v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305) (+ 4 v_arrayElimCell_99))))))) (.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (.cse6 (and (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int) (v_ArrVal_2305 Int)) (let ((.cse11 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_97) .cse4))))) (or (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_97 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse3 v_ArrVal_2302) v_arrayElimCell_97) .cse4))) .cse2))) (.cse1 (= .cse10 .cse3))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_2302 (Array Int Int))) (= (select (select (store |c_#memory_int#2| .cse3 v_ArrVal_2302) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse0 .cse5) (or .cse6 .cse5) (or .cse6 .cse1) (or (forall ((v_ArrVal_2302 (Array Int Int)) (v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int) (v_ArrVal_2305 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse7 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305))) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (not .cse2)) (forall ((v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2305 Int)) (let ((.cse8 (store |c_#memory_int#2| .cse3 v_ArrVal_2302))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_101 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_2305)) v_arrayElimCell_101) (+ v_arrayElimCell_102 4)))) (= (select .cse9 .cse4) |c_ULTIMATE.start_main_~uneq~0#1|))))))))) is different from false [2025-03-04 07:58:22,367 INFO L349 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2025-03-04 07:58:22,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2319 treesize of output 2840 [2025-03-04 07:58:24,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:24,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2268 treesize of output 3262 [2025-03-04 07:58:24,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:24,583 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 2007 treesize of output 1992 [2025-03-04 07:58:24,925 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 1997 treesize of output 1993 [2025-03-04 07:58:25,267 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 2021 treesize of output 2009 [2025-03-04 07:58:25,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:25,673 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 2051 treesize of output 2044 [2025-03-04 07:58:26,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:26,122 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 2091 treesize of output 2076 [2025-03-04 07:58:26,488 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 2095 treesize of output 2083 [2025-03-04 07:58:26,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 2111 treesize of output 2099 [2025-03-04 07:58:27,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:27,302 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 2127 treesize of output 2122 [2025-03-04 07:58:27,671 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 2113 treesize of output 2111 [2025-03-04 07:58:28,041 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 2111 treesize of output 2109 [2025-03-04 07:58:28,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:28,435 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 2137 treesize of output 2132 [2025-03-04 07:58:28,804 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 2137 treesize of output 2133 [2025-03-04 07:58:29,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:29,219 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 2175 treesize of output 2168 [2025-03-04 07:58:29,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:58:29,621 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 2187 treesize of output 2182 [2025-03-04 07:58:30,007 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 2173 treesize of output 2171