./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.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 5bf92ba2f935aadbe2c0ae3d366f72b4144ff6b8b5ce7c503e628d249b478be5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:38:14,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:38:14,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:38:14,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:38:14,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:38:15,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:38:15,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:38:15,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:38:15,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:38:15,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:38:15,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:38:15,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:38:15,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:38:15,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:38:15,027 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:38:15,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:38:15,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:38:15,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:15,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:15,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:15,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:38:15,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:38:15,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:38:15,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:38:15,031 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 -> 5bf92ba2f935aadbe2c0ae3d366f72b4144ff6b8b5ce7c503e628d249b478be5 [2025-04-30 10:38:15,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:38:15,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:38:15,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:38:15,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:38:15,262 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:38:15,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2025-04-30 10:38:16,668 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077f505f/63959017f3a149c3bdbb2bf71bcddaee/FLAG47e46cf30 [2025-04-30 10:38:16,944 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:38:16,945 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-2.i [2025-04-30 10:38:16,959 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077f505f/63959017f3a149c3bdbb2bf71bcddaee/FLAG47e46cf30 [2025-04-30 10:38:17,670 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2077f505f/63959017f3a149c3bdbb2bf71bcddaee [2025-04-30 10:38:17,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:38:17,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:38:17,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:17,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:38:17,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:38:17,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:17" (1/1) ... [2025-04-30 10:38:17,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8df82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:17, skipping insertion in model container [2025-04-30 10:38:17,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:17" (1/1) ... [2025-04-30 10:38:17,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:38:17,965 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:17,977 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:38:18,030 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:18,047 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:38:18,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18 WrapperNode [2025-04-30 10:38:18,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:18,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:18,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:38:18,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:38:18,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,083 INFO L138 Inliner]: procedures = 129, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2025-04-30 10:38:18,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:18,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:38:18,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:38:18,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:38:18,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,122 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 3, 1]. [2025-04-30 10:38:18,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:38:18,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:38:18,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:38:18,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:38:18,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (1/1) ... [2025-04-30 10:38:18,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:18,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:18,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:38:18,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-30 10:38:18,193 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2025-04-30 10:38:18,193 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:38:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:38:18,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:38:18,282 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:38:18,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:38:18,301 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-30 10:38:18,555 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-04-30 10:38:18,556 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:38:18,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:38:18,564 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-30 10:38:18,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:18 BoogieIcfgContainer [2025-04-30 10:38:18,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:38:18,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:38:18,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:38:18,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:38:18,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:38:17" (1/3) ... [2025-04-30 10:38:18,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5817ce24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:18, skipping insertion in model container [2025-04-30 10:38:18,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:18" (2/3) ... [2025-04-30 10:38:18,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5817ce24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:18, skipping insertion in model container [2025-04-30 10:38:18,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:18" (3/3) ... [2025-04-30 10:38:18,574 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-2.i [2025-04-30 10:38:18,584 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:38:18,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_nondet_insert-2.i that has 3 procedures, 92 locations, 114 edges, 1 initial locations, 6 loop locations, and 25 error locations. [2025-04-30 10:38:18,620 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:38:18,631 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@43e50db5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:38:18,632 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-30 10:38:18,635 INFO L278 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 85 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:38:18,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:38:18,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:18,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:18,640 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:18,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1377377861, now seen corresponding path program 1 times [2025-04-30 10:38:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:18,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805552551] [2025-04-30 10:38:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:18,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:38:18,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:38:18,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:18,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:18,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805552551] [2025-04-30 10:38:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805552551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373982008] [2025-04-30 10:38:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:18,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:38:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:18,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:38:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:38:18,772 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 85 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-04-30 10:38:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:18,790 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2025-04-30 10:38:18,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:38:18,791 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2025-04-30 10:38:18,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:18,795 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:38:18,795 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:38:18,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:38:18,798 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:18,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:38:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-30 10:38:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 79 states have internal predecessors, (87), 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-04-30 10:38:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-04-30 10:38:18,828 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 14 [2025-04-30 10:38:18,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:18,828 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-04-30 10:38:18,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-04-30 10:38:18,829 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-04-30 10:38:18,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:18,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:18,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:18,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:38:18,830 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:18,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2082925470, now seen corresponding path program 1 times [2025-04-30 10:38:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:18,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458581826] [2025-04-30 10:38:18,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:18,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:18,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:18,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:18,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458581826] [2025-04-30 10:38:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458581826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118323786] [2025-04-30 10:38:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:18,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:18,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:18,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:18,969 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:38:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,016 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-04-30 10:38:19,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:19,016 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-04-30 10:38:19,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,017 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:38:19,017 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:38:19,017 INFO L436 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-04-30 10:38:19,018 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:38:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-30 10:38:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 78 states have internal predecessors, (86), 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-04-30 10:38:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2025-04-30 10:38:19,022 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 16 [2025-04-30 10:38:19,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,023 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2025-04-30 10:38:19,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:38:19,024 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2025-04-30 10:38:19,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:19,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:19,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:38:19,024 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:19,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2082925469, now seen corresponding path program 1 times [2025-04-30 10:38:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644360935] [2025-04-30 10:38:19,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:19,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:19,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644360935] [2025-04-30 10:38:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644360935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78484944] [2025-04-30 10:38:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:19,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:19,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:19,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:19,131 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:38:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,182 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-04-30 10:38:19,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:19,182 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-04-30 10:38:19,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,183 INFO L225 Difference]: With dead ends: 82 [2025-04-30 10:38:19,184 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:38:19,184 INFO L436 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-04-30 10:38:19,184 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:38:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-30 10:38:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 77 states have internal predecessors, (85), 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-04-30 10:38:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-04-30 10:38:19,190 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 16 [2025-04-30 10:38:19,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,190 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-04-30 10:38:19,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-04-30 10:38:19,190 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-04-30 10:38:19,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:38:19,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:19,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:38:19,193 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:19,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1076583548, now seen corresponding path program 1 times [2025-04-30 10:38:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089918587] [2025-04-30 10:38:19,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:38:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:38:19,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089918587] [2025-04-30 10:38:19,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089918587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:19,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130953918] [2025-04-30 10:38:19,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:19,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:19,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:38:19,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:38:19,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:38:19,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:38:19,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:19,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130953918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-04-30 10:38:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59289541] [2025-04-30 10:38:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:19,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:19,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:38:19,500 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:19,559 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-04-30 10:38:19,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:19,560 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 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 26 [2025-04-30 10:38:19,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:19,561 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:38:19,561 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:38:19,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:38:19,561 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:19,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:38:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-30 10:38:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 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-04-30 10:38:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-04-30 10:38:19,566 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 26 [2025-04-30 10:38:19,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:19,566 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-04-30 10:38:19,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:19,566 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-04-30 10:38:19,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:38:19,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:19,567 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, 1, 1, 1] [2025-04-30 10:38:19,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:19,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,770 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:19,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 159223920, now seen corresponding path program 1 times [2025-04-30 10:38:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207236911] [2025-04-30 10:38:19,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:19,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207236911] [2025-04-30 10:38:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207236911] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:19,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488217363] [2025-04-30 10:38:19,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:19,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:19,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:38:20,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:38:20,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:38:20,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:20,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:38:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:20,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488217363] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:20,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2025-04-30 10:38:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065756881] [2025-04-30 10:38:20,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:20,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:38:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:20,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:38:20,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:38:20,275 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:20,423 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2025-04-30 10:38:20,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:20,426 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2025-04-30 10:38:20,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:20,427 INFO L225 Difference]: With dead ends: 111 [2025-04-30 10:38:20,427 INFO L226 Difference]: Without dead ends: 111 [2025-04-30 10:38:20,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:38:20,428 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 19 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:20,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 663 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-30 10:38:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2025-04-30 10:38:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 85 states have internal predecessors, (93), 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-04-30 10:38:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-04-30 10:38:20,440 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 32 [2025-04-30 10:38:20,440 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:20,440 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-04-30 10:38:20,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:20,440 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-04-30 10:38:20,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:38:20,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:20,441 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:20,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:38:20,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:20,643 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:20,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1452146020, now seen corresponding path program 2 times [2025-04-30 10:38:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:20,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637941701] [2025-04-30 10:38:20,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:20,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:38:20,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:38:20,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:20,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:38:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:20,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637941701] [2025-04-30 10:38:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637941701] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:20,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86874874] [2025-04-30 10:38:20,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:20,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:20,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:38:20,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:38:20,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:38:20,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:38:20,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:20,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:20,972 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:38:20,972 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:38:20,997 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:38:20,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:38:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:38:21,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86874874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-04-30 10:38:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056196550] [2025-04-30 10:38:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:21,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:38:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:21,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:38:21,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:21,053 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:21,115 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-04-30 10:38:21,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:38:21,115 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 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 38 [2025-04-30 10:38:21,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:21,116 INFO L225 Difference]: With dead ends: 100 [2025-04-30 10:38:21,116 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:38:21,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:21,117 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:21,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 77 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:38:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-04-30 10:38:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 83 states have internal predecessors, (91), 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-04-30 10:38:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2025-04-30 10:38:21,122 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 38 [2025-04-30 10:38:21,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:21,123 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2025-04-30 10:38:21,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:21,123 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2025-04-30 10:38:21,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:38:21,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:21,124 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:21,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:38:21,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:21,325 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:21,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1452146021, now seen corresponding path program 1 times [2025-04-30 10:38:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:21,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137659852] [2025-04-30 10:38:21,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:21,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:38:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:38:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:38:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:21,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137659852] [2025-04-30 10:38:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137659852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:21,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611225846] [2025-04-30 10:38:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:21,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:21,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:21,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:38:21,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:38:21,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:38:21,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:21,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:21,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:38:21,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:21,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:21,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:38:21,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:21,695 INFO L354 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-04-30 10:38:21,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:21,703 INFO L354 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-04-30 10:38:21,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:21,827 INFO L354 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-04-30 10:38:21,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:21,845 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:38:21,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:38:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:21,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611225846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:27,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-04-30 10:38:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514556933] [2025-04-30 10:38:27,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:27,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:38:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:27,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:38:27,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=85, Unknown=2, NotChecked=0, Total=132 [2025-04-30 10:38:27,225 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:38:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:27,405 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2025-04-30 10:38:27,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:27,406 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2025-04-30 10:38:27,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:27,406 INFO L225 Difference]: With dead ends: 86 [2025-04-30 10:38:27,406 INFO L226 Difference]: Without dead ends: 86 [2025-04-30 10:38:27,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=81, Invalid=127, Unknown=2, NotChecked=0, Total=210 [2025-04-30 10:38:27,407 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 207 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:27,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 217 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-30 10:38:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-30 10:38:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 81 states have internal predecessors, (89), 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-04-30 10:38:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2025-04-30 10:38:27,411 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 38 [2025-04-30 10:38:27,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:27,411 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2025-04-30 10:38:27,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:38:27,411 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2025-04-30 10:38:27,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:38:27,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:27,413 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:27,420 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-04-30 10:38:27,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:27,614 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:27,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1971566007, now seen corresponding path program 1 times [2025-04-30 10:38:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:27,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227121639] [2025-04-30 10:38:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:38:27,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:38:27,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:27,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:38:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:27,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227121639] [2025-04-30 10:38:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227121639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:27,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:27,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:38:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551787651] [2025-04-30 10:38:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:27,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:27,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:27,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:27,737 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:27,893 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2025-04-30 10:38:27,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:27,894 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-04-30 10:38:27,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:27,895 INFO L225 Difference]: With dead ends: 129 [2025-04-30 10:38:27,895 INFO L226 Difference]: Without dead ends: 129 [2025-04-30 10:38:27,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:27,895 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:27,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 368 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-30 10:38:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2025-04-30 10:38:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.475609756097561) internal successors, (121), 100 states have internal predecessors, (121), 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-04-30 10:38:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2025-04-30 10:38:27,899 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 41 [2025-04-30 10:38:27,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:27,900 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2025-04-30 10:38:27,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:27,900 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2025-04-30 10:38:27,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:38:27,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:27,900 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:27,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:38:27,904 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:27,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1971566008, now seen corresponding path program 1 times [2025-04-30 10:38:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:27,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25814574] [2025-04-30 10:38:27,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:27,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:38:27,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:38:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:27,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:38:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:28,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25814574] [2025-04-30 10:38:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25814574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:28,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:38:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593911590] [2025-04-30 10:38:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:28,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:28,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:28,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:28,079 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:28,258 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2025-04-30 10:38:28,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:28,258 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-04-30 10:38:28,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:28,259 INFO L225 Difference]: With dead ends: 129 [2025-04-30 10:38:28,259 INFO L226 Difference]: Without dead ends: 129 [2025-04-30 10:38:28,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:28,260 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:28,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 400 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-30 10:38:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2025-04-30 10:38:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 100 states have internal predecessors, (120), 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-04-30 10:38:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2025-04-30 10:38:28,264 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 41 [2025-04-30 10:38:28,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:28,264 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2025-04-30 10:38:28,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:28,264 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2025-04-30 10:38:28,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:38:28,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:28,265 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:28,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:38:28,265 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:28,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1245238924, now seen corresponding path program 1 times [2025-04-30 10:38:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:28,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871045877] [2025-04-30 10:38:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:28,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:38:28,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:38:28,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:28,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:28,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871045877] [2025-04-30 10:38:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871045877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:28,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178663669] [2025-04-30 10:38:28,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:28,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:28,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:28,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:38:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:38:28,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:38:28,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:28,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:28,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:38:28,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:28,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:28,608 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:38:28,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:38:28,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:28,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-04-30 10:38:28,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:38:28,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:38:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:28,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178663669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:29,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2025-04-30 10:38:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784435415] [2025-04-30 10:38:29,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:29,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:38:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:38:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:38:29,161 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 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-04-30 10:38:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:29,822 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2025-04-30 10:38:29,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:29,823 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 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) Word has length 44 [2025-04-30 10:38:29,823 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:29,824 INFO L225 Difference]: With dead ends: 168 [2025-04-30 10:38:29,824 INFO L226 Difference]: Without dead ends: 168 [2025-04-30 10:38:29,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:38:29,825 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:29,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1214 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:38:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-30 10:38:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2025-04-30 10:38:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 116 states have internal predecessors, (141), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:38:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2025-04-30 10:38:29,833 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 44 [2025-04-30 10:38:29,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:29,833 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2025-04-30 10:38:29,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 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-04-30 10:38:29,834 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2025-04-30 10:38:29,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:38:29,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:29,834 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:29,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:38:30,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:38:30,035 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:30,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1245238925, now seen corresponding path program 1 times [2025-04-30 10:38:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:30,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397548642] [2025-04-30 10:38:30,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:30,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:38:30,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:38:30,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:30,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:30,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397548642] [2025-04-30 10:38:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397548642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:30,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2552880] [2025-04-30 10:38:30,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:30,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:30,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:30,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:38:30,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:38:30,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:38:30,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:30,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:30,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:38:30,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:30,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:30,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:38:30,507 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:30,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:38:30,513 INFO L354 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-04-30 10:38:30,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:30,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:30,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-04-30 10:38:30,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:38:30,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:38:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:30,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:31,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2025-04-30 10:38:31,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-04-30 10:38:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2552880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:31,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 32 [2025-04-30 10:38:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131090858] [2025-04-30 10:38:31,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:31,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:38:31,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:31,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:38:31,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:38:31,385 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:38:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:32,100 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2025-04-30 10:38:32,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:32,101 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2025-04-30 10:38:32,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:32,101 INFO L225 Difference]: With dead ends: 170 [2025-04-30 10:38:32,102 INFO L226 Difference]: Without dead ends: 170 [2025-04-30 10:38:32,102 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:38:32,103 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 141 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:32,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1484 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:38:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-30 10:38:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 121. [2025-04-30 10:38:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 114 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:38:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2025-04-30 10:38:32,110 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 44 [2025-04-30 10:38:32,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:32,111 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2025-04-30 10:38:32,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:38:32,111 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2025-04-30 10:38:32,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:38:32,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:32,111 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:32,117 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-04-30 10:38:32,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:32,312 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:32,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 126186034, now seen corresponding path program 1 times [2025-04-30 10:38:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:32,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581453602] [2025-04-30 10:38:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:32,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:38:32,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:38:32,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:32,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:38:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:32,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581453602] [2025-04-30 10:38:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581453602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:32,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:38:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142807807] [2025-04-30 10:38:32,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:32,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:32,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:32,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:32,378 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:32,451 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2025-04-30 10:38:32,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:32,451 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-04-30 10:38:32,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:32,452 INFO L225 Difference]: With dead ends: 146 [2025-04-30 10:38:32,452 INFO L226 Difference]: Without dead ends: 146 [2025-04-30 10:38:32,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:32,452 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:32,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 518 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-30 10:38:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2025-04-30 10:38:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 115 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:38:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2025-04-30 10:38:32,458 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 45 [2025-04-30 10:38:32,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:32,458 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2025-04-30 10:38:32,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:32,458 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2025-04-30 10:38:32,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:38:32,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:32,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:32,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:38:32,459 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:32,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1280346519, now seen corresponding path program 2 times [2025-04-30 10:38:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:32,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249642495] [2025-04-30 10:38:32,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:32,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:38:32,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:38:32,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:32,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:32,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249642495] [2025-04-30 10:38:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249642495] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:32,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12461733] [2025-04-30 10:38:32,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:32,935 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-04-30 10:38:32,935 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-04-30 10:38:32,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:38:33,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:38:33,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:33,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:33,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-30 10:38:33,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:33,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:33,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:33,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:33,134 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:33,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:38:33,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:38:33,177 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:38:33,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-04-30 10:38:33,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:38:33,738 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:33,743 INFO L325 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-04-30 10:38:33,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-04-30 10:38:33,753 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:38:33,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-30 10:38:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:33,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12461733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:34,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:34,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2025-04-30 10:38:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999335211] [2025-04-30 10:38:34,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:34,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:38:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:34,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:38:34,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:38:34,345 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 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-04-30 10:38:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:35,294 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2025-04-30 10:38:35,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:38:35,295 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 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) Word has length 47 [2025-04-30 10:38:35,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:35,296 INFO L225 Difference]: With dead ends: 193 [2025-04-30 10:38:35,296 INFO L226 Difference]: Without dead ends: 193 [2025-04-30 10:38:35,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=1911, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:38:35,297 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 130 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:35,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2049 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:38:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-30 10:38:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2025-04-30 10:38:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 142 states have internal predecessors, (168), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:38:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2025-04-30 10:38:35,301 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 47 [2025-04-30 10:38:35,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:35,301 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2025-04-30 10:38:35,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 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-04-30 10:38:35,302 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2025-04-30 10:38:35,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:38:35,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:35,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:35,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:35,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:35,505 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:35,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash 129610300, now seen corresponding path program 1 times [2025-04-30 10:38:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:35,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72854623] [2025-04-30 10:38:35,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:35,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:38:35,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:38:35,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:35,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:38:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:35,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72854623] [2025-04-30 10:38:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72854623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:35,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952633566] [2025-04-30 10:38:35,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:35,605 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-04-30 10:38:35,607 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-04-30 10:38:35,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:38:35,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:38:35,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:35,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:35,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:38:35,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:35,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952633566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-04-30 10:38:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649707953] [2025-04-30 10:38:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:35,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:35,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:35,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:38:35,729 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-04-30 10:38:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:35,762 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2025-04-30 10:38:35,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:35,762 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 49 [2025-04-30 10:38:35,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:35,763 INFO L225 Difference]: With dead ends: 176 [2025-04-30 10:38:35,763 INFO L226 Difference]: Without dead ends: 176 [2025-04-30 10:38:35,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:38:35,764 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:35,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 382 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-30 10:38:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2025-04-30 10:38:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 156 states have internal predecessors, (186), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-04-30 10:38:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-04-30 10:38:35,772 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 49 [2025-04-30 10:38:35,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:35,772 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-04-30 10:38:35,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-04-30 10:38:35,773 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-04-30 10:38:35,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:38:35,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:35,773 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:35,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:38:35,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:38:35,974 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:35,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1214521479, now seen corresponding path program 1 times [2025-04-30 10:38:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:35,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037400548] [2025-04-30 10:38:35,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:35,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:38:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:38:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:36,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:36,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037400548] [2025-04-30 10:38:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037400548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:36,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760298629] [2025-04-30 10:38:36,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:36,146 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-04-30 10:38:36,149 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-04-30 10:38:36,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:38:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:38:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:36,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:38:36,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:36,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:38:36,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:38:36,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-30 10:38:36,478 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:36,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:38:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:36,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760298629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:36,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2025-04-30 10:38:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782053965] [2025-04-30 10:38:36,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:36,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:38:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:36,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:38:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:38:36,621 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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-04-30 10:38:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:37,057 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2025-04-30 10:38:37,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:37,057 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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) Word has length 48 [2025-04-30 10:38:37,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:37,058 INFO L225 Difference]: With dead ends: 212 [2025-04-30 10:38:37,058 INFO L226 Difference]: Without dead ends: 212 [2025-04-30 10:38:37,059 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:38:37,059 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 136 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:37,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1298 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:38:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-30 10:38:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2025-04-30 10:38:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 155 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-04-30 10:38:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 201 transitions. [2025-04-30 10:38:37,064 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 201 transitions. Word has length 48 [2025-04-30 10:38:37,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:37,065 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 201 transitions. [2025-04-30 10:38:37,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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-04-30 10:38:37,065 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 201 transitions. [2025-04-30 10:38:37,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:38:37,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:37,065 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:37,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:38:37,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:38:37,266 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:37,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1107645970, now seen corresponding path program 2 times [2025-04-30 10:38:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:37,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825964259] [2025-04-30 10:38:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:37,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-30 10:38:37,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:38:37,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:38:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:37,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825964259] [2025-04-30 10:38:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825964259] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:37,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128821040] [2025-04-30 10:38:37,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:37,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:37,489 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-04-30 10:38:37,490 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-04-30 10:38:37,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-30 10:38:37,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:38:37,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:37,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:38:37,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:37,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128821040] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:37,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 33 [2025-04-30 10:38:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313325325] [2025-04-30 10:38:37,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:37,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:38:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:37,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:38:37,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:38:37,971 INFO L87 Difference]: Start difference. First operand 166 states and 201 transitions. Second operand has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 29 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:38,224 INFO L93 Difference]: Finished difference Result 332 states and 412 transitions. [2025-04-30 10:38:38,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:38:38,225 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 29 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-04-30 10:38:38,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:38,226 INFO L225 Difference]: With dead ends: 332 [2025-04-30 10:38:38,226 INFO L226 Difference]: Without dead ends: 332 [2025-04-30 10:38:38,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:38:38,227 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 157 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:38,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1568 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-30 10:38:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 227. [2025-04-30 10:38:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.2849740932642486) internal successors, (248), 211 states have internal predecessors, (248), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2025-04-30 10:38:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-04-30 10:38:38,240 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 51 [2025-04-30 10:38:38,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:38,240 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-04-30 10:38:38,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.303030303030303) internal successors, (76), 29 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:38,241 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-04-30 10:38:38,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:38:38,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:38,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:38,247 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-04-30 10:38:38,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:38:38,442 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:38,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 264467043, now seen corresponding path program 1 times [2025-04-30 10:38:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:38,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123327385] [2025-04-30 10:38:38,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:38,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:38,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:38,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:38,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:38:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:38,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123327385] [2025-04-30 10:38:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123327385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:38,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828500649] [2025-04-30 10:38:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:38,599 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-04-30 10:38:38,600 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-04-30 10:38:38,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:38,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:38,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:38,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:38,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:38:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:38,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:38:39,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828500649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:39,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-30 10:38:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420298056] [2025-04-30 10:38:39,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:39,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:38:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:39,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:38:39,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:38:39,053 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 22 states have internal predecessors, (88), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-30 10:38:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:39,241 INFO L93 Difference]: Finished difference Result 319 states and 408 transitions. [2025-04-30 10:38:39,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:38:39,243 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 22 states have internal predecessors, (88), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2025-04-30 10:38:39,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:39,244 INFO L225 Difference]: With dead ends: 319 [2025-04-30 10:38:39,244 INFO L226 Difference]: Without dead ends: 319 [2025-04-30 10:38:39,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:38:39,245 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:39,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 981 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-30 10:38:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 254. [2025-04-30 10:38:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 217 states have (on average 1.2995391705069124) internal successors, (282), 237 states have internal predecessors, (282), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (22), 12 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:38:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 313 transitions. [2025-04-30 10:38:39,252 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 313 transitions. Word has length 53 [2025-04-30 10:38:39,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:39,252 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 313 transitions. [2025-04-30 10:38:39,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 22 states have internal predecessors, (88), 4 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-04-30 10:38:39,252 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 313 transitions. [2025-04-30 10:38:39,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:38:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:39,252 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:39,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:38:39,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:38:39,457 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:39,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1424476699, now seen corresponding path program 1 times [2025-04-30 10:38:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:39,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011545624] [2025-04-30 10:38:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:39,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:39,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-30 10:38:39,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:39,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011545624] [2025-04-30 10:38:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011545624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:39,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844040950] [2025-04-30 10:38:39,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:39,582 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-04-30 10:38:39,583 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-04-30 10:38:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:39,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:39,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:39,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:39,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:38:39,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:39,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:39,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:39,687 INFO L354 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-04-30 10:38:39,700 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:38:39,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:38:39,771 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:38:39,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:38:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:38:39,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-30 10:38:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844040950] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:39,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:39,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-04-30 10:38:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455036392] [2025-04-30 10:38:39,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:39,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:38:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:39,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:38:39,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:39,857 INFO L87 Difference]: Start difference. First operand 254 states and 313 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:39,921 INFO L93 Difference]: Finished difference Result 265 states and 324 transitions. [2025-04-30 10:38:39,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:39,922 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2025-04-30 10:38:39,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:39,922 INFO L225 Difference]: With dead ends: 265 [2025-04-30 10:38:39,923 INFO L226 Difference]: Without dead ends: 265 [2025-04-30 10:38:39,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:38:39,924 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:39,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 159 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-30 10:38:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 252. [2025-04-30 10:38:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 235 states have internal predecessors, (279), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (22), 12 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:38:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2025-04-30 10:38:39,932 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 53 [2025-04-30 10:38:39,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:39,932 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2025-04-30 10:38:39,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:39,932 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2025-04-30 10:38:39,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:38:39,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:39,933 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:39,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:38:40,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:38:40,134 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:40,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1424476698, now seen corresponding path program 1 times [2025-04-30 10:38:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:40,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811147734] [2025-04-30 10:38:40,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:40,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:40,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-30 10:38:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:40,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811147734] [2025-04-30 10:38:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811147734] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:40,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488361746] [2025-04-30 10:38:40,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:40,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:40,298 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-04-30 10:38:40,299 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-04-30 10:38:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:40,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:40,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:38:40,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:40,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:38:40,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:40,414 INFO L354 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-04-30 10:38:40,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:40,440 INFO L354 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-04-30 10:38:40,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:40,590 INFO L354 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-04-30 10:38:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-30 10:38:40,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488361746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:38:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094348637] [2025-04-30 10:38:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:40,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:38:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:40,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:38:40,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:40,606 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-04-30 10:38:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:40,656 INFO L93 Difference]: Finished difference Result 258 states and 316 transitions. [2025-04-30 10:38:40,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:38:40,657 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 53 [2025-04-30 10:38:40,657 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:40,658 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:38:40,658 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:38:40,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:38:40,658 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:40,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 164 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:38:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 247. [2025-04-30 10:38:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 214 states have (on average 1.266355140186916) internal successors, (271), 230 states have internal predecessors, (271), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-04-30 10:38:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2025-04-30 10:38:40,663 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 53 [2025-04-30 10:38:40,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:40,663 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2025-04-30 10:38:40,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-04-30 10:38:40,663 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2025-04-30 10:38:40,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:38:40,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:40,664 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:40,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:40,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:40,865 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:40,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash -21576009, now seen corresponding path program 1 times [2025-04-30 10:38:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:40,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209398296] [2025-04-30 10:38:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:40,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:38:40,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:38:40,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:38:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:40,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209398296] [2025-04-30 10:38:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209398296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:38:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376007901] [2025-04-30 10:38:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:40,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:40,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:40,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:40,939 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:41,087 INFO L93 Difference]: Finished difference Result 268 states and 318 transitions. [2025-04-30 10:38:41,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:41,087 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-04-30 10:38:41,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:41,088 INFO L225 Difference]: With dead ends: 268 [2025-04-30 10:38:41,088 INFO L226 Difference]: Without dead ends: 268 [2025-04-30 10:38:41,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:41,089 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:41,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 334 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-04-30 10:38:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2025-04-30 10:38:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 238 states have internal predecessors, (285), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-04-30 10:38:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 314 transitions. [2025-04-30 10:38:41,097 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 314 transitions. Word has length 52 [2025-04-30 10:38:41,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:41,097 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 314 transitions. [2025-04-30 10:38:41,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,097 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 314 transitions. [2025-04-30 10:38:41,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:38:41,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:41,099 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:41,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:38:41,099 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:41,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash -21576008, now seen corresponding path program 1 times [2025-04-30 10:38:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:41,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679489034] [2025-04-30 10:38:41,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:41,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:38:41,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:38:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:41,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:41,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679489034] [2025-04-30 10:38:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679489034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:41,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:38:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174673374] [2025-04-30 10:38:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:41,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:41,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:41,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:41,224 INFO L87 Difference]: Start difference. First operand 255 states and 314 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:41,335 INFO L93 Difference]: Finished difference Result 270 states and 319 transitions. [2025-04-30 10:38:41,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:41,335 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-04-30 10:38:41,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:41,336 INFO L225 Difference]: With dead ends: 270 [2025-04-30 10:38:41,336 INFO L226 Difference]: Without dead ends: 270 [2025-04-30 10:38:41,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:41,336 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:41,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 366 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-30 10:38:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2025-04-30 10:38:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 225 states have (on average 1.271111111111111) internal successors, (286), 240 states have internal predecessors, (286), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 12 states have call predecessors, (20), 9 states have call successors, (20) [2025-04-30 10:38:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 315 transitions. [2025-04-30 10:38:41,341 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 315 transitions. Word has length 52 [2025-04-30 10:38:41,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:41,341 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 315 transitions. [2025-04-30 10:38:41,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,342 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 315 transitions. [2025-04-30 10:38:41,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:38:41,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:41,342 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:41,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:38:41,342 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:41,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -975038941, now seen corresponding path program 3 times [2025-04-30 10:38:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:41,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581985138] [2025-04-30 10:38:41,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:41,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 5 equivalence classes. [2025-04-30 10:38:41,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:41,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:38:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:38:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:41,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581985138] [2025-04-30 10:38:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581985138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:41,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497522155] [2025-04-30 10:38:41,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:38:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:41,523 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-04-30 10:38:41,524 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-04-30 10:38:41,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 5 equivalence classes. [2025-04-30 10:38:41,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:41,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:38:41,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:41,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:38:41,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:38:41,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:38:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497522155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:41,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:41,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-04-30 10:38:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985399142] [2025-04-30 10:38:41,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:41,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:38:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:41,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:38:41,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:38:41,804 INFO L87 Difference]: Start difference. First operand 257 states and 315 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:41,872 INFO L93 Difference]: Finished difference Result 245 states and 300 transitions. [2025-04-30 10:38:41,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:41,872 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2025-04-30 10:38:41,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:41,873 INFO L225 Difference]: With dead ends: 245 [2025-04-30 10:38:41,873 INFO L226 Difference]: Without dead ends: 245 [2025-04-30 10:38:41,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:38:41,874 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:41,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 605 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-30 10:38:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2025-04-30 10:38:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 212 states have internal predecessors, (251), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:38:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-04-30 10:38:41,879 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 53 [2025-04-30 10:38:41,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:41,879 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-04-30 10:38:41,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:41,879 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-04-30 10:38:41,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:38:41,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:41,880 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:41,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:42,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:42,080 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:42,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -668844203, now seen corresponding path program 1 times [2025-04-30 10:38:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:42,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196129351] [2025-04-30 10:38:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:42,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:42,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:42,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:42,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:38:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:42,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196129351] [2025-04-30 10:38:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196129351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:42,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740132864] [2025-04-30 10:38:42,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:42,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:42,199 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-04-30 10:38:42,200 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-04-30 10:38:42,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:38:42,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:38:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:42,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:42,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:38:42,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:42,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:38:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:38:42,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:38:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740132864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:42,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:38:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 16 [2025-04-30 10:38:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173725462] [2025-04-30 10:38:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:42,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:38:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:42,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:38:42,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:42,438 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:46,449 WARN L532 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-04-30 10:38:50,472 WARN L532 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-04-30 10:38:54,569 WARN L532 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-04-30 10:38:58,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:38:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:58,596 INFO L93 Difference]: Finished difference Result 263 states and 303 transitions. [2025-04-30 10:38:58,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:38:58,600 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 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 53 [2025-04-30 10:38:58,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:58,601 INFO L225 Difference]: With dead ends: 263 [2025-04-30 10:38:58,601 INFO L226 Difference]: Without dead ends: 263 [2025-04-30 10:38:58,601 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:38:58,601 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 92 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:58,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 573 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-30 10:38:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-30 10:38:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 235. [2025-04-30 10:38:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 219 states have internal predecessors, (259), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-04-30 10:38:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2025-04-30 10:38:58,609 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 53 [2025-04-30 10:38:58,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:58,609 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2025-04-30 10:38:58,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:58,610 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2025-04-30 10:38:58,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:38:58,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:58,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:58,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:58,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:58,811 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:58,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:58,811 INFO L85 PathProgramCache]: Analyzing trace with hash 939523339, now seen corresponding path program 1 times [2025-04-30 10:38:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:58,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933198405] [2025-04-30 10:38:58,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:38:58,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:38:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:58,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933198405] [2025-04-30 10:38:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933198405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:58,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645440450] [2025-04-30 10:38:58,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:58,920 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-04-30 10:38:58,921 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-04-30 10:38:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:38:59,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:38:59,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:38:59,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:59,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:38:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645440450] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:59,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-04-30 10:38:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582869659] [2025-04-30 10:38:59,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:38:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:38:59,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:38:59,217 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,354 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2025-04-30 10:38:59,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:59,354 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-04-30 10:38:59,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,355 INFO L225 Difference]: With dead ends: 236 [2025-04-30 10:38:59,355 INFO L226 Difference]: Without dead ends: 236 [2025-04-30 10:38:59,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:38:59,356 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 38 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 734 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-30 10:38:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2025-04-30 10:38:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 205 states have internal predecessors, (242), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:38:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 262 transitions. [2025-04-30 10:38:59,360 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 262 transitions. Word has length 55 [2025-04-30 10:38:59,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,360 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 262 transitions. [2025-04-30 10:38:59,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-30 10:38:59,361 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 262 transitions. [2025-04-30 10:38:59,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:38:59,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,361 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04-30 10:38:59,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:59,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:38:59,566 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:59,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1474328512, now seen corresponding path program 1 times [2025-04-30 10:38:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766424784] [2025-04-30 10:38:59,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:38:59,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:38:59,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:59,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:59,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766424784] [2025-04-30 10:38:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766424784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:38:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471510252] [2025-04-30 10:38:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:38:59,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:38:59,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:59,643 INFO L87 Difference]: Start difference. First operand 219 states and 262 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,741 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2025-04-30 10:38:59,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:59,741 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-04-30 10:38:59,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,742 INFO L225 Difference]: With dead ends: 233 [2025-04-30 10:38:59,742 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:38:59,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:59,743 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 33 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 424 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:38:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 220. [2025-04-30 10:38:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 206 states have internal predecessors, (243), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:38:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2025-04-30 10:38:59,747 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 55 [2025-04-30 10:38:59,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,747 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2025-04-30 10:38:59,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:59,747 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2025-04-30 10:38:59,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:38:59,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,748 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 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-04-30 10:38:59,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:38:59,748 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:59,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1453869075, now seen corresponding path program 1 times [2025-04-30 10:38:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350844117] [2025-04-30 10:38:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:38:59,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:38:59,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:38:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:59,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350844117] [2025-04-30 10:38:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350844117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:59,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561339171] [2025-04-30 10:38:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:59,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:59,797 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-04-30 10:38:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,820 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2025-04-30 10:38:59,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:59,821 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 57 [2025-04-30 10:38:59,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,821 INFO L225 Difference]: With dead ends: 219 [2025-04-30 10:38:59,821 INFO L226 Difference]: Without dead ends: 219 [2025-04-30 10:38:59,822 INFO L436 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-04-30 10:38:59,822 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-30 10:38:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-04-30 10:38:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 1.268421052631579) internal successors, (241), 205 states have internal predecessors, (241), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:38:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 261 transitions. [2025-04-30 10:38:59,830 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 261 transitions. Word has length 57 [2025-04-30 10:38:59,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,830 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 261 transitions. [2025-04-30 10:38:59,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-04-30 10:38:59,830 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2025-04-30 10:38:59,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:38:59,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,830 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 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-04-30 10:38:59,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:38:59,830 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:59,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1453869076, now seen corresponding path program 1 times [2025-04-30 10:38:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354361770] [2025-04-30 10:38:59,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:38:59,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:38:59,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:59,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:38:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:59,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354361770] [2025-04-30 10:38:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354361770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104011336] [2025-04-30 10:38:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:59,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:59,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:59,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:59,876 INFO L87 Difference]: Start difference. First operand 219 states and 261 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-04-30 10:38:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:59,896 INFO L93 Difference]: Finished difference Result 218 states and 259 transitions. [2025-04-30 10:38:59,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:59,896 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 57 [2025-04-30 10:38:59,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:59,898 INFO L225 Difference]: With dead ends: 218 [2025-04-30 10:38:59,898 INFO L226 Difference]: Without dead ends: 218 [2025-04-30 10:38:59,899 INFO L436 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-04-30 10:38:59,899 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:59,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-30 10:38:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-04-30 10:38:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 204 states have internal predecessors, (239), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:38:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2025-04-30 10:38:59,903 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 57 [2025-04-30 10:38:59,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:59,903 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2025-04-30 10:38:59,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-04-30 10:38:59,903 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2025-04-30 10:38:59,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:38:59,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:59,904 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:59,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:38:59,904 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:38:59,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 667869916, now seen corresponding path program 1 times [2025-04-30 10:38:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:59,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739224660] [2025-04-30 10:38:59,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:59,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:38:59,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:38:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:39:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:00,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739224660] [2025-04-30 10:39:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739224660] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:00,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602563357] [2025-04-30 10:39:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:00,218 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:00,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:39:00,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:00,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:00,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:00,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:00,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:39:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:00,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:00,362 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:39:00,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:39:00,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:00,463 INFO L325 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-04-30 10:39:00,464 INFO L354 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 28 treesize of output 36 [2025-04-30 10:39:00,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-04-30 10:39:00,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:00,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2025-04-30 10:39:00,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:39:01,009 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:01,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2025-04-30 10:39:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:01,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602563357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:01,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2025-04-30 10:39:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844520263] [2025-04-30 10:39:01,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:01,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:39:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:01,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:39:01,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1237, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:39:01,429 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 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-04-30 10:39:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:02,479 INFO L93 Difference]: Finished difference Result 258 states and 303 transitions. [2025-04-30 10:39:02,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:39:02,480 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 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) Word has length 57 [2025-04-30 10:39:02,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:02,480 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:39:02,480 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:39:02,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=2235, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:39:02,481 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 92 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:02,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2036 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:39:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:39:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 223. [2025-04-30 10:39:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 195 states have (on average 1.2615384615384615) internal successors, (246), 209 states have internal predecessors, (246), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:39:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2025-04-30 10:39:02,487 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 57 [2025-04-30 10:39:02,487 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:02,487 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2025-04-30 10:39:02,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 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-04-30 10:39:02,487 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2025-04-30 10:39:02,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:39:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:02,488 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:02,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:39:02,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:39:02,689 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:02,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 667869917, now seen corresponding path program 1 times [2025-04-30 10:39:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:02,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039505862] [2025-04-30 10:39:02,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:02,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:39:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:03,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039505862] [2025-04-30 10:39:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039505862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:03,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963707315] [2025-04-30 10:39:03,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:03,182 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:03,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:39:03,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:03,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:03,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:03,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:03,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:39:03,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:03,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:03,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:03,352 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:39:03,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:39:03,362 INFO L354 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-04-30 10:39:03,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:03,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:03,489 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:39:03,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-04-30 10:39:03,505 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:39:03,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:39:03,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:39:03,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2025-04-30 10:39:03,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 63 [2025-04-30 10:39:04,246 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:04,257 INFO L325 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2025-04-30 10:39:04,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2025-04-30 10:39:04,265 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:39:04,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-30 10:39:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:04,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:04,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963707315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:04,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2025-04-30 10:39:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326654896] [2025-04-30 10:39:04,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:04,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:39:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:04,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:39:04,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1468, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:39:04,782 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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-04-30 10:39:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,362 INFO L93 Difference]: Finished difference Result 270 states and 314 transitions. [2025-04-30 10:39:06,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:39:06,362 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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) Word has length 57 [2025-04-30 10:39:06,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,363 INFO L225 Difference]: With dead ends: 270 [2025-04-30 10:39:06,363 INFO L226 Difference]: Without dead ends: 270 [2025-04-30 10:39:06,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=2738, Unknown=0, NotChecked=0, Total=2970 [2025-04-30 10:39:06,364 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 138 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2649 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:39:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-30 10:39:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 222. [2025-04-30 10:39:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.2577319587628866) internal successors, (244), 208 states have internal predecessors, (244), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:39:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 264 transitions. [2025-04-30 10:39:06,373 INFO L79 Accepts]: Start accepts. Automaton has 222 states and 264 transitions. Word has length 57 [2025-04-30 10:39:06,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,373 INFO L485 AbstractCegarLoop]: Abstraction has 222 states and 264 transitions. [2025-04-30 10:39:06,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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-04-30 10:39:06,374 INFO L278 IsEmpty]: Start isEmpty. Operand 222 states and 264 transitions. [2025-04-30 10:39:06,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:39:06,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,374 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 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-04-30 10:39:06,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:39:06,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:39:06,575 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:06,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2120266257, now seen corresponding path program 1 times [2025-04-30 10:39:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451609260] [2025-04-30 10:39:06,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:06,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:06,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451609260] [2025-04-30 10:39:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451609260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:39:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878424961] [2025-04-30 10:39:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:06,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:06,636 INFO L87 Difference]: Start difference. First operand 222 states and 264 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-04-30 10:39:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,673 INFO L93 Difference]: Finished difference Result 253 states and 299 transitions. [2025-04-30 10:39:06,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:06,673 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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 58 [2025-04-30 10:39:06,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,674 INFO L225 Difference]: With dead ends: 253 [2025-04-30 10:39:06,674 INFO L226 Difference]: Without dead ends: 253 [2025-04-30 10:39:06,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04-30 10:39:06,675 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 415 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-30 10:39:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2025-04-30 10:39:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 218 states have (on average 1.2477064220183487) internal successors, (272), 232 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 10 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-30 10:39:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 294 transitions. [2025-04-30 10:39:06,680 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 294 transitions. Word has length 58 [2025-04-30 10:39:06,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,681 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 294 transitions. [2025-04-30 10:39:06,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 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-04-30 10:39:06,681 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 294 transitions. [2025-04-30 10:39:06,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:39:06,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,681 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 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-04-30 10:39:06,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:39:06,682 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:06,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1303812244, now seen corresponding path program 1 times [2025-04-30 10:39:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086740122] [2025-04-30 10:39:06,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:06,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:06,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-30 10:39:06,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:06,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086740122] [2025-04-30 10:39:06,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086740122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:06,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:06,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:39:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892788620] [2025-04-30 10:39:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:06,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:06,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:06,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,723 INFO L87 Difference]: Start difference. First operand 248 states and 294 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-30 10:39:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:06,735 INFO L93 Difference]: Finished difference Result 258 states and 306 transitions. [2025-04-30 10:39:06,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:06,735 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 59 [2025-04-30 10:39:06,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:06,736 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:39:06,736 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:39:06,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:06,737 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:06,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:39:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 247. [2025-04-30 10:39:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 232 states have internal predecessors, (273), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-30 10:39:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2025-04-30 10:39:06,743 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 59 [2025-04-30 10:39:06,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:06,743 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2025-04-30 10:39:06,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-30 10:39:06,744 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2025-04-30 10:39:06,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:39:06,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:06,745 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04-30 10:39:06,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:39:06,745 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:06,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1385315484, now seen corresponding path program 1 times [2025-04-30 10:39:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:06,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746077717] [2025-04-30 10:39:06,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:06,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:06,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:39:07,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746077717] [2025-04-30 10:39:07,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746077717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:07,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877619232] [2025-04-30 10:39:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:07,076 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:07,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:39:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:07,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:07,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:39:07,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:07,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:07,220 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:39:07,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:39:07,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:07,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:39:07,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-04-30 10:39:07,527 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:07,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2025-04-30 10:39:07,608 INFO L354 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-04-30 10:39:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:39:07,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:07,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2025-04-30 10:39:07,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-04-30 10:39:07,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-04-30 10:39:07,808 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-30 10:39:07,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-30 10:39:07,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-30 10:39:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877619232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:07,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:07,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 37 [2025-04-30 10:39:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304340515] [2025-04-30 10:39:07,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-30 10:39:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-30 10:39:07,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:39:07,910 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:08,681 INFO L93 Difference]: Finished difference Result 292 states and 345 transitions. [2025-04-30 10:39:08,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:39:08,681 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2025-04-30 10:39:08,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:08,682 INFO L225 Difference]: With dead ends: 292 [2025-04-30 10:39:08,682 INFO L226 Difference]: Without dead ends: 292 [2025-04-30 10:39:08,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:39:08,683 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 133 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:08,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1555 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:39:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-30 10:39:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 263. [2025-04-30 10:39:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 248 states have internal predecessors, (295), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-30 10:39:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 317 transitions. [2025-04-30 10:39:08,689 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 317 transitions. Word has length 58 [2025-04-30 10:39:08,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:08,689 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 317 transitions. [2025-04-30 10:39:08,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:08,689 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 317 transitions. [2025-04-30 10:39:08,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:39:08,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:08,689 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-04-30 10:39:08,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:39:08,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:08,890 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:08,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1385315485, now seen corresponding path program 1 times [2025-04-30 10:39:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:08,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376819329] [2025-04-30 10:39:08,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:08,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:08,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:08,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:39:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:09,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376819329] [2025-04-30 10:39:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376819329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:09,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171871522] [2025-04-30 10:39:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:09,189 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:09,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:39:09,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:09,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:09,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:09,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:09,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:39:09,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:09,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:09,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:09,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:39:09,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-04-30 10:39:09,658 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:09,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:39:09,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:09,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-30 10:39:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:09,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:09,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:09,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2025-04-30 10:39:10,222 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2025-04-30 10:39:10,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-04-30 10:39:10,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:39:10,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:39:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:39:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171871522] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:10,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 50 [2025-04-30 10:39:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925997311] [2025-04-30 10:39:10,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:10,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:39:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:39:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2409, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:39:10,462 INFO L87 Difference]: Start difference. First operand 263 states and 317 transitions. Second operand has 51 states, 50 states have (on average 2.36) internal successors, (118), 51 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:11,556 INFO L93 Difference]: Finished difference Result 307 states and 359 transitions. [2025-04-30 10:39:11,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:39:11,557 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.36) internal successors, (118), 51 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2025-04-30 10:39:11,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:11,558 INFO L225 Difference]: With dead ends: 307 [2025-04-30 10:39:11,558 INFO L226 Difference]: Without dead ends: 307 [2025-04-30 10:39:11,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=3779, Unknown=0, NotChecked=0, Total=4032 [2025-04-30 10:39:11,559 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 132 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:11,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2710 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:39:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-30 10:39:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 265. [2025-04-30 10:39:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 235 states have (on average 1.2595744680851064) internal successors, (296), 250 states have internal predecessors, (296), 7 states have call successors, (7), 5 states have call predecessors, (7), 11 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-30 10:39:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 318 transitions. [2025-04-30 10:39:11,563 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 318 transitions. Word has length 58 [2025-04-30 10:39:11,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:11,563 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 318 transitions. [2025-04-30 10:39:11,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.36) internal successors, (118), 51 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:39:11,563 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 318 transitions. [2025-04-30 10:39:11,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:39:11,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:11,564 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-04-30 10:39:11,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:11,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-30 10:39:11,765 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-30 10:39:11,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -4880880, now seen corresponding path program 1 times [2025-04-30 10:39:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:11,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759115454] [2025-04-30 10:39:11,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:11,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:11,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:11,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:11,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759115454] [2025-04-30 10:39:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759115454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373000981] [2025-04-30 10:39:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:11,947 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:11,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:39:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:39:12,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:39:12,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:39:12,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:12,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:12,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-30 10:39:12,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:12,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2025-04-30 10:39:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:39:12,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:12,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-04-30 10:39:12,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-30 10:39:12,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-30 10:39:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373000981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:12,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 25 [2025-04-30 10:39:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633355498] [2025-04-30 10:39:12,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:39:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:39:12,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:39:12,393 INFO L87 Difference]: Start difference. First operand 265 states and 318 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:39:16,422 WARN L532 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-04-30 10:39:20,474 WARN L532 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] Killed by 15