./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/dll2c_prepend_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:15:17,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:15:17,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:15:17,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:15:17,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:15:17,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:15:17,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:15:17,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:15:17,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:15:17,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:15:17,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:15:17,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:15:17,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:15:17,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:15:17,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:15:17,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:15:17,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:15:17,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:17,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:15:17,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:15:17,542 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2025-03-17 12:15:17,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:15:17,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:15:17,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:15:17,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:15:17,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:15:17,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2025-03-17 12:15:19,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18695d1a5/7fa0792792e4449d936a2c716c3466c6/FLAG62f74bc8d [2025-03-17 12:15:19,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:15:19,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2025-03-17 12:15:19,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18695d1a5/7fa0792792e4449d936a2c716c3466c6/FLAG62f74bc8d [2025-03-17 12:15:19,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18695d1a5/7fa0792792e4449d936a2c716c3466c6 [2025-03-17 12:15:19,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:15:19,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:15:19,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:19,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:15:19,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:15:19,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2bcd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19, skipping insertion in model container [2025-03-17 12:15:19,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:15:20,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:20,009 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:15:20,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:20,081 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:15:20,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20 WrapperNode [2025-03-17 12:15:20,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:20,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:20,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:15:20,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:15:20,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,124 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 138 [2025-03-17 12:15:20,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:20,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:15:20,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:15:20,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:15:20,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,158 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2025-03-17 12:15:20,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,164 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:15:20,169 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:15:20,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:15:20,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:15:20,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (1/1) ... [2025-03-17 12:15:20,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:20,200 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-17 12:15:20,205 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-17 12:15:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:15:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:15:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:15:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:15:20,224 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:15:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:15:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:15:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:15:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:15:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:15:20,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:15:20,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:15:20,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:15:20,623 INFO L1322 $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-17 12:15:20,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:15:20,672 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-17 12:15:20,672 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:15:20,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:15:20,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:15:20,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:20 BoogieIcfgContainer [2025-03-17 12:15:20,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:15:20,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:15:20,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:15:20,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:15:20,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:15:19" (1/3) ... [2025-03-17 12:15:20,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6e0308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:20, skipping insertion in model container [2025-03-17 12:15:20,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:20" (2/3) ... [2025-03-17 12:15:20,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6e0308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:20, skipping insertion in model container [2025-03-17 12:15:20,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:20" (3/3) ... [2025-03-17 12:15:20,694 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2025-03-17 12:15:20,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:15:20,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_equal.i that has 2 procedures, 132 locations, 1 initial locations, 3 loop locations, and 60 error locations. [2025-03-17 12:15:20,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:15:20,753 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;@6834bfc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:15:20,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-17 12:15:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 127 states have internal predecessors, (138), 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-17 12:15:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:15:20,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:20,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:15:20,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 152435540, now seen corresponding path program 1 times [2025-03-17 12:15:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:20,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444265780] [2025-03-17 12:15:20,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:20,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:15:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:15:20,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:20,991 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-17 12:15:20,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444265780] [2025-03-17 12:15:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444265780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054236653] [2025-03-17 12:15:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:21,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:21,018 INFO L87 Difference]: Start difference. First operand has 132 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 127 states have internal predecessors, (138), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 12:15:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,178 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2025-03-17 12:15:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 12:15:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,184 INFO L225 Difference]: With dead ends: 128 [2025-03-17 12:15:21,184 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:15:21,186 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-17 12:15:21,189 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 201 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:15:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-17 12:15:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 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-17 12:15:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-03-17 12:15:21,223 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 5 [2025-03-17 12:15:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,223 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-03-17 12:15:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 12:15:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-03-17 12:15:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:15:21,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:15:21,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:15:21,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:21,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash 152435541, now seen corresponding path program 1 times [2025-03-17 12:15:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236934] [2025-03-17 12:15:21,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:15:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:15:21,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,349 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-17 12:15:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236934] [2025-03-17 12:15:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086580262] [2025-03-17 12:15:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:21,351 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 12:15:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,446 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2025-03-17 12:15:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:21,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 12:15:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,448 INFO L225 Difference]: With dead ends: 122 [2025-03-17 12:15:21,448 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 12:15:21,448 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-17 12:15:21,449 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 202 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 12:15:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 12:15:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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-17 12:15:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2025-03-17 12:15:21,462 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 5 [2025-03-17 12:15:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2025-03-17 12:15:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 12:15:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2025-03-17 12:15:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:21,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:15:21,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:21,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1164700055, now seen corresponding path program 1 times [2025-03-17 12:15:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064070836] [2025-03-17 12:15:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:21,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:21,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,603 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-17 12:15:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064070836] [2025-03-17 12:15:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064070836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819999140] [2025-03-17 12:15:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:21,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:21,605 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,809 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2025-03-17 12:15:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,811 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:15:21,812 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:15:21,812 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-17 12:15:21,812 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 5 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 376 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:15:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-17 12:15:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 119 states have internal predecessors, (128), 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-17 12:15:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2025-03-17 12:15:21,824 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 13 [2025-03-17 12:15:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2025-03-17 12:15:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2025-03-17 12:15:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:21,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:15:21,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1164700056, now seen corresponding path program 1 times [2025-03-17 12:15:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134886897] [2025-03-17 12:15:21,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:21,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,902 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-17 12:15:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134886897] [2025-03-17 12:15:21,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134886897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631646571] [2025-03-17 12:15:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:21,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:21,903 INFO L87 Difference]: Start difference. First operand 124 states and 134 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-17 12:15:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,913 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2025-03-17 12:15:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:21,914 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-17 12:15:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,915 INFO L225 Difference]: With dead ends: 123 [2025-03-17 12:15:21,915 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 12:15:21,915 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-17 12:15:21,916 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 12:15:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 12:15:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 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-17 12:15:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2025-03-17 12:15:21,935 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 13 [2025-03-17 12:15:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,935 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2025-03-17 12:15:21,935 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-17 12:15:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2025-03-17 12:15:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:15:21,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:15:21,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1495288860, now seen corresponding path program 1 times [2025-03-17 12:15:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592494570] [2025-03-17 12:15:21,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:15:21,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:15:21,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592494570] [2025-03-17 12:15:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592494570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587867981] [2025-03-17 12:15:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:22,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:22,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:22,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:22,069 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 12:15:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:22,237 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2025-03-17 12:15:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2025-03-17 12:15:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:22,239 INFO L225 Difference]: With dead ends: 122 [2025-03-17 12:15:22,239 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 12:15:22,239 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-17 12:15:22,239 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:22,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 372 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 12:15:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 12:15:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 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-17 12:15:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2025-03-17 12:15:22,250 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 23 [2025-03-17 12:15:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2025-03-17 12:15:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 12:15:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2025-03-17 12:15:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:15:22,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:22,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:22,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:15:22,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1495288861, now seen corresponding path program 1 times [2025-03-17 12:15:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575469101] [2025-03-17 12:15:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:15:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:15:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:22,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575469101] [2025-03-17 12:15:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575469101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071464761] [2025-03-17 12:15:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:22,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:22,470 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-17 12:15:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:22,604 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2025-03-17 12:15:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2025-03-17 12:15:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:22,605 INFO L225 Difference]: With dead ends: 121 [2025-03-17 12:15:22,605 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 12:15:22,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:22,606 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 9 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:22,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 442 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 12:15:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 12:15:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 states have internal predecessors, (123), 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-17 12:15:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2025-03-17 12:15:22,616 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 23 [2025-03-17 12:15:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:22,616 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2025-03-17 12:15:22,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-17 12:15:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2025-03-17 12:15:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:15:22,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:22,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:15:22,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1841446887, now seen corresponding path program 1 times [2025-03-17 12:15:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303043778] [2025-03-17 12:15:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:22,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:22,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:22,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:22,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303043778] [2025-03-17 12:15:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303043778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771181921] [2025-03-17 12:15:22,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:22,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:22,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:22,915 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-17 12:15:22,922 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-17 12:15:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:23,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:23,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:23,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:23,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 12:15:23,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:23,079 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-17 12:15:23,162 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:15:23,163 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-17 12:15:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:23,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771181921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:23,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-17 12:15:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438184118] [2025-03-17 12:15:23,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:15:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:23,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:15:23,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:15:23,509 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:15:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:23,920 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2025-03-17 12:15:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-17 12:15:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:23,922 INFO L225 Difference]: With dead ends: 126 [2025-03-17 12:15:23,922 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 12:15:23,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:15:23,924 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:23,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 704 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:15:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 12:15:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 12:15:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-03-17 12:15:23,935 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 25 [2025-03-17 12:15:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:23,935 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-03-17 12:15:23,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:15:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-03-17 12:15:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:15:23,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:23,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:23,949 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-17 12:15:24,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:24,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:24,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1841446886, now seen corresponding path program 1 times [2025-03-17 12:15:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874540880] [2025-03-17 12:15:24,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:24,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:24,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:24,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874540880] [2025-03-17 12:15:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874540880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224110807] [2025-03-17 12:15:24,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:24,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:24,627 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-17 12:15:24,630 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-17 12:15:24,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:24,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:24,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:24,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:24,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:15:24,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:24,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 8 treesize of output 1 [2025-03-17 12:15:24,787 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-17 12:15:24,874 WARN L873 $PredicateComparison]: unable to prove that (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-17 12:15:24,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:24,913 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-17 12:15:24,922 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:24,923 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-17 12:15:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:24,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224110807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:25,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2025-03-17 12:15:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515102243] [2025-03-17 12:15:25,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:25,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:15:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:15:25,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:15:25,083 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-17 12:15:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:25,444 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-03-17 12:15:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:15:25,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-17 12:15:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:25,445 INFO L225 Difference]: With dead ends: 126 [2025-03-17 12:15:25,445 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 12:15:25,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:15:25,446 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:25,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 583 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2025-03-17 12:15:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 12:15:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 12:15:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2025-03-17 12:15:25,453 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 25 [2025-03-17 12:15:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:25,453 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2025-03-17 12:15:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-17 12:15:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2025-03-17 12:15:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:15:25,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:25,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:25,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:25,654 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,SelfDestructingSolverStorable7 [2025-03-17 12:15:25,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -103900568, now seen corresponding path program 1 times [2025-03-17 12:15:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102088976] [2025-03-17 12:15:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:25,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:15:25,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:15:25,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102088976] [2025-03-17 12:15:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102088976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619166614] [2025-03-17 12:15:25,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:25,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:25,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:25,732 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-17 12:15:25,734 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-17 12:15:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:15:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:15:25,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:25,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:15:25,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:25,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619166614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:25,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 12:15:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407483886] [2025-03-17 12:15:25,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:25,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:25,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:25,863 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:25,897 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2025-03-17 12:15:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:25,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-17 12:15:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:25,898 INFO L225 Difference]: With dead ends: 126 [2025-03-17 12:15:25,898 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 12:15:25,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-17 12:15:25,899 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:25,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 580 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 12:15:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 12:15:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2025-03-17 12:15:25,902 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 27 [2025-03-17 12:15:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:25,902 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2025-03-17 12:15:25,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2025-03-17 12:15:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:15:25,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:25,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:25,911 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-17 12:15:26,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:26,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1073144972, now seen corresponding path program 1 times [2025-03-17 12:15:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917190538] [2025-03-17 12:15:26,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:26,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:26,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:26,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:26,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917190538] [2025-03-17 12:15:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917190538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401972702] [2025-03-17 12:15:26,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:26,177 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-17 12:15:26,178 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-17 12:15:26,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:26,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:26,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:26,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:26,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:15:26,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:26,290 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-17 12:15:26,329 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-17 12:15:26,364 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:15:26,365 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-17 12:15:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-17 12:15:26,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401972702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:26,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-03-17 12:15:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59131582] [2025-03-17 12:15:26,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:26,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:26,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:15:26,412 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:26,648 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2025-03-17 12:15:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:15:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-17 12:15:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:26,649 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:15:26,649 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:15:26,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:15:26,650 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 9 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:26,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 577 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2025-03-17 12:15:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:15:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-17 12:15:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 69 states have (on average 1.826086956521739) internal successors, (126), 119 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-03-17 12:15:26,653 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2025-03-17 12:15:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:26,654 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-03-17 12:15:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-03-17 12:15:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:15:26,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:26,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:26,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:26,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:26,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:26,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1073144973, now seen corresponding path program 1 times [2025-03-17 12:15:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706106432] [2025-03-17 12:15:26,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:26,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:26,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:26,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:26,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706106432] [2025-03-17 12:15:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706106432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836525449] [2025-03-17 12:15:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:26,991 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-17 12:15:26,992 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-17 12:15:27,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:27,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:27,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:27,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:15:27,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:27,088 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-17 12:15:27,091 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-17 12:15:27,197 WARN L873 $PredicateComparison]: unable to prove that (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-17 12:15:27,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:27,235 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-17 12:15:27,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:27,241 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-17 12:15:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:27,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836525449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:27,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-03-17 12:15:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366935870] [2025-03-17 12:15:27,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:27,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:15:27,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:27,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:15:27,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:15:27,368 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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-17 12:15:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:27,646 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2025-03-17 12:15:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:15:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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 28 [2025-03-17 12:15:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:27,648 INFO L225 Difference]: With dead ends: 142 [2025-03-17 12:15:27,648 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 12:15:27,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-03-17 12:15:27,649 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 24 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:27,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 764 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2025-03-17 12:15:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 12:15:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2025-03-17 12:15:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.794871794871795) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2025-03-17 12:15:27,653 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 28 [2025-03-17 12:15:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:27,654 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2025-03-17 12:15:27,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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-17 12:15:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2025-03-17 12:15:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:15:27,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:27,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:27,662 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-17 12:15:27,856 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,SelfDestructingSolverStorable10 [2025-03-17 12:15:27,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1092244158, now seen corresponding path program 1 times [2025-03-17 12:15:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166186441] [2025-03-17 12:15:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:27,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:15:27,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:15:27,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:27,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166186441] [2025-03-17 12:15:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166186441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:27,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237813294] [2025-03-17 12:15:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:27,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:27,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:27,932 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-17 12:15:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:28,083 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-03-17 12:15:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 29 [2025-03-17 12:15:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:28,084 INFO L225 Difference]: With dead ends: 134 [2025-03-17 12:15:28,084 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 12:15:28,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:28,084 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 7 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:28,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 12:15:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-17 12:15:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 127 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2025-03-17 12:15:28,087 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 29 [2025-03-17 12:15:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:28,087 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2025-03-17 12:15:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-17 12:15:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2025-03-17 12:15:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:15:28,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:28,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:28,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:15:28,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:28,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1092244157, now seen corresponding path program 1 times [2025-03-17 12:15:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085069019] [2025-03-17 12:15:28,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:15:28,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:15:28,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085069019] [2025-03-17 12:15:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085069019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:28,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238929545] [2025-03-17 12:15:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:28,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:28,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:28,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:28,215 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-17 12:15:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:28,369 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2025-03-17 12:15:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 29 [2025-03-17 12:15:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:28,370 INFO L225 Difference]: With dead ends: 133 [2025-03-17 12:15:28,370 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 12:15:28,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:28,371 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:28,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 449 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 12:15:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 12:15:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 126 states have internal predecessors, (138), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2025-03-17 12:15:28,375 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 29 [2025-03-17 12:15:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2025-03-17 12:15:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-17 12:15:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2025-03-17 12:15:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:15:28,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:28,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:15:28,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1166472078, now seen corresponding path program 1 times [2025-03-17 12:15:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864237792] [2025-03-17 12:15:28,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:28,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:15:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:15:28,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 12:15:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864237792] [2025-03-17 12:15:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864237792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049816883] [2025-03-17 12:15:28,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:28,453 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-17 12:15:28,481 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-17 12:15:28,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:15:28,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:15:28,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:28,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:15:28,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:28,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049816883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:28,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 12:15:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224321763] [2025-03-17 12:15:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:15:28,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:28,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:15:28,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:28,614 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-17 12:15:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:28,625 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2025-03-17 12:15:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:15:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 40 [2025-03-17 12:15:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:28,626 INFO L225 Difference]: With dead ends: 115 [2025-03-17 12:15:28,626 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 12:15:28,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:28,626 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:28,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 12:15:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 12:15:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 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-17 12:15:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2025-03-17 12:15:28,629 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 40 [2025-03-17 12:15:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2025-03-17 12:15:28,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-17 12:15:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2025-03-17 12:15:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:15:28,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:28,629 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:28,636 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-17 12:15:28,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:28,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:28,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2027712442, now seen corresponding path program 1 times [2025-03-17 12:15:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895954992] [2025-03-17 12:15:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:28,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:28,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:28,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895954992] [2025-03-17 12:15:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895954992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015354370] [2025-03-17 12:15:29,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:29,135 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-17 12:15:29,136 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-17 12:15:29,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:29,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:29,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:29,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:29,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 12:15:29,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:29,276 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-17 12:15:29,304 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:15:29,304 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-17 12:15:29,358 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:15:29,358 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 18 treesize of output 17 [2025-03-17 12:15:29,473 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-17 12:15:29,494 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:15:29,494 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-17 12:15:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2025-03-17 12:15:29,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015354370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:29,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2025-03-17 12:15:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298003824] [2025-03-17 12:15:29,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:29,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 12:15:29,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 12:15:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=553, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:15:29,759 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:30,285 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2025-03-17 12:15:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:15:30,286 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-17 12:15:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:30,286 INFO L225 Difference]: With dead ends: 125 [2025-03-17 12:15:30,286 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 12:15:30,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=780, Unknown=1, NotChecked=58, Total=992 [2025-03-17 12:15:30,287 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 189 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:30,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 599 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 860 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2025-03-17 12:15:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 12:15:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2025-03-17 12:15:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.646153846153846) internal successors, (107), 102 states have internal predecessors, (107), 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-17 12:15:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2025-03-17 12:15:30,290 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 41 [2025-03-17 12:15:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:30,290 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2025-03-17 12:15:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2025-03-17 12:15:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:15:30,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:30,291 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:30,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:15:30,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:30,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2027712441, now seen corresponding path program 1 times [2025-03-17 12:15:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545075845] [2025-03-17 12:15:30,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:30,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545075845] [2025-03-17 12:15:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545075845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:30,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378651047] [2025-03-17 12:15:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:15:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:15:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:15:30,787 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-17 12:15:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:30,959 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-03-17 12:15:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 41 [2025-03-17 12:15:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:30,960 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:15:30,960 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:15:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:15:30,960 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:30,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:15:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:15:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.523076923076923) internal successors, (99), 94 states have internal predecessors, (99), 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-17 12:15:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-03-17 12:15:30,962 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 41 [2025-03-17 12:15:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:30,962 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-03-17 12:15:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-17 12:15:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-03-17 12:15:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:30,963 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:15:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:15:30,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1133729022, now seen corresponding path program 1 times [2025-03-17 12:15:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735647809] [2025-03-17 12:15:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:30,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735647809] [2025-03-17 12:15:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735647809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046378359] [2025-03-17 12:15:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:31,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:31,239 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-17 12:15:31,240 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-17 12:15:31,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:31,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:31,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:31,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:31,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 12:15:31,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:31,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-17 12:15:31,617 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-17 12:15:31,650 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 12:15:31,650 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-17 12:15:31,664 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-17 12:15:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:15:31,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046378359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2025-03-17 12:15:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404189792] [2025-03-17 12:15:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:15:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:15:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=204, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:15:31,666 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-17 12:15:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:31,787 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-03-17 12:15:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:15:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 44 [2025-03-17 12:15:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:31,788 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:15:31,788 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:15:31,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:15:31,789 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:31,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 353 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 143 Unchecked, 0.1s Time] [2025-03-17 12:15:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:15:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 12:15:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 93 states have internal predecessors, (98), 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-17 12:15:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-03-17 12:15:31,791 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 44 [2025-03-17 12:15:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:31,791 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-03-17 12:15:31,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-17 12:15:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-03-17 12:15:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:31,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:31,791 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:15:31,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:31,997 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-17 12:15:31,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:31,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1133729023, now seen corresponding path program 1 times [2025-03-17 12:15:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655004936] [2025-03-17 12:15:31,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:32,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:32,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:32,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:32,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655004936] [2025-03-17 12:15:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655004936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77474609] [2025-03-17 12:15:32,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:32,311 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-17 12:15:32,312 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-17 12:15:32,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:32,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:32,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:32,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:32,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 12:15:32,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:32,713 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-17 12:15:32,720 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-17 12:15:32,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:32,877 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 12 treesize of output 14 [2025-03-17 12:15:32,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:32,885 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-17 12:15:33,071 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-17 12:15:33,203 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2025-03-17 12:15:33,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2025-03-17 12:15:33,396 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 76 treesize of output 52 [2025-03-17 12:15:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:33,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77474609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:33,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 27 [2025-03-17 12:15:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116732941] [2025-03-17 12:15:33,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:15:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:33,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:15:33,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2025-03-17 12:15:33,590 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 28 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:15:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:34,463 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-03-17 12:15:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:15:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-03-17 12:15:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:34,464 INFO L225 Difference]: With dead ends: 105 [2025-03-17 12:15:34,464 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 12:15:34,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 12:15:34,465 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 125 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:34,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 921 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:15:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 12:15:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 12:15:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 99 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-17 12:15:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2025-03-17 12:15:34,468 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 44 [2025-03-17 12:15:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:34,468 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2025-03-17 12:15:34,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 3.04) internal successors, (76), 22 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:15:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2025-03-17 12:15:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:34,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:34,469 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:15:34,478 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-17 12:15:34,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:15:34,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1133701218, now seen corresponding path program 1 times [2025-03-17 12:15:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027346665] [2025-03-17 12:15:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:34,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:15:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027346665] [2025-03-17 12:15:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027346665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654241263] [2025-03-17 12:15:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:34,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:34,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:34,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:34,753 INFO L87 Difference]: Start difference. First operand 105 states and 110 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-17 12:15:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:34,855 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-03-17 12:15:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:34,856 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 44 [2025-03-17 12:15:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:34,856 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:15:34,856 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:15:34,856 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-17 12:15:34,857 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:34,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 260 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:15:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:15:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 95 states have internal predecessors, (100), 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-17 12:15:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-03-17 12:15:34,861 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 44 [2025-03-17 12:15:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-03-17 12:15:34,862 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-17 12:15:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-03-17 12:15:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:34,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:34,862 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:15:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:15:34,862 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:34,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1133701219, now seen corresponding path program 1 times [2025-03-17 12:15:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184134820] [2025-03-17 12:15:34,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:34,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184134820] [2025-03-17 12:15:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184134820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912089521] [2025-03-17 12:15:34,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:34,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:34,989 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-17 12:15:34,991 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-17 12:15:35,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:35,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:35,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:15:35,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:35,148 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-17 12:15:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:15:35,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912089521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-17 12:15:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411007671] [2025-03-17 12:15:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:35,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:35,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:35,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:15:35,213 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-17 12:15:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:35,306 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2025-03-17 12:15:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 44 [2025-03-17 12:15:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:35,307 INFO L225 Difference]: With dead ends: 97 [2025-03-17 12:15:35,307 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 12:15:35,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:15:35,307 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 15 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:35,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 284 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 12:15:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 12:15:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 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-17 12:15:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2025-03-17 12:15:35,309 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 44 [2025-03-17 12:15:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:35,309 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2025-03-17 12:15:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-17 12:15:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2025-03-17 12:15:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:15:35,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:35,313 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:35,320 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-17 12:15:35,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:35,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:35,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1255696263, now seen corresponding path program 1 times [2025-03-17 12:15:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770605713] [2025-03-17 12:15:35,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:35,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:15:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:15:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:15:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770605713] [2025-03-17 12:15:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770605713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:15:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298383855] [2025-03-17 12:15:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:35,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:35,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:35,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:15:35,708 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 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-17 12:15:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:35,887 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-03-17 12:15:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:15:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 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-17 12:15:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:35,888 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:15:35,888 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:15:35,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:15:35,889 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:35,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 414 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:15:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-17 12:15:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 91 states have internal predecessors, (97), 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-17 12:15:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2025-03-17 12:15:35,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 49 [2025-03-17 12:15:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:35,892 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2025-03-17 12:15:35,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 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-17 12:15:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2025-03-17 12:15:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:15:35,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:35,893 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:35,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:15:35,894 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:15:35,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1255696262, now seen corresponding path program 1 times [2025-03-17 12:15:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087251240] [2025-03-17 12:15:35,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:35,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:15:35,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:15:35,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087251240] [2025-03-17 12:15:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087251240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920190860] [2025-03-17 12:15:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:36,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:36,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:36,064 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-17 12:15:36,080 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-17 12:15:36,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:15:36,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:15:36,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:36,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:36,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:15:36,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:36,396 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:15:36,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:36,398 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 16 treesize of output 11 [2025-03-17 12:15:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:36,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:36,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:36,442 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 17 treesize of output 17 [2025-03-17 12:15:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:36,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920190860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:36,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:36,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 20 [2025-03-17 12:15:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105164321] [2025-03-17 12:15:36,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:36,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:15:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:36,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:15:36,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:15:36,550 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:15:40,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:15:44,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:15:48,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:15:52,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:15:56,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:00,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:04,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:08,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:08,795 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-03-17 12:16:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:16:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2025-03-17 12:16:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:08,796 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:16:08,796 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:16:08,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:16:08,797 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 66 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:08,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 908 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2025-03-17 12:16:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:16:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:16:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 88 states have internal predecessors, (93), 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-17 12:16:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2025-03-17 12:16:08,800 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 49 [2025-03-17 12:16:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:08,800 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2025-03-17 12:16:08,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:16:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2025-03-17 12:16:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:16:08,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:08,801 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:16:08,811 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-17 12:16:09,001 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-17 12:16:09,002 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2115960075, now seen corresponding path program 1 times [2025-03-17 12:16:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395408098] [2025-03-17 12:16:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:09,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:16:09,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:16:09,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:09,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:16:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395408098] [2025-03-17 12:16:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395408098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:16:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:16:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001245743] [2025-03-17 12:16:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:09,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:16:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:09,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:16:09,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:16:09,123 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:16:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:09,226 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-03-17 12:16:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:16:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 50 [2025-03-17 12:16:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:09,227 INFO L225 Difference]: With dead ends: 93 [2025-03-17 12:16:09,227 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 12:16:09,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:16:09,228 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:09,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 304 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:16:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 12:16:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 12:16:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-03-17 12:16:09,233 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2025-03-17 12:16:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:09,233 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-03-17 12:16:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:16:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-03-17 12:16:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:16:09,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:09,234 INFO L218 NwaCegarLoop]: trace histogram [3, 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-17 12:16:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:16:09,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2115960074, now seen corresponding path program 1 times [2025-03-17 12:16:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964100942] [2025-03-17 12:16:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:09,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:16:09,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:16:09,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:09,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964100942] [2025-03-17 12:16:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964100942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624523491] [2025-03-17 12:16:09,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:09,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:09,902 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-17 12:16:09,903 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-17 12:16:10,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:16:10,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:16:10,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:10,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:10,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:16:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:10,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-17 12:16:10,161 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 28 treesize of output 16 [2025-03-17 12:16:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:16:10,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:16:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624523491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:10,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:16:10,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2025-03-17 12:16:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909045178] [2025-03-17 12:16:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:16:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:10,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:16:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-17 12:16:10,220 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:16:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:10,318 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-17 12:16:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:16:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 50 [2025-03-17 12:16:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:10,319 INFO L225 Difference]: With dead ends: 92 [2025-03-17 12:16:10,319 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 12:16:10,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:16:10,320 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:10,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:16:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 12:16:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 12:16:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3) internal successors, (91), 86 states have internal predecessors, (91), 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-17 12:16:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-03-17 12:16:10,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 50 [2025-03-17 12:16:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-03-17 12:16:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-17 12:16:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-03-17 12:16:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:16:10,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:10,324 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:10,332 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-17 12:16:10,524 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,SelfDestructingSolverStorable23 [2025-03-17 12:16:10,525 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:10,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1170252836, now seen corresponding path program 1 times [2025-03-17 12:16:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706488770] [2025-03-17 12:16:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:10,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:10,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:10,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:10,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706488770] [2025-03-17 12:16:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706488770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501567862] [2025-03-17 12:16:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:11,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:11,801 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-17 12:16:11,802 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-17 12:16:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:12,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:12,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-17 12:16:12,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:12,031 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-17 12:16:12,036 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-17 12:16:12,301 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:16:12,301 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-17 12:16:12,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:16:12,313 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-17 12:16:12,636 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-17 12:16:12,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:16:12,758 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-17 12:16:12,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:16:12,766 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-17 12:16:12,770 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-17 12:16:12,957 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 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|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-03-17 12:16:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:12,986 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-17 12:16:12,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:12,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-03-17 12:16:13,010 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:16:13,011 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-17 12:16:13,015 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 20 treesize of output 15 [2025-03-17 12:16:13,120 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:16:13,120 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-17 12:16:13,173 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-17 12:16:13,174 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 41 treesize of output 17 [2025-03-17 12:16:13,261 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 16 treesize of output 8 [2025-03-17 12:16:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:16:13,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501567862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2025-03-17 12:16:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844892834] [2025-03-17 12:16:13,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 12:16:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:13,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 12:16:13,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2508, Unknown=1, NotChecked=100, Total=2756 [2025-03-17 12:16:13,769 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 40 states have internal predecessors, (89), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:15,680 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-03-17 12:16:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 12:16:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 40 states have internal predecessors, (89), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-03-17 12:16:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:15,681 INFO L225 Difference]: With dead ends: 91 [2025-03-17 12:16:15,681 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 12:16:15,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=287, Invalid=4408, Unknown=1, NotChecked=134, Total=4830 [2025-03-17 12:16:15,683 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 21 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:15,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1438 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1716 Invalid, 0 Unknown, 91 Unchecked, 1.0s Time] [2025-03-17 12:16:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 12:16:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 12:16:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 85 states have internal predecessors, (90), 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-17 12:16:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-03-17 12:16:15,686 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 51 [2025-03-17 12:16:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-03-17 12:16:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 40 states have internal predecessors, (89), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-03-17 12:16:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:16:15,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:15,686 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:15,697 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-17 12:16:15,887 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,SelfDestructingSolverStorable24 [2025-03-17 12:16:15,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:15,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1170252837, now seen corresponding path program 1 times [2025-03-17 12:16:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017310072] [2025-03-17 12:16:15,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:15,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:15,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:15,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017310072] [2025-03-17 12:16:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017310072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437007289] [2025-03-17 12:16:16,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:16,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:16,644 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-17 12:16:16,645 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-17 12:16:16,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:16,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:16,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 12:16:16,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:16,955 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 19 treesize of output 1 [2025-03-17 12:16:17,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2025-03-17 12:16:17,013 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:16:17,013 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 7 [2025-03-17 12:16:17,061 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|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:16:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:17,079 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 28 treesize of output 23 [2025-03-17 12:16:17,102 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-17 12:16:17,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2025-03-17 12:16:17,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 12:16:17,149 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 29 treesize of output 9 [2025-03-17 12:16:17,197 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 9 treesize of output 5 [2025-03-17 12:16:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:16:17,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:17,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437007289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:17,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:17,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2025-03-17 12:16:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522880001] [2025-03-17 12:16:17,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:17,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:16:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:17,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:16:17,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=853, Unknown=1, NotChecked=58, Total=992 [2025-03-17 12:16:17,370 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:16:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:17,989 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-03-17 12:16:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:16:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 51 [2025-03-17 12:16:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:17,994 INFO L225 Difference]: With dead ends: 90 [2025-03-17 12:16:17,994 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 12:16:17,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1424, Unknown=1, NotChecked=76, Total=1640 [2025-03-17 12:16:17,995 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:17,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 982 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 845 Invalid, 0 Unknown, 83 Unchecked, 0.4s Time] [2025-03-17 12:16:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 12:16:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 12:16:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 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-17 12:16:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-03-17 12:16:17,999 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 51 [2025-03-17 12:16:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:17,999 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-03-17 12:16:18,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 12:16:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-03-17 12:16:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 12:16:18,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:18,000 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:18,012 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-17 12:16:18,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:18,201 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 910777908, now seen corresponding path program 1 times [2025-03-17 12:16:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895899237] [2025-03-17 12:16:18,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:18,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:16:18,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:16:18,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:18,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:16:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895899237] [2025-03-17 12:16:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895899237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:18,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:16:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:16:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655350052] [2025-03-17 12:16:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:16:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:18,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:16:18,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:16:18,558 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 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-17 12:16:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:18,733 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2025-03-17 12:16:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:16:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 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 57 [2025-03-17 12:16:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:18,734 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:16:18,734 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:16:18,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:16:18,735 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:18,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 439 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:16:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:16:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-17 12:16:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 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-17 12:16:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-03-17 12:16:18,736 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 57 [2025-03-17 12:16:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:18,737 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-03-17 12:16:18,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 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-17 12:16:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-03-17 12:16:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 12:16:18,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:18,737 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:16:18,737 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 423833508, now seen corresponding path program 1 times [2025-03-17 12:16:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975747849] [2025-03-17 12:16:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:16:18,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:16:18,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:18,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:16:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975747849] [2025-03-17 12:16:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975747849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:16:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-17 12:16:20,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195336210] [2025-03-17 12:16:20,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:20,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:16:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:16:20,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2025-03-17 12:16:20,636 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:16:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:21,272 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-03-17 12:16:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 12:16:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-03-17 12:16:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:21,273 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:16:21,273 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:16:21,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 12:16:21,274 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:21,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1081 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:16:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:16:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-17 12:16:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.25) internal successors, (90), 86 states have internal predecessors, (90), 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-17 12:16:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-03-17 12:16:21,276 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 61 [2025-03-17 12:16:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-03-17 12:16:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:16:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-03-17 12:16:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 12:16:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:21,277 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1] [2025-03-17 12:16:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 12:16:21,277 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -651091433, now seen corresponding path program 1 times [2025-03-17 12:16:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085041221] [2025-03-17 12:16:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:21,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 12:16:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 12:16:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085041221] [2025-03-17 12:16:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085041221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987512997] [2025-03-17 12:16:22,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:22,978 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-17 12:16:22,979 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-17 12:16:23,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 12:16:23,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 12:16:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:23,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-17 12:16:23,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:23,440 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 15 treesize of output 1 [2025-03-17 12:16:23,536 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 13 treesize of output 5 [2025-03-17 12:16:23,541 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:16:23,541 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 7 [2025-03-17 12:16:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:23,756 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 22 treesize of output 17 [2025-03-17 12:16:23,775 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-17 12:16:23,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:16:24,485 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:24,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-03-17 12:16:24,491 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:24,501 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-17 12:16:24,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 30 [2025-03-17 12:16:24,615 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 27 treesize of output 22 [2025-03-17 12:16:24,715 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-03-17 12:16:24,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 44 [2025-03-17 12:16:24,720 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 12 treesize of output 8 [2025-03-17 12:16:24,827 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 19 [2025-03-17 12:16:24,906 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 57 treesize of output 25 [2025-03-17 12:16:25,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:25,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-17 12:16:25,023 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:25,030 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2025-03-17 12:16:25,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 13 [2025-03-17 12:16:25,134 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 13 [2025-03-17 12:16:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:25,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:30,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:30,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:30,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:30,970 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:30,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:30,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:31,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (= (select |c_#valid| (select (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_3373) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-17 12:16:31,012 INFO L349 Elim1Store]: treesize reduction 5, result has 94.4 percent of original size [2025-03-17 12:16:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 93 [2025-03-17 12:16:31,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3374 (Array Int Int)) (v_ArrVal_3375 Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3373) .cse1 v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_3373) .cse1 v_ArrVal_3374) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_3375))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse0)))) is different from false [2025-03-17 12:16:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987512997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:31,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 58 [2025-03-17 12:16:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853593102] [2025-03-17 12:16:31,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:31,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-17 12:16:31,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:31,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-17 12:16:31,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4124, Unknown=50, NotChecked=1096, Total=5550 [2025-03-17 12:16:31,470 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 59 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 53 states have internal predecessors, (99), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:32,675 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-17 12:16:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 12:16:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 53 states have internal predecessors, (99), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2025-03-17 12:16:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:32,676 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:16:32,676 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:16:32,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=353, Invalid=5175, Unknown=54, NotChecked=1224, Total=6806 [2025-03-17 12:16:32,678 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 88 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1290 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:16:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:16:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-17 12:16:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.263157894736842) internal successors, (96), 90 states have internal predecessors, (96), 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-17 12:16:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-03-17 12:16:32,680 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 63 [2025-03-17 12:16:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:32,680 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-03-17 12:16:32,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 53 states have internal predecessors, (99), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-03-17 12:16:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 12:16:32,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:32,681 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1] [2025-03-17 12:16:32,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:16:32,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:16:32,882 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:32,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -651091432, now seen corresponding path program 1 times [2025-03-17 12:16:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982812861] [2025-03-17 12:16:32,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:32,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 12:16:32,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 12:16:32,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:32,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982812861] [2025-03-17 12:16:34,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982812861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761708278] [2025-03-17 12:16:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:34,615 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:16:34,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 12:16:34,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 12:16:34,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:34,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-17 12:16:34,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:34,891 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-17 12:16:35,177 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 15 treesize of output 1 [2025-03-17 12:16:35,291 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 13 treesize of output 5 [2025-03-17 12:16:35,296 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:16:35,297 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 7 [2025-03-17 12:16:35,299 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-17 12:16:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:35,606 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 22 treesize of output 17 [2025-03-17 12:16:35,624 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-17 12:16:35,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:16:35,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-03-17 12:16:36,556 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:36,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-03-17 12:16:36,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:36,581 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-17 12:16:36,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 33 [2025-03-17 12:16:36,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 12:16:36,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:16:36,858 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-03-17 12:16:36,858 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2025-03-17 12:16:36,864 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 24 treesize of output 11 [2025-03-17 12:16:36,871 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-17 12:16:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:16:36,973 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 19 [2025-03-17 12:16:37,083 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 39 treesize of output 15 [2025-03-17 12:16:37,088 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 57 treesize of output 25 [2025-03-17 12:16:37,231 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 48 treesize of output 28 [2025-03-17 12:16:37,495 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 13 [2025-03-17 12:16:37,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:16:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:16:37,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:38,506 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2025-03-17 12:16:38,507 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 2 case distinctions, treesize of input 5374 treesize of output 5064 [2025-03-17 12:16:38,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:38,526 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 1470 treesize of output 1466 [2025-03-17 12:16:38,540 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 1948 treesize of output 1888 [2025-03-17 12:16:38,556 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 2152 treesize of output 2122 [2025-03-17 12:16:38,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2025-03-17 12:16:39,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:39,033 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 271 treesize of output 269 [2025-03-17 12:16:39,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:39,070 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:39,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:39,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:39,074 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 32 treesize of output 33 [2025-03-17 12:16:39,077 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:39,077 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-17 12:16:39,082 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:16:39,084 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:16:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761708278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:41,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 61 [2025-03-17 12:16:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919358635] [2025-03-17 12:16:41,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-17 12:16:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:41,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-17 12:16:41,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=6042, Unknown=13, NotChecked=0, Total=6320 [2025-03-17 12:16:41,461 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 62 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 56 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:45,604 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2025-03-17 12:16:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 12:16:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 56 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2025-03-17 12:16:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:45,607 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:16:45,607 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:16:45,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2579 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=574, Invalid=11623, Unknown=13, NotChecked=0, Total=12210 [2025-03-17 12:16:45,614 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 89 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1840 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 12:16:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:16:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-17 12:16:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 92 states have internal predecessors, (98), 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-17 12:16:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-03-17 12:16:45,626 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 63 [2025-03-17 12:16:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:45,627 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-03-17 12:16:45,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 56 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:16:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-03-17 12:16:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 12:16:45,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:45,628 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2025-03-17 12:16:45,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 12:16:45,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:45,829 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 57 more)] === [2025-03-17 12:16:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -592086208, now seen corresponding path program 1 times [2025-03-17 12:16:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494386807] [2025-03-17 12:16:45,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:45,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 12:16:46,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 12:16:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat