./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:16:29,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:16:29,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:16:29,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:16:29,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:16:29,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:16:29,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:16:29,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:16:29,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:16:29,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:16:29,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:16:29,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:16:29,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:16:29,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:16:29,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:16:29,282 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:16:29,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:29,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:29,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:29,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:16:29,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:16:29,285 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 [2025-01-09 22:16:29,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:16:29,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:16:29,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:16:29,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:16:29,537 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:16:29,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2025-01-09 22:16:30,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a18a19/1214d6adbcc74732b2dd0df4897667f3/FLAG9a8d94b78 [2025-01-09 22:16:30,978 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:16:30,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2025-01-09 22:16:30,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a18a19/1214d6adbcc74732b2dd0df4897667f3/FLAG9a8d94b78 [2025-01-09 22:16:31,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8a18a19/1214d6adbcc74732b2dd0df4897667f3 [2025-01-09 22:16:31,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:16:31,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:16:31,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:31,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:16:31,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:16:31,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4694f7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31, skipping insertion in model container [2025-01-09 22:16:31,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:16:31,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:31,510 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:16:31,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:16:31,572 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:16:31,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31 WrapperNode [2025-01-09 22:16:31,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:16:31,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:31,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:16:31,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:16:31,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,608 INFO L138 Inliner]: procedures = 124, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2025-01-09 22:16:31,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:16:31,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:16:31,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:16:31,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:16:31,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,638 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-01-09 22:16:31,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:16:31,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:16:31,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:16:31,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:16:31,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (1/1) ... [2025-01-09 22:16:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:16:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:31,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:16:31,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:16:31,694 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 22:16:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:16:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:16:31,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:16:31,786 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:16:31,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:16:31,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 22:16:32,036 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-01-09 22:16:32,036 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:16:32,044 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:16:32,044 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 22:16:32,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:32 BoogieIcfgContainer [2025-01-09 22:16:32,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:16:32,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:16:32,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:16:32,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:16:32,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:16:31" (1/3) ... [2025-01-09 22:16:32,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8d2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:32, skipping insertion in model container [2025-01-09 22:16:32,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:16:31" (2/3) ... [2025-01-09 22:16:32,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8d2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:16:32, skipping insertion in model container [2025-01-09 22:16:32,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:16:32" (3/3) ... [2025-01-09 22:16:32,052 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1.i [2025-01-09 22:16:32,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:16:32,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext_flag_1.i that has 2 procedures, 96 locations, 1 initial locations, 3 loop locations, and 40 error locations. [2025-01-09 22:16:32,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:16:32,118 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;@1b0d4272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:16:32,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 22:16:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 93 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:16:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:16:32,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517960, now seen corresponding path program 1 times [2025-01-09 22:16:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563186259] [2025-01-09 22:16:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:16:32,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:16:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563186259] [2025-01-09 22:16:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563186259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:16:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562725227] [2025-01-09 22:16:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:16:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:16:32,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:16:32,255 INFO L87 Difference]: Start difference. First operand has 95 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 93 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-01-09 22:16:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:32,266 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2025-01-09 22:16:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:16:32,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-01-09 22:16:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:32,273 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:16:32,273 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 22:16:32,275 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-01-09 22:16:32,277 INFO L435 NwaCegarLoop]: 103 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, 103 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-01-09 22:16:32,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:16:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 22:16:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 22:16:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 87 states have internal predecessors, (95), 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-01-09 22:16:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-01-09 22:16:32,305 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 6 [2025-01-09 22:16:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:32,306 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-01-09 22:16:32,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-01-09 22:16:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-01-09 22:16:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:16:32,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:16:32,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 620841041, now seen corresponding path program 1 times [2025-01-09 22:16:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465905501] [2025-01-09 22:16:32,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:16:32,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:16:32,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465905501] [2025-01-09 22:16:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465905501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858311485] [2025-01-09 22:16:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:32,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:32,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:32,413 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-01-09 22:16:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:32,552 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2025-01-09 22:16:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:32,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-01-09 22:16:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:32,553 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:16:32,553 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 22:16:32,554 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-01-09 22:16:32,554 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:32,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 55 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 22:16:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-01-09 22:16:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 81 states have internal predecessors, (95), 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-01-09 22:16:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2025-01-09 22:16:32,559 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 8 [2025-01-09 22:16:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:32,559 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2025-01-09 22:16:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-01-09 22:16:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2025-01-09 22:16:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:16:32,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:16:32,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:32,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash 620841042, now seen corresponding path program 1 times [2025-01-09 22:16:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955082634] [2025-01-09 22:16:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:16:32,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:16:32,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955082634] [2025-01-09 22:16:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955082634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231219555] [2025-01-09 22:16:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:32,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:32,703 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-01-09 22:16:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:32,848 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2025-01-09 22:16:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:32,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-01-09 22:16:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:32,850 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:16:32,850 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:16:32,850 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-01-09 22:16:32,852 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 122 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:32,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:16:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-01-09 22:16:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5125) internal successors, (121), 105 states have internal predecessors, (121), 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-01-09 22:16:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2025-01-09 22:16:32,861 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 8 [2025-01-09 22:16:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:32,861 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2025-01-09 22:16:32,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-01-09 22:16:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2025-01-09 22:16:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:16:32,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:32,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:32,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:16:32,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:32,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 747438435, now seen corresponding path program 1 times [2025-01-09 22:16:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66774205] [2025-01-09 22:16:32,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:32,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:16:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:16:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:32,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66774205] [2025-01-09 22:16:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66774205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:32,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:16:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031599985] [2025-01-09 22:16:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:32,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:32,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:32,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:32,961 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-09 22:16:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,068 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-01-09 22:16:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:16:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-09 22:16:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,071 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:16:33,071 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:16:33,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:33,072 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 214 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-01-09 22:16:33,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 214 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:16:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2025-01-09 22:16:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 106 states have internal predecessors, (122), 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-01-09 22:16:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2025-01-09 22:16:33,079 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 17 [2025-01-09 22:16:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,079 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2025-01-09 22:16:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-01-09 22:16:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2025-01-09 22:16:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:16:33,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:16:33,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1696711945, now seen corresponding path program 1 times [2025-01-09 22:16:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202245088] [2025-01-09 22:16:33,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:16:33,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:16:33,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:33,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202245088] [2025-01-09 22:16:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202245088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:33,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:16:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084058326] [2025-01-09 22:16:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:33,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:16:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:33,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:16:33,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:16:33,154 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-01-09 22:16:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,231 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-01-09 22:16:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:16:33,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-01-09 22:16:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,233 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:16:33,233 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:16:33,233 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-01-09 22:16:33,233 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 97 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:16:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2025-01-09 22:16:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 108 states have internal predecessors, (124), 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-01-09 22:16:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2025-01-09 22:16:33,239 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 18 [2025-01-09 22:16:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2025-01-09 22:16:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-01-09 22:16:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2025-01-09 22:16:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:33,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:16:33,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1475384224, now seen corresponding path program 1 times [2025-01-09 22:16:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765202603] [2025-01-09 22:16:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:33,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:33,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765202603] [2025-01-09 22:16:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765202603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030632867] [2025-01-09 22:16:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:33,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:33,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:33,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:33,463 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 22:16:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,622 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2025-01-09 22:16:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:33,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,624 INFO L225 Difference]: With dead ends: 179 [2025-01-09 22:16:33,624 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 22:16:33,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:16:33,625 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 121 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 256 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 22:16:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 116. [2025-01-09 22:16:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 115 states have internal predecessors, (133), 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-01-09 22:16:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2025-01-09 22:16:33,639 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 19 [2025-01-09 22:16:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,639 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2025-01-09 22:16:33,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 22:16:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2025-01-09 22:16:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:16:33,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:33,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:16:33,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1475397034, now seen corresponding path program 1 times [2025-01-09 22:16:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647352171] [2025-01-09 22:16:33,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:16:33,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:16:33,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647352171] [2025-01-09 22:16:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647352171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:33,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:33,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289507268] [2025-01-09 22:16:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:33,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:33,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:33,808 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 22:16:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:33,940 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2025-01-09 22:16:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2025-01-09 22:16:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:33,941 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:16:33,941 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:16:33,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:33,942 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:33,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 230 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:16:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2025-01-09 22:16:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 111 states have internal predecessors, (127), 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-01-09 22:16:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2025-01-09 22:16:33,947 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 19 [2025-01-09 22:16:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:33,948 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2025-01-09 22:16:33,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-01-09 22:16:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2025-01-09 22:16:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:16:33,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:33,948 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] [2025-01-09 22:16:33,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:16:33,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1547387273, now seen corresponding path program 1 times [2025-01-09 22:16:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007338006] [2025-01-09 22:16:33,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:33,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:16:33,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:16:33,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:33,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:34,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007338006] [2025-01-09 22:16:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007338006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:34,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:16:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365072765] [2025-01-09 22:16:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:16:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:34,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:16:34,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:16:34,042 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-09 22:16:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:34,130 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2025-01-09 22:16:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:16:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2025-01-09 22:16:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:34,132 INFO L225 Difference]: With dead ends: 142 [2025-01-09 22:16:34,132 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:16:34,132 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-01-09 22:16:34,133 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:34,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 202 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:16:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2025-01-09 22:16:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 115 states have internal predecessors, (131), 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-01-09 22:16:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2025-01-09 22:16:34,136 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 20 [2025-01-09 22:16:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:34,136 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2025-01-09 22:16:34,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-09 22:16:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2025-01-09 22:16:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:16:34,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:34,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:34,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:16:34,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 915934990, now seen corresponding path program 1 times [2025-01-09 22:16:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595419866] [2025-01-09 22:16:34,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:34,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:34,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595419866] [2025-01-09 22:16:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595419866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102334996] [2025-01-09 22:16:34,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:34,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:34,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:34,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:34,241 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:34,384 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2025-01-09 22:16:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:16:34,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:34,385 INFO L225 Difference]: With dead ends: 118 [2025-01-09 22:16:34,385 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 22:16:34,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:34,386 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:34,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 173 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 22:16:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-01-09 22:16:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 113 states have internal predecessors, (129), 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-01-09 22:16:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2025-01-09 22:16:34,392 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 22 [2025-01-09 22:16:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:34,392 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2025-01-09 22:16:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2025-01-09 22:16:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:16:34,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:34,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:16:34,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 915934991, now seen corresponding path program 1 times [2025-01-09 22:16:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158159106] [2025-01-09 22:16:34,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:34,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:34,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:34,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:34,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158159106] [2025-01-09 22:16:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158159106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:34,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:34,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:16:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104668791] [2025-01-09 22:16:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:34,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:34,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:34,586 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:34,718 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2025-01-09 22:16:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:34,719 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:16:34,720 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:16:34,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:34,720 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 13 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:34,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 237 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:16:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2025-01-09 22:16:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 94 states have internal predecessors, (109), 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-01-09 22:16:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-01-09 22:16:34,723 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 22 [2025-01-09 22:16:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:34,723 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-01-09 22:16:34,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-01-09 22:16:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-01-09 22:16:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:16:34,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:34,724 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-01-09 22:16:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:16:34,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:34,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1126255546, now seen corresponding path program 1 times [2025-01-09 22:16:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674330099] [2025-01-09 22:16:34,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:34,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:16:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:16:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674330099] [2025-01-09 22:16:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674330099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:34,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:16:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297701242] [2025-01-09 22:16:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:34,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:16:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:34,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:16:34,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:16:34,938 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-01-09 22:16:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:35,055 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2025-01-09 22:16:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:16:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-01-09 22:16:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:35,056 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:16:35,056 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:16:35,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:16:35,057 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 82 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:35,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 210 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:16:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2025-01-09 22:16:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 85 states have internal predecessors, (99), 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-01-09 22:16:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2025-01-09 22:16:35,059 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 22 [2025-01-09 22:16:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2025-01-09 22:16:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-01-09 22:16:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2025-01-09 22:16:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:16:35,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:35,060 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:16:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:16:35,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -255328893, now seen corresponding path program 1 times [2025-01-09 22:16:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558145438] [2025-01-09 22:16:35,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:35,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:35,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:35,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:35,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558145438] [2025-01-09 22:16:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558145438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503037563] [2025-01-09 22:16:35,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:35,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:35,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:35,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:35,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:16:35,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:35,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:35,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:35,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:16:35,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:35,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:16:35,562 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:16:35,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:16:35,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:16:35,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:16:35,605 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-01-09 22:16:35,617 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 20 treesize of output 8 [2025-01-09 22:16:35,643 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-01-09 22:16:35,651 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-01-09 22:16:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:35,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:35,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:35,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2025-01-09 22:16:35,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:35,910 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 33 treesize of output 36 [2025-01-09 22:16:35,915 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 20 treesize of output 18 [2025-01-09 22:16:36,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:36,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-01-09 22:16:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503037563] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:36,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-01-09 22:16:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799453942] [2025-01-09 22:16:36,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:16:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:36,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:16:36,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=335, Unknown=15, NotChecked=0, Total=420 [2025-01-09 22:16:36,118 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 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-01-09 22:16:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:36,587 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2025-01-09 22:16:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:16:36,587 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 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-01-09 22:16:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:36,588 INFO L225 Difference]: With dead ends: 183 [2025-01-09 22:16:36,588 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 22:16:36,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=590, Unknown=15, NotChecked=0, Total=756 [2025-01-09 22:16:36,589 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 153 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:36,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 679 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:16:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 22:16:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2025-01-09 22:16:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 108 states have internal predecessors, (127), 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-01-09 22:16:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2025-01-09 22:16:36,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 33 [2025-01-09 22:16:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2025-01-09 22:16:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 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-01-09 22:16:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2025-01-09 22:16:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:16:36,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:36,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:16:36,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:16:36,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:16:36,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -255341703, now seen corresponding path program 1 times [2025-01-09 22:16:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116436438] [2025-01-09 22:16:36,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:36,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:36,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:36,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116436438] [2025-01-09 22:16:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116436438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790129926] [2025-01-09 22:16:37,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:37,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:37,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:37,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:37,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:16:37,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:37,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:37,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:37,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:37,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:16:37,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:37,308 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-01-09 22:16:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:16:37,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-01-09 22:16:37,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:16:37,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:16:37,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:16:37,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:16:37,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:16:37,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-01-09 22:16:37,525 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 20 treesize of output 8 [2025-01-09 22:16:37,581 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-01-09 22:16:37,590 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-01-09 22:16:37,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:37,631 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 27 treesize of output 11 [2025-01-09 22:16:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:37,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:37,681 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2025-01-09 22:16:37,695 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2025-01-09 22:16:37,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:37,954 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 3 case distinctions, treesize of input 31 treesize of output 42 [2025-01-09 22:16:37,979 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-01-09 22:16:37,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 46 [2025-01-09 22:16:37,984 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 22 treesize of output 18 [2025-01-09 22:16:37,993 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:16:37,993 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 13 treesize of output 12 [2025-01-09 22:16:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-09 22:16:38,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790129926] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:38,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:38,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-01-09 22:16:38,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194215912] [2025-01-09 22:16:38,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:38,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:16:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:38,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:16:38,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1001, Unknown=10, NotChecked=134, Total=1332 [2025-01-09 22:16:38,054 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 37 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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-01-09 22:16:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:38,692 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2025-01-09 22:16:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:16:38,693 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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-01-09 22:16:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:38,693 INFO L225 Difference]: With dead ends: 173 [2025-01-09 22:16:38,693 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 22:16:38,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=1553, Unknown=10, NotChecked=170, Total=2070 [2025-01-09 22:16:38,695 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 406 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:38,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 642 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 659 Invalid, 0 Unknown, 337 Unchecked, 0.4s Time] [2025-01-09 22:16:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 22:16:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 107. [2025-01-09 22:16:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 106 states have internal predecessors, (124), 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-01-09 22:16:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-01-09 22:16:38,698 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 33 [2025-01-09 22:16:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:38,698 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-01-09 22:16:38,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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-01-09 22:16:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2025-01-09 22:16:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:16:38,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:38,698 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:16:38,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:16:38,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:38,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -551166333, now seen corresponding path program 1 times [2025-01-09 22:16:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19930666] [2025-01-09 22:16:38,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:38,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:38,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:38,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:38,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19930666] [2025-01-09 22:16:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19930666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863934241] [2025-01-09 22:16:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:39,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:39,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:16:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:39,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:39,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:39,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:39,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:16:39,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:39,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:16:39,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:16:39,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:16:39,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:16:39,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:16:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:16:39,282 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 20 treesize of output 8 [2025-01-09 22:16:39,296 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-01-09 22:16:39,300 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-01-09 22:16:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:39,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:39,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2025-01-09 22:16:39,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_362) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2025-01-09 22:16:39,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:39,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-01-09 22:16:39,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:39,412 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 30 treesize of output 33 [2025-01-09 22:16:39,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:16:39,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:39,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-01-09 22:16:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863934241] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:16:39,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:16:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-01-09 22:16:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876850353] [2025-01-09 22:16:39,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:39,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:16:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:39,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:16:39,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=8, NotChecked=58, Total=306 [2025-01-09 22:16:39,558 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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-01-09 22:16:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:39,854 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2025-01-09 22:16:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:16:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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-01-09 22:16:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:39,856 INFO L225 Difference]: With dead ends: 176 [2025-01-09 22:16:39,856 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 22:16:39,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=8, NotChecked=78, Total=506 [2025-01-09 22:16:39,857 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 168 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:39,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 521 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 431 Invalid, 0 Unknown, 296 Unchecked, 0.2s Time] [2025-01-09 22:16:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 22:16:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2025-01-09 22:16:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 108 states have internal predecessors, (126), 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-01-09 22:16:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2025-01-09 22:16:39,859 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 33 [2025-01-09 22:16:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2025-01-09 22:16:39,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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-01-09 22:16:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2025-01-09 22:16:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:16:39,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:39,861 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:16:39,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:16:40,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,066 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-09 22:16:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -551153523, now seen corresponding path program 1 times [2025-01-09 22:16:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747283833] [2025-01-09 22:16:40,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:40,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:40,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:40,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:40,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747283833] [2025-01-09 22:16:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747283833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671035957] [2025-01-09 22:16:40,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:40,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:40,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:40,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:16:40,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:16:40,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:16:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:40,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:16:40,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:40,487 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:16:40,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:16:40,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:16:40,609 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:16:40,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-01-09 22:16:40,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:16:40,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:16:40,687 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 31 treesize of output 13 [2025-01-09 22:16:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:16:40,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:40,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2025-01-09 22:16:40,795 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2025-01-09 22:16:40,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:40,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:16:40,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:40,826 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 40 treesize of output 39 [2025-01-09 22:16:40,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 22:16:41,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:16:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748