./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0521.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:57:02,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:57:02,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:57:02,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:57:02,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:57:02,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:57:02,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:57:02,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:57:02,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:57:02,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:57:02,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:57:02,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:57:02,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:57:02,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:57:02,309 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:57:02,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:57:02,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:57:02,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:57:02,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:57:02,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:57:02,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:57:02,312 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2025-03-17 11:57:02,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:57:02,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:57:02,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:57:02,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:57:02,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:57:02,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2025-03-17 11:57:03,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2f6358f/3b20a402649e4938952b80c7d1819f21/FLAGa28b263e7 [2025-03-17 11:57:03,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:57:03,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2025-03-17 11:57:03,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2f6358f/3b20a402649e4938952b80c7d1819f21/FLAGa28b263e7 [2025-03-17 11:57:04,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2f6358f/3b20a402649e4938952b80c7d1819f21 [2025-03-17 11:57:04,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:57:04,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:57:04,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:57:04,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:57:04,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:57:04,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b7c645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04, skipping insertion in model container [2025-03-17 11:57:04,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:57:04,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:57:04,444 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:57:04,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:57:04,503 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:57:04,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04 WrapperNode [2025-03-17 11:57:04,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:57:04,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:57:04,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:57:04,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:57:04,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,538 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 295 [2025-03-17 11:57:04,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:57:04,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:57:04,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:57:04,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:57:04,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,576 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 31, 8, 16, 3, 16]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 2, 0, 1, 0]. The 26 writes are split as follows [0, 8, 1, 8, 1, 8]. [2025-03-17 11:57:04,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:57:04,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:57:04,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:57:04,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:57:04,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (1/1) ... [2025-03-17 11:57:04,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:57:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:04,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:57:04,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:57:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 11:57:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 11:57:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 11:57:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:57:04,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:57:04,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:57:04,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:57:05,328 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-17 11:57:05,328 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:57:05,346 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:57:05,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:57:05,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:57:05 BoogieIcfgContainer [2025-03-17 11:57:05,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:57:05,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:57:05,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:57:05,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:57:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:57:04" (1/3) ... [2025-03-17 11:57:05,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f7013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:57:05, skipping insertion in model container [2025-03-17 11:57:05,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:04" (2/3) ... [2025-03-17 11:57:05,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f7013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:57:05, skipping insertion in model container [2025-03-17 11:57:05,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:57:05" (3/3) ... [2025-03-17 11:57:05,356 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0521.i [2025-03-17 11:57:05,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:57:05,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0521.i that has 1 procedures, 308 locations, 1 initial locations, 8 loop locations, and 152 error locations. [2025-03-17 11:57:05,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:57:05,420 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@706ff112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:57:05,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-03-17 11:57:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 155 states have (on average 2.193548387096774) internal successors, (340), 307 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:57:05,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:05,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:57:05,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash 11572990, now seen corresponding path program 1 times [2025-03-17 11:57:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:05,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402478483] [2025-03-17 11:57:05,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:05,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:57:05,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:57:05,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:05,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:05,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402478483] [2025-03-17 11:57:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402478483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405248288] [2025-03-17 11:57:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:05,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:57:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:05,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:57:05,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:57:05,555 INFO L87 Difference]: Start difference. First operand has 308 states, 155 states have (on average 2.193548387096774) internal successors, (340), 307 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:05,576 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2025-03-17 11:57:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:57:05,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:57:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:05,585 INFO L225 Difference]: With dead ends: 308 [2025-03-17 11:57:05,585 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 11:57:05,586 INFO L434 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-03-17 11:57:05,589 INFO L435 NwaCegarLoop]: 335 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, 335 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-03-17 11:57:05,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 11:57:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-17 11:57:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 154 states have (on average 2.1623376623376624) internal successors, (333), 305 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 333 transitions. [2025-03-17 11:57:05,620 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 333 transitions. Word has length 4 [2025-03-17 11:57:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:05,620 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 333 transitions. [2025-03-17 11:57:05,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 333 transitions. [2025-03-17 11:57:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:57:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:05,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:57:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:57:05,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 358754421, now seen corresponding path program 1 times [2025-03-17 11:57:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141749818] [2025-03-17 11:57:05,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:05,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:57:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:57:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:05,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141749818] [2025-03-17 11:57:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141749818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623734758] [2025-03-17 11:57:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:05,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:05,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:05,708 INFO L87 Difference]: Start difference. First operand 306 states and 333 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:05,993 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2025-03-17 11:57:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:57:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:05,998 INFO L225 Difference]: With dead ends: 290 [2025-03-17 11:57:05,998 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 11:57:05,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:05,998 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 59 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:05,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 399 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 11:57:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-17 11:57:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 154 states have (on average 2.0584415584415585) internal successors, (317), 289 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2025-03-17 11:57:06,018 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 5 [2025-03-17 11:57:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:06,018 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2025-03-17 11:57:06,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2025-03-17 11:57:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:57:06,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:06,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:57:06,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:57:06,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:06,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 358754422, now seen corresponding path program 1 times [2025-03-17 11:57:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509978947] [2025-03-17 11:57:06,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:06,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:06,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:57:06,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:57:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509978947] [2025-03-17 11:57:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509978947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221329925] [2025-03-17 11:57:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:06,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,108 INFO L87 Difference]: Start difference. First operand 290 states and 317 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:06,294 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2025-03-17 11:57:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:57:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:06,295 INFO L225 Difference]: With dead ends: 274 [2025-03-17 11:57:06,295 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 11:57:06,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,296 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 59 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:06,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 408 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 11:57:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-17 11:57:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 154 states have (on average 1.9545454545454546) internal successors, (301), 273 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2025-03-17 11:57:06,308 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 5 [2025-03-17 11:57:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:06,308 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2025-03-17 11:57:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2025-03-17 11:57:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:57:06,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:06,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:57:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:57:06,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 358755989, now seen corresponding path program 1 times [2025-03-17 11:57:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 11:57:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:57:06,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:57:06,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:06,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:06,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 11:57:06,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517335449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:06,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:06,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244232528] [2025-03-17 11:57:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:06,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:06,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:06,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,361 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:06,552 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2025-03-17 11:57:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:57:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:06,554 INFO L225 Difference]: With dead ends: 272 [2025-03-17 11:57:06,554 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 11:57:06,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,554 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:06,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 442 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 11:57:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-17 11:57:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 154 states have (on average 1.9415584415584415) internal successors, (299), 271 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 299 transitions. [2025-03-17 11:57:06,562 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 299 transitions. Word has length 5 [2025-03-17 11:57:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:06,562 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 299 transitions. [2025-03-17 11:57:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 299 transitions. [2025-03-17 11:57:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:57:06,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:06,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:57:06,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:57:06,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash 358755990, now seen corresponding path program 1 times [2025-03-17 11:57:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-03-17 11:57:06,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:06,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:57:06,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:57:06,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124239218] [2025-03-17 11:57:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124239218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234251286] [2025-03-17 11:57:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:06,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:06,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,624 INFO L87 Difference]: Start difference. First operand 272 states and 299 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:06,781 INFO L93 Difference]: Finished difference Result 270 states and 297 transitions. [2025-03-17 11:57:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:57:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:06,783 INFO L225 Difference]: With dead ends: 270 [2025-03-17 11:57:06,784 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 11:57:06,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:06,785 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:06,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 452 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 11:57:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-17 11:57:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 154 states have (on average 1.9285714285714286) internal successors, (297), 269 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 297 transitions. [2025-03-17 11:57:06,792 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 297 transitions. Word has length 5 [2025-03-17 11:57:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 297 transitions. [2025-03-17 11:57:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 297 transitions. [2025-03-17 11:57:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:57:06,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:06,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:06,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:57:06,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1165624018, now seen corresponding path program 1 times [2025-03-17 11:57:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185543350] [2025-03-17 11:57:06,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:06,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:57:06,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:57:06,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:06,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185543350] [2025-03-17 11:57:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185543350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:06,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824157843] [2025-03-17 11:57:06,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:06,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:57:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:57:06,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:57:06,902 INFO L87 Difference]: Start difference. First operand 270 states and 297 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:06,949 INFO L93 Difference]: Finished difference Result 333 states and 368 transitions. [2025-03-17 11:57:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:57:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:57:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:06,951 INFO L225 Difference]: With dead ends: 333 [2025-03-17 11:57:06,951 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 11:57:06,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:06,951 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 67 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:06,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 855 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 11:57:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 275. [2025-03-17 11:57:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.9056603773584906) internal successors, (303), 274 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-03-17 11:57:06,957 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 7 [2025-03-17 11:57:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:06,957 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-03-17 11:57:06,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-03-17 11:57:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:57:06,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:06,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:57:06,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:06,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2041188618, now seen corresponding path program 1 times [2025-03-17 11:57:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651178311] [2025-03-17 11:57:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:06,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:57:06,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:57:06,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651178311] [2025-03-17 11:57:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651178311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953361867] [2025-03-17 11:57:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:07,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,013 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:07,171 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2025-03-17 11:57:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:57:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:07,172 INFO L225 Difference]: With dead ends: 273 [2025-03-17 11:57:07,172 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 11:57:07,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,173 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:07,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 441 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 11:57:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-17 11:57:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 159 states have (on average 1.8930817610062893) internal successors, (301), 272 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2025-03-17 11:57:07,178 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 10 [2025-03-17 11:57:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:07,178 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2025-03-17 11:57:07,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2025-03-17 11:57:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:57:07,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:07,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:07,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:57:07,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2041188617, now seen corresponding path program 1 times [2025-03-17 11:57:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214614769] [2025-03-17 11:57:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:07,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:57:07,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:57:07,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:07,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214614769] [2025-03-17 11:57:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214614769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642298616] [2025-03-17 11:57:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,253 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:07,378 INFO L93 Difference]: Finished difference Result 271 states and 299 transitions. [2025-03-17 11:57:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:57:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:07,380 INFO L225 Difference]: With dead ends: 271 [2025-03-17 11:57:07,380 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 11:57:07,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,380 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:07,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 451 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 11:57:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-17 11:57:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 159 states have (on average 1.880503144654088) internal successors, (299), 270 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2025-03-17 11:57:07,386 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 10 [2025-03-17 11:57:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:07,386 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2025-03-17 11:57:07,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2025-03-17 11:57:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:57:07,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:07,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:57:07,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash 612872576, now seen corresponding path program 1 times [2025-03-17 11:57:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:07,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249263798] [2025-03-17 11:57:07,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:07,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:57:07,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:57:07,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:07,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249263798] [2025-03-17 11:57:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249263798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514847065] [2025-03-17 11:57:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:07,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:07,513 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:07,578 INFO L93 Difference]: Finished difference Result 290 states and 321 transitions. [2025-03-17 11:57:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:57:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:07,579 INFO L225 Difference]: With dead ends: 290 [2025-03-17 11:57:07,579 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 11:57:07,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:07,580 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 37 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 826 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-03-17 11:57:07,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 826 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 11:57:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 274. [2025-03-17 11:57:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 162 states have (on average 1.8641975308641976) internal successors, (302), 273 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-03-17 11:57:07,584 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 12 [2025-03-17 11:57:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-03-17 11:57:07,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-03-17 11:57:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:57:07,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:07,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:57:07,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1784609508, now seen corresponding path program 1 times [2025-03-17 11:57:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522708560] [2025-03-17 11:57:07,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:07,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:57:07,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:57:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522708560] [2025-03-17 11:57:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522708560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:07,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208330928] [2025-03-17 11:57:07,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:07,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:07,654 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:07,728 INFO L93 Difference]: Finished difference Result 398 states and 438 transitions. [2025-03-17 11:57:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:57:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:07,730 INFO L225 Difference]: With dead ends: 398 [2025-03-17 11:57:07,730 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 11:57:07,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:07,730 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 130 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:07,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1099 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 11:57:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 338. [2025-03-17 11:57:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 226 states have (on average 1.9026548672566372) internal successors, (430), 337 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 430 transitions. [2025-03-17 11:57:07,736 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 430 transitions. Word has length 13 [2025-03-17 11:57:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:07,736 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 430 transitions. [2025-03-17 11:57:07,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2025-03-17 11:57:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:57:07,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:07,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:07,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:57:07,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1317815933, now seen corresponding path program 1 times [2025-03-17 11:57:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277561421] [2025-03-17 11:57:07,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:57:07,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:57:07,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:07,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277561421] [2025-03-17 11:57:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277561421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254290006] [2025-03-17 11:57:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,770 INFO L87 Difference]: Start difference. First operand 338 states and 430 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:07,939 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2025-03-17 11:57:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:57:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:07,940 INFO L225 Difference]: With dead ends: 322 [2025-03-17 11:57:07,941 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 11:57:07,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,941 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 59 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:07,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 339 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 11:57:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-03-17 11:57:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 226 states have (on average 1.761061946902655) internal successors, (398), 321 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 398 transitions. [2025-03-17 11:57:07,948 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 398 transitions. Word has length 15 [2025-03-17 11:57:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:07,948 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 398 transitions. [2025-03-17 11:57:07,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 398 transitions. [2025-03-17 11:57:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:57:07,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:07,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:07,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:57:07,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:07,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1317815934, now seen corresponding path program 1 times [2025-03-17 11:57:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:07,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901114544] [2025-03-17 11:57:07,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:57:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:57:07,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:07,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901114544] [2025-03-17 11:57:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901114544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:07,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:07,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39188306] [2025-03-17 11:57:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:07,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:07,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:07,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:07,997 INFO L87 Difference]: Start difference. First operand 322 states and 398 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:08,126 INFO L93 Difference]: Finished difference Result 306 states and 366 transitions. [2025-03-17 11:57:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:57:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:08,128 INFO L225 Difference]: With dead ends: 306 [2025-03-17 11:57:08,128 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 11:57:08,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:08,128 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 59 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:08,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 348 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 11:57:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-17 11:57:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 226 states have (on average 1.6194690265486726) internal successors, (366), 305 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 366 transitions. [2025-03-17 11:57:08,134 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 366 transitions. Word has length 15 [2025-03-17 11:57:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:08,134 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 366 transitions. [2025-03-17 11:57:08,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 366 transitions. [2025-03-17 11:57:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:57:08,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:08,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:08,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:57:08,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:08,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1794760416, now seen corresponding path program 1 times [2025-03-17 11:57:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328016883] [2025-03-17 11:57:08,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:08,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:57:08,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:57:08,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:08,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328016883] [2025-03-17 11:57:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328016883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596844607] [2025-03-17 11:57:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:08,157 INFO L87 Difference]: Start difference. First operand 306 states and 366 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:08,166 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2025-03-17 11:57:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:57:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:08,167 INFO L225 Difference]: With dead ends: 291 [2025-03-17 11:57:08,167 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 11:57:08,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:08,168 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:08,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 11:57:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-17 11:57:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 211 states have (on average 1.6161137440758293) internal successors, (341), 290 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 341 transitions. [2025-03-17 11:57:08,172 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 341 transitions. Word has length 15 [2025-03-17 11:57:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:08,173 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 341 transitions. [2025-03-17 11:57:08,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 341 transitions. [2025-03-17 11:57:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:57:08,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:08,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:08,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:57:08,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:08,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -594237926, now seen corresponding path program 1 times [2025-03-17 11:57:08,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127819004] [2025-03-17 11:57:08,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:08,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:57:08,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:57:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127819004] [2025-03-17 11:57:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127819004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:08,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:08,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121603765] [2025-03-17 11:57:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:08,254 INFO L87 Difference]: Start difference. First operand 291 states and 341 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:08,292 INFO L93 Difference]: Finished difference Result 292 states and 339 transitions. [2025-03-17 11:57:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 11:57:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:08,293 INFO L225 Difference]: With dead ends: 292 [2025-03-17 11:57:08,293 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 11:57:08,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:08,294 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:08,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 734 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 11:57:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-17 11:57:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 212 states have (on average 1.599056603773585) internal successors, (339), 291 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 339 transitions. [2025-03-17 11:57:08,298 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 339 transitions. Word has length 17 [2025-03-17 11:57:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 339 transitions. [2025-03-17 11:57:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 339 transitions. [2025-03-17 11:57:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:57:08,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:08,299 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:57:08,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1113433869, now seen corresponding path program 1 times [2025-03-17 11:57:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221116281] [2025-03-17 11:57:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:57:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:57:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221116281] [2025-03-17 11:57:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221116281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333612167] [2025-03-17 11:57:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:08,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:08,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:08,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:08,417 INFO L87 Difference]: Start difference. First operand 292 states and 339 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:08,648 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2025-03-17 11:57:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:57:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:08,649 INFO L225 Difference]: With dead ends: 313 [2025-03-17 11:57:08,649 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 11:57:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:57:08,650 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 82 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:08,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 596 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 11:57:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 294. [2025-03-17 11:57:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2025-03-17 11:57:08,657 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 18 [2025-03-17 11:57:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:08,657 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2025-03-17 11:57:08,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2025-03-17 11:57:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:57:08,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:08,658 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:08,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:57:08,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1113433870, now seen corresponding path program 1 times [2025-03-17 11:57:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774127710] [2025-03-17 11:57:08,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:08,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:57:08,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:57:08,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:08,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774127710] [2025-03-17 11:57:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774127710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413002682] [2025-03-17 11:57:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:08,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:08,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:08,806 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:09,082 INFO L93 Difference]: Finished difference Result 301 states and 351 transitions. [2025-03-17 11:57:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:57:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:09,083 INFO L225 Difference]: With dead ends: 301 [2025-03-17 11:57:09,084 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 11:57:09,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:57:09,085 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 64 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:09,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 585 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 11:57:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2025-03-17 11:57:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.587962962962963) internal successors, (343), 292 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 343 transitions. [2025-03-17 11:57:09,089 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 343 transitions. Word has length 18 [2025-03-17 11:57:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:09,089 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 343 transitions. [2025-03-17 11:57:09,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 343 transitions. [2025-03-17 11:57:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:57:09,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:09,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:09,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:57:09,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:09,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2094816147, now seen corresponding path program 1 times [2025-03-17 11:57:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419735292] [2025-03-17 11:57:09,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:09,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:57:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:57:09,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:09,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419735292] [2025-03-17 11:57:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419735292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:09,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:09,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911287387] [2025-03-17 11:57:09,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:09,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:09,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:09,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:09,174 INFO L87 Difference]: Start difference. First operand 293 states and 343 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:09,411 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2025-03-17 11:57:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:57:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:09,412 INFO L225 Difference]: With dead ends: 306 [2025-03-17 11:57:09,412 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 11:57:09,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:09,413 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 49 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:09,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 635 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 11:57:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2025-03-17 11:57:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 215 states have (on average 1.586046511627907) internal successors, (341), 291 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2025-03-17 11:57:09,418 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 22 [2025-03-17 11:57:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:09,419 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2025-03-17 11:57:09,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2025-03-17 11:57:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:57:09,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:09,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:09,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:57:09,419 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2093700110, now seen corresponding path program 1 times [2025-03-17 11:57:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293535430] [2025-03-17 11:57:09,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:57:09,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:57:09,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:09,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:09,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293535430] [2025-03-17 11:57:09,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293535430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:09,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:09,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:09,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816085900] [2025-03-17 11:57:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:09,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:09,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:09,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:09,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:09,503 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:09,562 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2025-03-17 11:57:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:57:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:09,564 INFO L225 Difference]: With dead ends: 309 [2025-03-17 11:57:09,564 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 11:57:09,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:09,565 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 19 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:09,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 954 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 11:57:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 281. [2025-03-17 11:57:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 204 states have (on average 1.5735294117647058) internal successors, (321), 280 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 321 transitions. [2025-03-17 11:57:09,570 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 321 transitions. Word has length 22 [2025-03-17 11:57:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 321 transitions. [2025-03-17 11:57:09,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 321 transitions. [2025-03-17 11:57:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:57:09,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:09,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:09,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:57:09,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1610135841, now seen corresponding path program 1 times [2025-03-17 11:57:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491354525] [2025-03-17 11:57:09,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:09,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:57:09,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:57:09,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491354525] [2025-03-17 11:57:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491354525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:09,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710114528] [2025-03-17 11:57:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:09,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:09,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:09,626 INFO L87 Difference]: Start difference. First operand 281 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:09,673 INFO L93 Difference]: Finished difference Result 286 states and 325 transitions. [2025-03-17 11:57:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 11:57:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:09,674 INFO L225 Difference]: With dead ends: 286 [2025-03-17 11:57:09,674 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 11:57:09,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:57:09,674 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 66 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:09,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 967 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 11:57:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 278. [2025-03-17 11:57:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2025-03-17 11:57:09,679 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 24 [2025-03-17 11:57:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2025-03-17 11:57:09,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2025-03-17 11:57:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:57:09,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:09,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:09,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:57:09,680 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:09,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash 414169448, now seen corresponding path program 1 times [2025-03-17 11:57:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123478248] [2025-03-17 11:57:09,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:57:09,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:57:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123478248] [2025-03-17 11:57:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123478248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:09,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819831966] [2025-03-17 11:57:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:09,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:09,713 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:09,722 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2025-03-17 11:57:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:09,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 11:57:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:09,724 INFO L225 Difference]: With dead ends: 263 [2025-03-17 11:57:09,724 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 11:57:09,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:09,724 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:09,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 11:57:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-17 11:57:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 245 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 275 transitions. [2025-03-17 11:57:09,728 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 275 transitions. Word has length 25 [2025-03-17 11:57:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:09,728 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 275 transitions. [2025-03-17 11:57:09,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 275 transitions. [2025-03-17 11:57:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:57:09,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:09,729 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:57:09,729 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2035713759, now seen corresponding path program 1 times [2025-03-17 11:57:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60538354] [2025-03-17 11:57:09,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:57:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:57:09,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60538354] [2025-03-17 11:57:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60538354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:57:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144594964] [2025-03-17 11:57:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:57:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:10,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:57:10,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:57:10,024 INFO L87 Difference]: Start difference. First operand 246 states and 275 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:10,593 INFO L93 Difference]: Finished difference Result 248 states and 277 transitions. [2025-03-17 11:57:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:57:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 11:57:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:10,594 INFO L225 Difference]: With dead ends: 248 [2025-03-17 11:57:10,594 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 11:57:10,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:10,594 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 76 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:10,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1204 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:57:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 11:57:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2025-03-17 11:57:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 169 states have (on average 1.621301775147929) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2025-03-17 11:57:10,599 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 25 [2025-03-17 11:57:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:10,599 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2025-03-17 11:57:10,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2025-03-17 11:57:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:57:10,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:10,599 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:10,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:57:10,599 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:10,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2035713758, now seen corresponding path program 1 times [2025-03-17 11:57:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442863343] [2025-03-17 11:57:10,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:10,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:57:10,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:57:10,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:10,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:10,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442863343] [2025-03-17 11:57:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442863343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:10,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:57:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103541683] [2025-03-17 11:57:10,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:57:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:10,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:57:10,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:57:10,990 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:11,649 INFO L93 Difference]: Finished difference Result 247 states and 276 transitions. [2025-03-17 11:57:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:57:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 11:57:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:11,650 INFO L225 Difference]: With dead ends: 247 [2025-03-17 11:57:11,650 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 11:57:11,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:57:11,651 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 76 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:11,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1498 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:57:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 11:57:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2025-03-17 11:57:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 169 states have (on average 1.6153846153846154) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2025-03-17 11:57:11,655 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 25 [2025-03-17 11:57:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:11,655 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2025-03-17 11:57:11,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2025-03-17 11:57:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:57:11,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:11,655 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 11:57:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:57:11,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1282811747, now seen corresponding path program 1 times [2025-03-17 11:57:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902124272] [2025-03-17 11:57:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:11,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:57:11,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:57:11,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:11,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902124272] [2025-03-17 11:57:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902124272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632237605] [2025-03-17 11:57:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:57:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:11,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:57:11,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:57:11,754 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:11,861 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2025-03-17 11:57:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:57:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 11:57:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:11,862 INFO L225 Difference]: With dead ends: 262 [2025-03-17 11:57:11,862 INFO L226 Difference]: Without dead ends: 262 [2025-03-17 11:57:11,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:11,863 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 110 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:11,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1550 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-17 11:57:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2025-03-17 11:57:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 169 states have (on average 1.6094674556213018) internal successors, (272), 243 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2025-03-17 11:57:11,866 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 26 [2025-03-17 11:57:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:11,866 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2025-03-17 11:57:11,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2025-03-17 11:57:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:57:11,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:11,867 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 11:57:11,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:57:11,867 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1248723363, now seen corresponding path program 1 times [2025-03-17 11:57:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551769542] [2025-03-17 11:57:11,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:57:11,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:57:11,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:11,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:57:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551769542] [2025-03-17 11:57:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551769542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468909882] [2025-03-17 11:57:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:11,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:11,970 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:12,137 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2025-03-17 11:57:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 11:57:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:12,138 INFO L225 Difference]: With dead ends: 261 [2025-03-17 11:57:12,139 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 11:57:12,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:12,139 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 21 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:12,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 713 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 11:57:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2025-03-17 11:57:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 169 states have (on average 1.6035502958579881) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2025-03-17 11:57:12,143 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2025-03-17 11:57:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:12,143 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2025-03-17 11:57:12,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2025-03-17 11:57:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:57:12,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:12,143 INFO L218 NwaCegarLoop]: trace histogram [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-03-17 11:57:12,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:57:12,144 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:12,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1248723362, now seen corresponding path program 1 times [2025-03-17 11:57:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297027011] [2025-03-17 11:57:12,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:57:12,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:57:12,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:12,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297027011] [2025-03-17 11:57:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297027011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544886059] [2025-03-17 11:57:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:12,418 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:12,883 INFO L93 Difference]: Finished difference Result 268 states and 299 transitions. [2025-03-17 11:57:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:57:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 11:57:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:12,884 INFO L225 Difference]: With dead ends: 268 [2025-03-17 11:57:12,884 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 11:57:12,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:12,886 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 99 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 965 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:57:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 11:57:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2025-03-17 11:57:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 169 states have (on average 1.5976331360946745) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2025-03-17 11:57:12,890 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 29 [2025-03-17 11:57:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2025-03-17 11:57:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2025-03-17 11:57:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:57:12,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:12,891 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-17 11:57:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:57:12,892 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1639135969, now seen corresponding path program 1 times [2025-03-17 11:57:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570680788] [2025-03-17 11:57:12,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:12,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:57:12,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:57:12,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:12,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570680788] [2025-03-17 11:57:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570680788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:13,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:57:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168572965] [2025-03-17 11:57:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:57:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:13,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:57:13,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:57:13,065 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:13,281 INFO L93 Difference]: Finished difference Result 245 states and 273 transitions. [2025-03-17 11:57:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:57:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 11:57:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:13,282 INFO L225 Difference]: With dead ends: 245 [2025-03-17 11:57:13,282 INFO L226 Difference]: Without dead ends: 245 [2025-03-17 11:57:13,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:13,283 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 69 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:13,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2136 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-17 11:57:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2025-03-17 11:57:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 170 states have (on average 1.5941176470588236) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2025-03-17 11:57:13,287 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 32 [2025-03-17 11:57:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:13,287 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2025-03-17 11:57:13,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2025-03-17 11:57:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:57:13,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:13,288 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-17 11:57:13,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:57:13,288 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2047291592, now seen corresponding path program 1 times [2025-03-17 11:57:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308932132] [2025-03-17 11:57:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:57:13,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:57:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308932132] [2025-03-17 11:57:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308932132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918114789] [2025-03-17 11:57:13,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:13,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:13,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:13,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:57:13,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:57:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:57:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:13,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 11:57:13,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:13,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:14,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:57:14,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:57:14,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-03-17 11:57:14,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-03-17 11:57:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-03-17 11:57:14,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-03-17 11:57:14,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-17 11:57:14,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 11:57:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:14,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918114789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:14,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2025-03-17 11:57:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650010407] [2025-03-17 11:57:14,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:14,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:57:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:14,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:57:14,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:57:14,239 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:14,606 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2025-03-17 11:57:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:57:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 11:57:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:14,607 INFO L225 Difference]: With dead ends: 321 [2025-03-17 11:57:14,607 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 11:57:14,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:57:14,608 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 180 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:14,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2094 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 11:57:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2025-03-17 11:57:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 198 states have (on average 1.52020202020202) internal successors, (301), 270 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2025-03-17 11:57:14,611 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 33 [2025-03-17 11:57:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:14,611 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2025-03-17 11:57:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2025-03-17 11:57:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 11:57:14,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:14,612 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-17 11:57:14,619 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-03-17 11:57:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 11:57:14,816 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash 139089373, now seen corresponding path program 1 times [2025-03-17 11:57:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:14,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181122176] [2025-03-17 11:57:14,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:57:14,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:57:14,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:14,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:15,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181122176] [2025-03-17 11:57:15,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181122176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:15,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:57:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415670622] [2025-03-17 11:57:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:15,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:57:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:15,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:57:15,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:15,301 INFO L87 Difference]: Start difference. First operand 271 states and 301 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:15,871 INFO L93 Difference]: Finished difference Result 271 states and 299 transitions. [2025-03-17 11:57:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:57:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 11:57:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:15,872 INFO L225 Difference]: With dead ends: 271 [2025-03-17 11:57:15,872 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 11:57:15,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:57:15,873 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 70 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:15,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2580 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:57:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 11:57:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-17 11:57:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 270 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2025-03-17 11:57:15,877 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 34 [2025-03-17 11:57:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:15,877 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2025-03-17 11:57:15,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2025-03-17 11:57:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:57:15,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:15,877 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:57:15,878 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 192162961, now seen corresponding path program 1 times [2025-03-17 11:57:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328554283] [2025-03-17 11:57:15,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:15,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:57:15,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:57:15,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:15,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:57:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328554283] [2025-03-17 11:57:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328554283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:57:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454417624] [2025-03-17 11:57:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:16,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:16,008 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:16,057 INFO L93 Difference]: Finished difference Result 277 states and 305 transitions. [2025-03-17 11:57:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 11:57:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:16,058 INFO L225 Difference]: With dead ends: 277 [2025-03-17 11:57:16,058 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 11:57:16,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:16,059 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:16,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 948 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 11:57:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2025-03-17 11:57:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 203 states have (on average 1.4975369458128078) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-03-17 11:57:16,062 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 39 [2025-03-17 11:57:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:16,062 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-03-17 11:57:16,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-03-17 11:57:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:57:16,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:16,062 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:57:16,062 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:16,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1628744651, now seen corresponding path program 1 times [2025-03-17 11:57:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554208677] [2025-03-17 11:57:16,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:16,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:16,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554208677] [2025-03-17 11:57:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554208677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917926936] [2025-03-17 11:57:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:16,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:57:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:16,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:57:16,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:57:16,185 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:16,515 INFO L93 Difference]: Finished difference Result 298 states and 329 transitions. [2025-03-17 11:57:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:57:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:57:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:16,517 INFO L225 Difference]: With dead ends: 298 [2025-03-17 11:57:16,517 INFO L226 Difference]: Without dead ends: 298 [2025-03-17 11:57:16,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:16,517 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:16,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 625 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-17 11:57:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 279. [2025-03-17 11:57:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 278 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2025-03-17 11:57:16,521 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 40 [2025-03-17 11:57:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:16,521 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2025-03-17 11:57:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2025-03-17 11:57:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:57:16,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:16,522 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:16,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:57:16,522 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1628744652, now seen corresponding path program 1 times [2025-03-17 11:57:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188033910] [2025-03-17 11:57:16,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:16,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:16,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:16,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188033910] [2025-03-17 11:57:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188033910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:16,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:16,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188749876] [2025-03-17 11:57:16,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:16,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:16,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:16,771 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:17,163 INFO L93 Difference]: Finished difference Result 368 states and 413 transitions. [2025-03-17 11:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:57:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:57:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:17,165 INFO L225 Difference]: With dead ends: 368 [2025-03-17 11:57:17,165 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 11:57:17,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:57:17,165 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 129 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:17,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1026 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 11:57:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 347. [2025-03-17 11:57:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 276 states have (on average 1.4927536231884058) internal successors, (412), 346 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 412 transitions. [2025-03-17 11:57:17,170 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 412 transitions. Word has length 40 [2025-03-17 11:57:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:17,171 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 412 transitions. [2025-03-17 11:57:17,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 412 transitions. [2025-03-17 11:57:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:57:17,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:17,171 INFO L218 NwaCegarLoop]: trace histogram [3, 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-03-17 11:57:17,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:57:17,171 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2121904205, now seen corresponding path program 2 times [2025-03-17 11:57:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368535120] [2025-03-17 11:57:17,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:57:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:17,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 11:57:17,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:57:17,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:57:17,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368535120] [2025-03-17 11:57:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368535120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472904270] [2025-03-17 11:57:18,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:57:18,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:18,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:18,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:57:18,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 11:57:18,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:57:18,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:57:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:18,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 11:57:18,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:18,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:57:18,423 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:57:18,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 11:57:18,466 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:57:18,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:57:18,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:57:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:18,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-17 11:57:18,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:18,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:18,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:18,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-03-17 11:57:18,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:18,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-03-17 11:57:18,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:57:18,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-17 11:57:18,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2025-03-17 11:57:18,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 11:57:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:18,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:21,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_56| Int) (v_ArrVal_1046 Int) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1049 Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| v_ArrVal_1046) |v_ULTIMATE.start_main_~#iter~0#1.base_56| v_ArrVal_1049))) (or (< |v_ULTIMATE.start_main_~#iter~0#1.base_56| (+ |c_#StackHeapBarrier| 1)) (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) 1) (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_18|) 1))))) is different from false [2025-03-17 11:57:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472904270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:21,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 14] total 40 [2025-03-17 11:57:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423490885] [2025-03-17 11:57:21,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:21,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 11:57:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:21,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 11:57:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1454, Unknown=1, NotChecked=76, Total=1640 [2025-03-17 11:57:21,894 INFO L87 Difference]: Start difference. First operand 347 states and 412 transitions. Second operand has 41 states, 40 states have (on average 2.825) internal successors, (113), 41 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:24,496 INFO L93 Difference]: Finished difference Result 387 states and 459 transitions. [2025-03-17 11:57:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:57:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 41 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-17 11:57:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:24,497 INFO L225 Difference]: With dead ends: 387 [2025-03-17 11:57:24,497 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 11:57:24,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=283, Invalid=2270, Unknown=1, NotChecked=98, Total=2652 [2025-03-17 11:57:24,498 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 462 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:24,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 4585 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4634 Invalid, 0 Unknown, 222 Unchecked, 2.1s Time] [2025-03-17 11:57:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 11:57:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 346. [2025-03-17 11:57:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 276 states have (on average 1.4891304347826086) internal successors, (411), 345 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 411 transitions. [2025-03-17 11:57:24,504 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 411 transitions. Word has length 44 [2025-03-17 11:57:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:24,504 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 411 transitions. [2025-03-17 11:57:24,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.825) internal successors, (113), 41 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 411 transitions. [2025-03-17 11:57:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:57:24,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:24,505 INFO L218 NwaCegarLoop]: trace histogram [3, 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-03-17 11:57:24,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:57:24,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 11:57:24,708 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:24,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2121904204, now seen corresponding path program 1 times [2025-03-17 11:57:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957120018] [2025-03-17 11:57:24,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:24,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:57:24,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:57:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957120018] [2025-03-17 11:57:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957120018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152130239] [2025-03-17 11:57:25,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:25,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:57:25,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:57:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:57:25,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:25,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:25,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-17 11:57:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:25,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:57:25,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:57:25,779 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:57:25,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:57:25,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:57:25,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:57:25,880 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:57:25,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:57:25,896 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 11:57:25,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:57:25,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:57:25,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-17 11:57:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:26,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 11:57:26,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:26,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:26,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 116 [2025-03-17 11:57:26,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 124 [2025-03-17 11:57:26,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 110 [2025-03-17 11:57:26,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 107 [2025-03-17 11:57:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-03-17 11:57:26,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:26,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 34 [2025-03-17 11:57:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2025-03-17 11:57:26,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 11:57:26,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:57:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:26,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152130239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:31,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 45 [2025-03-17 11:57:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707607242] [2025-03-17 11:57:31,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 11:57:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 11:57:31,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1937, Unknown=1, NotChecked=0, Total=2070 [2025-03-17 11:57:31,794 INFO L87 Difference]: Start difference. First operand 346 states and 411 transitions. Second operand has 46 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:35,070 INFO L93 Difference]: Finished difference Result 376 states and 444 transitions. [2025-03-17 11:57:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:57:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-17 11:57:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:35,071 INFO L225 Difference]: With dead ends: 376 [2025-03-17 11:57:35,071 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 11:57:35,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=493, Invalid=4062, Unknown=1, NotChecked=0, Total=4556 [2025-03-17 11:57:35,072 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 464 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 4631 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 4660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:35,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 4397 Invalid, 4660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4631 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 11:57:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 11:57:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 345. [2025-03-17 11:57:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 276 states have (on average 1.4855072463768115) internal successors, (410), 344 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 410 transitions. [2025-03-17 11:57:35,076 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 410 transitions. Word has length 44 [2025-03-17 11:57:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 410 transitions. [2025-03-17 11:57:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 410 transitions. [2025-03-17 11:57:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 11:57:35,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:35,077 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:35,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:57:35,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:35,278 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1291230051, now seen corresponding path program 1 times [2025-03-17 11:57:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-03-17 11:57:35,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:35,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:57:35,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:57:35,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:35,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:57:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-03-17 11:57:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462158536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:35,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:35,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15431488] [2025-03-17 11:57:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:35,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:35,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:35,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:35,349 INFO L87 Difference]: Start difference. First operand 345 states and 410 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:35,528 INFO L93 Difference]: Finished difference Result 344 states and 408 transitions. [2025-03-17 11:57:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:57:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-17 11:57:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:35,529 INFO L225 Difference]: With dead ends: 344 [2025-03-17 11:57:35,529 INFO L226 Difference]: Without dead ends: 344 [2025-03-17 11:57:35,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:35,530 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 63 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:35,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 409 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-17 11:57:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-03-17 11:57:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 276 states have (on average 1.4782608695652173) internal successors, (408), 343 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 408 transitions. [2025-03-17 11:57:35,534 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 408 transitions. Word has length 46 [2025-03-17 11:57:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 408 transitions. [2025-03-17 11:57:35,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 408 transitions. [2025-03-17 11:57:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 11:57:35,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:35,535 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:57:35,535 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1291230052, now seen corresponding path program 1 times [2025-03-17 11:57:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942302105] [2025-03-17 11:57:35,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:35,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:57:35,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:57:35,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:35,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942302105] [2025-03-17 11:57:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942302105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:57:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263538299] [2025-03-17 11:57:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:57:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:35,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:57:35,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:57:35,876 INFO L87 Difference]: Start difference. First operand 344 states and 408 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:36,644 INFO L93 Difference]: Finished difference Result 419 states and 470 transitions. [2025-03-17 11:57:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:57:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-17 11:57:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:36,645 INFO L225 Difference]: With dead ends: 419 [2025-03-17 11:57:36,645 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 11:57:36,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:57:36,646 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 245 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:36,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1007 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:57:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 11:57:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 375. [2025-03-17 11:57:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 307 states have (on average 1.52442996742671) internal successors, (468), 374 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 468 transitions. [2025-03-17 11:57:36,649 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 468 transitions. Word has length 46 [2025-03-17 11:57:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:36,649 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 468 transitions. [2025-03-17 11:57:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 468 transitions. [2025-03-17 11:57:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:57:36,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:36,650 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:36,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:57:36,650 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1488170035, now seen corresponding path program 1 times [2025-03-17 11:57:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411941066] [2025-03-17 11:57:36,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:36,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:57:36,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:57:36,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:36,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411941066] [2025-03-17 11:57:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411941066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:57:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476705121] [2025-03-17 11:57:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:57:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:36,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:57:36,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:57:36,717 INFO L87 Difference]: Start difference. First operand 375 states and 468 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:36,837 INFO L93 Difference]: Finished difference Result 422 states and 475 transitions. [2025-03-17 11:57:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:57:36,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-17 11:57:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:36,839 INFO L225 Difference]: With dead ends: 422 [2025-03-17 11:57:36,839 INFO L226 Difference]: Without dead ends: 422 [2025-03-17 11:57:36,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:57:36,839 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 230 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:36,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1176 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-17 11:57:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2025-03-17 11:57:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 307 states have (on average 1.517915309446254) internal successors, (466), 374 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 466 transitions. [2025-03-17 11:57:36,844 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 466 transitions. Word has length 47 [2025-03-17 11:57:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:36,844 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 466 transitions. [2025-03-17 11:57:36,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 466 transitions. [2025-03-17 11:57:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:57:36,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:36,845 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:36,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:57:36,845 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1523916704, now seen corresponding path program 1 times [2025-03-17 11:57:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408087626] [2025-03-17 11:57:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:57:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:57:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:37,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408087626] [2025-03-17 11:57:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408087626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074983306] [2025-03-17 11:57:37,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:37,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:37,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:37,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:57:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:57:37,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:57:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:37,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 11:57:37,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:37,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:37,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:37,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:37,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:37,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:37,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:57:37,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 11:57:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:37,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074983306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:37,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2025-03-17 11:57:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47562060] [2025-03-17 11:57:37,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:57:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:37,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:57:37,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:57:37,676 INFO L87 Difference]: Start difference. First operand 375 states and 466 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:38,068 INFO L93 Difference]: Finished difference Result 468 states and 571 transitions. [2025-03-17 11:57:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:57:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-17 11:57:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:38,070 INFO L225 Difference]: With dead ends: 468 [2025-03-17 11:57:38,070 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 11:57:38,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:57:38,070 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 164 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:38,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 2895 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 11:57:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 386. [2025-03-17 11:57:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 318 states have (on average 1.5031446540880504) internal successors, (478), 385 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 478 transitions. [2025-03-17 11:57:38,075 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 478 transitions. Word has length 49 [2025-03-17 11:57:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:38,075 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 478 transitions. [2025-03-17 11:57:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 478 transitions. [2025-03-17 11:57:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:57:38,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:38,076 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:38,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:57:38,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-17 11:57:38,280 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:38,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 874056389, now seen corresponding path program 1 times [2025-03-17 11:57:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:38,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675300218] [2025-03-17 11:57:38,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:38,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:57:38,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:57:38,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:38,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:38,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675300218] [2025-03-17 11:57:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675300218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:38,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:38,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079507463] [2025-03-17 11:57:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:38,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:57:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:38,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:57:38,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:57:38,385 INFO L87 Difference]: Start difference. First operand 386 states and 478 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:38,536 INFO L93 Difference]: Finished difference Result 430 states and 482 transitions. [2025-03-17 11:57:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:57:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-17 11:57:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:38,537 INFO L225 Difference]: With dead ends: 430 [2025-03-17 11:57:38,537 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 11:57:38,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:57:38,537 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 232 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:38,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1371 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 11:57:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 379. [2025-03-17 11:57:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 311 states have (on average 1.504823151125402) internal successors, (468), 378 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 468 transitions. [2025-03-17 11:57:38,543 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 468 transitions. Word has length 49 [2025-03-17 11:57:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:38,543 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 468 transitions. [2025-03-17 11:57:38,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 468 transitions. [2025-03-17 11:57:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:57:38,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:38,545 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:38,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:57:38,545 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:38,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 506824031, now seen corresponding path program 1 times [2025-03-17 11:57:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968778827] [2025-03-17 11:57:38,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:38,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968778827] [2025-03-17 11:57:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968778827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:38,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:38,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:57:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218401108] [2025-03-17 11:57:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:38,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:57:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:38,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:57:38,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:57:38,680 INFO L87 Difference]: Start difference. First operand 379 states and 468 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:38,938 INFO L93 Difference]: Finished difference Result 444 states and 497 transitions. [2025-03-17 11:57:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:57:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-17 11:57:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:38,940 INFO L225 Difference]: With dead ends: 444 [2025-03-17 11:57:38,940 INFO L226 Difference]: Without dead ends: 444 [2025-03-17 11:57:38,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:57:38,941 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 279 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:38,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1691 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-17 11:57:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 379. [2025-03-17 11:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 311 states have (on average 1.5016077170418007) internal successors, (467), 378 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 467 transitions. [2025-03-17 11:57:38,945 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 467 transitions. Word has length 53 [2025-03-17 11:57:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 467 transitions. [2025-03-17 11:57:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 467 transitions. [2025-03-17 11:57:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:57:38,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:38,946 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:57:38,947 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 507939205, now seen corresponding path program 1 times [2025-03-17 11:57:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585154076] [2025-03-17 11:57:38,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:38,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:38,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:38,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:38,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585154076] [2025-03-17 11:57:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585154076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:39,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 11:57:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980216573] [2025-03-17 11:57:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:39,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:57:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:39,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:57:39,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:39,382 INFO L87 Difference]: Start difference. First operand 379 states and 467 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:40,278 INFO L93 Difference]: Finished difference Result 420 states and 509 transitions. [2025-03-17 11:57:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:57:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-17 11:57:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:40,279 INFO L225 Difference]: With dead ends: 420 [2025-03-17 11:57:40,280 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 11:57:40,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:57:40,281 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 151 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 2152 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:57:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 11:57:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 379. [2025-03-17 11:57:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 311 states have (on average 1.4983922829581993) internal successors, (466), 378 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 466 transitions. [2025-03-17 11:57:40,286 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 466 transitions. Word has length 53 [2025-03-17 11:57:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:40,286 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 466 transitions. [2025-03-17 11:57:40,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 466 transitions. [2025-03-17 11:57:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:57:40,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:40,289 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:40,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:57:40,290 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 507939206, now seen corresponding path program 1 times [2025-03-17 11:57:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369616055] [2025-03-17 11:57:40,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:40,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:40,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:40,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:40,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:57:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369616055] [2025-03-17 11:57:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369616055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 11:57:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816328713] [2025-03-17 11:57:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:40,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:57:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:40,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:57:40,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:57:40,989 INFO L87 Difference]: Start difference. First operand 379 states and 466 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:41,896 INFO L93 Difference]: Finished difference Result 436 states and 511 transitions. [2025-03-17 11:57:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:57:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-17 11:57:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:41,898 INFO L225 Difference]: With dead ends: 436 [2025-03-17 11:57:41,898 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 11:57:41,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:57:41,898 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 270 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:41,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1689 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:57:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 11:57:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 379. [2025-03-17 11:57:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 311 states have (on average 1.495176848874598) internal successors, (465), 378 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 465 transitions. [2025-03-17 11:57:41,904 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 465 transitions. Word has length 53 [2025-03-17 11:57:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 465 transitions. [2025-03-17 11:57:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 465 transitions. [2025-03-17 11:57:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:57:41,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:41,905 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2025-03-17 11:57:41,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:57:41,906 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2040845653, now seen corresponding path program 1 times [2025-03-17 11:57:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023751488] [2025-03-17 11:57:41,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023751488] [2025-03-17 11:57:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023751488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761486334] [2025-03-17 11:57:43,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:43,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:43,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:57:43,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:43,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:43,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-17 11:57:43,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:43,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:57:43,706 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:57:43,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 11:57:43,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:57:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 11:57:43,796 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-17 11:57:43,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-03-17 11:57:43,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-17 11:57:43,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-17 11:57:43,908 INFO L349 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2025-03-17 11:57:43,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2025-03-17 11:57:43,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2025-03-17 11:57:44,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 53 [2025-03-17 11:57:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:57:44,238 INFO L349 Elim1Store]: treesize reduction 140, result has 22.7 percent of original size [2025-03-17 11:57:44,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 58 [2025-03-17 11:57:44,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:44,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:44,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 182 [2025-03-17 11:57:44,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 189 [2025-03-17 11:57:44,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 176 [2025-03-17 11:57:44,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 172 [2025-03-17 11:57:45,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2025-03-17 11:57:45,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 162 [2025-03-17 11:57:45,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 113 [2025-03-17 11:57:45,444 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2025-03-17 11:57:45,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 52 [2025-03-17 11:57:45,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:45,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-17 11:57:45,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:57:45,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:45,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 30 [2025-03-17 11:57:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:45,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:48,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:48,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2025-03-17 11:57:48,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:48,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 124 [2025-03-17 11:57:48,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-03-17 11:57:48,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2025-03-17 11:57:48,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:48,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 500 treesize of output 496 [2025-03-17 11:57:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761486334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:50,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:50,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 76 [2025-03-17 11:57:50,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545259310] [2025-03-17 11:57:50,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-17 11:57:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-17 11:57:50,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5542, Unknown=4, NotChecked=0, Total=5852 [2025-03-17 11:57:50,216 INFO L87 Difference]: Start difference. First operand 379 states and 465 transitions. Second operand has 77 states, 76 states have (on average 1.986842105263158) internal successors, (151), 77 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:57,756 INFO L93 Difference]: Finished difference Result 408 states and 498 transitions. [2025-03-17 11:57:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 11:57:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.986842105263158) internal successors, (151), 77 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-17 11:57:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:57,766 INFO L225 Difference]: With dead ends: 408 [2025-03-17 11:57:57,767 INFO L226 Difference]: Without dead ends: 408 [2025-03-17 11:57:57,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=887, Invalid=9615, Unknown=4, NotChecked=0, Total=10506 [2025-03-17 11:57:57,779 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 610 mSDsluCounter, 5880 mSDsCounter, 0 mSdLazyCounter, 6563 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 6610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:57,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 6099 Invalid, 6610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6563 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 11:57:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-17 11:57:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 384. [2025-03-17 11:57:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 316 states have (on average 1.4936708860759493) internal successors, (472), 383 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 472 transitions. [2025-03-17 11:57:57,805 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 472 transitions. Word has length 53 [2025-03-17 11:57:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 472 transitions. [2025-03-17 11:57:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.986842105263158) internal successors, (151), 77 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 472 transitions. [2025-03-17 11:57:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:57:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:57,806 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2025-03-17 11:57:57,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:57:58,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:58,012 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-17 11:57:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2040845654, now seen corresponding path program 1 times [2025-03-17 11:57:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043545855] [2025-03-17 11:57:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:58,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:57:58,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:57:58,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:58,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043545855] [2025-03-17 11:58:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043545855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117411197] [2025-03-17 11:58:02,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:02,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:02,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:02,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:58:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:58:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:58:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:02,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-17 11:58:02,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:02,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:02,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:02,378 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:58:02,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:58:02,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 11:58:02,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:58:02,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:02,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2025-03-17 11:58:02,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 11:58:02,660 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 11:58:02,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 11:58:02,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:58:02,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2025-03-17 11:58:02,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:58:02,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:58:02,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2025-03-17 11:58:02,887 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 11:58:02,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-17 11:58:02,909 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 11:58:02,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 11:58:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:58:03,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2025-03-17 11:58:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 11:58:03,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 59 [2025-03-17 11:58:03,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:03,374 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:58:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-03-17 11:58:03,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:03,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 210 [2025-03-17 11:58:03,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 209 [2025-03-17 11:58:04,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 204 [2025-03-17 11:58:04,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 192 [2025-03-17 11:58:04,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 220 [2025-03-17 11:58:04,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 155 [2025-03-17 11:58:05,569 INFO L349 Elim1Store]: treesize reduction 108, result has 62.6 percent of original size [2025-03-17 11:58:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 326 [2025-03-17 11:58:05,700 INFO L349 Elim1Store]: treesize reduction 68, result has 57.8 percent of original size [2025-03-17 11:58:05,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 200