./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-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/forester-heap/sll-rb-sentinel-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 b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:37:19,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:37:19,775 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:37:19,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:37:19,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:37:19,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:37:19,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:37:19,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:37:19,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:37:19,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:37:19,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:37:19,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:37:19,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:37:19,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:37:19,810 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:37:19,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:37:19,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:37:19,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:19,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:19,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:37:19,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:37:19,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:37:19,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:37:19,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:37:19,813 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 -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2025-01-09 22:37:20,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:37:20,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:37:20,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:37:20,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:37:20,041 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:37:20,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2025-01-09 22:37:21,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463d8a851/2e863b48f9e7425ea27d58d93a42840f/FLAG187ff22c9 [2025-01-09 22:37:21,465 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:37:21,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2025-01-09 22:37:21,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463d8a851/2e863b48f9e7425ea27d58d93a42840f/FLAG187ff22c9 [2025-01-09 22:37:21,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463d8a851/2e863b48f9e7425ea27d58d93a42840f [2025-01-09 22:37:21,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:37:21,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:37:21,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:37:21,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:37:21,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:37:21,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:37:21" (1/1) ... [2025-01-09 22:37:21,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdb9298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:21, skipping insertion in model container [2025-01-09 22:37:21,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:37:21" (1/1) ... [2025-01-09 22:37:21,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:37:22,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:37:22,019 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:37:22,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:37:22,082 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:37:22,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22 WrapperNode [2025-01-09 22:37:22,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:37:22,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:37:22,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:37:22,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:37:22,090 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:37:22" (1/1) ... [2025-01-09 22:37:22,099 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:37:22" (1/1) ... [2025-01-09 22:37:22,116 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2025-01-09 22:37:22,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:37:22,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:37:22,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:37:22,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:37:22,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,141 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-01-09 22:37:22,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:37:22,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:37:22,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:37:22,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:37:22,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (1/1) ... [2025-01-09 22:37:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:37:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:22,179 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:37:22,181 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:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:37:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:37:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:37:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:37:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:37:22,298 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:37:22,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:37:22,626 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 22:37:22,627 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:37:22,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:37:22,637 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 22:37:22,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:37:22 BoogieIcfgContainer [2025-01-09 22:37:22,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:37:22,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:37:22,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:37:22,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:37:22,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:37:21" (1/3) ... [2025-01-09 22:37:22,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8167ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:37:22, skipping insertion in model container [2025-01-09 22:37:22,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:37:22" (2/3) ... [2025-01-09 22:37:22,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8167ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:37:22, skipping insertion in model container [2025-01-09 22:37:22,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:37:22" (3/3) ... [2025-01-09 22:37:22,644 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2025-01-09 22:37:22,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:37:22,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-rb-sentinel-1.i that has 2 procedures, 139 locations, 1 initial locations, 7 loop locations, and 58 error locations. [2025-01-09 22:37:22,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:37:22,693 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;@354fa5de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:37:22,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-09 22:37:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 75 states have (on average 2.04) internal successors, (153), 133 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:37:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:37:22,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:22,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:37:22,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2025-01-09 22:37:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478149918] [2025-01-09 22:37:22,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:22,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:37:22,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:37:22,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:22,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:22,835 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:37:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478149918] [2025-01-09 22:37:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478149918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450027613] [2025-01-09 22:37:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:22,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:22,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:22,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:22,857 INFO L87 Difference]: Start difference. First operand has 139 states, 75 states have (on average 2.04) internal successors, (153), 133 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:22,977 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2025-01-09 22:37:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-01-09 22:37:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:22,985 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:37:22,986 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 22:37:22,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:22,990 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 108 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:22,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 105 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 22:37:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2025-01-09 22:37:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.917808219178082) internal successors, (140), 131 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-01-09 22:37:23,050 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 3 [2025-01-09 22:37:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-01-09 22:37:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-01-09 22:37:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:37:23,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:37:23,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:37:23,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:23,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2025-01-09 22:37:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612830988] [2025-01-09 22:37:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:37:23,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:37:23,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:23,144 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:37:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612830988] [2025-01-09 22:37:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612830988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:23,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:23,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601601450] [2025-01-09 22:37:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:23,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:23,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:23,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,147 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:23,240 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-01-09 22:37:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-01-09 22:37:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:23,241 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:37:23,241 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:37:23,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,242 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:23,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:37:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 22:37:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 73 states have (on average 1.8630136986301369) internal successors, (136), 128 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-01-09 22:37:23,251 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 3 [2025-01-09 22:37:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-01-09 22:37:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:37:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-01-09 22:37:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:37:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:37:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:37:23,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1155697256, now seen corresponding path program 1 times [2025-01-09 22:37:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868278166] [2025-01-09 22:37:23,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:37:23,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:37:23,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:23,317 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:37:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868278166] [2025-01-09 22:37:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868278166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838180197] [2025-01-09 22:37:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:23,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:23,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,319 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:23,413 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2025-01-09 22:37:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:23,414 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:37:23,415 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:37:23,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,415 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 88 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:23,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 88 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:37:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-09 22:37:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 123 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2025-01-09 22:37:23,424 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 6 [2025-01-09 22:37:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,424 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2025-01-09 22:37:23,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2025-01-09 22:37:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:37:23,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:37:23,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:37:23,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1155697257, now seen corresponding path program 1 times [2025-01-09 22:37:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35201546] [2025-01-09 22:37:23,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:37:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:37:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:23,505 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:37:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35201546] [2025-01-09 22:37:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35201546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801275023] [2025-01-09 22:37:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:23,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:23,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,508 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:23,589 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2025-01-09 22:37:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:23,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:23,590 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:37:23,590 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:37:23,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:23,591 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 82 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:23,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 104 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:37:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 22:37:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 81 states have (on average 1.691358024691358) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-01-09 22:37:23,596 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 6 [2025-01-09 22:37:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,596 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-01-09 22:37:23,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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:37:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-01-09 22:37:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:37:23,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:23,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:37:23,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 518878671, now seen corresponding path program 1 times [2025-01-09 22:37:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672305469] [2025-01-09 22:37:23,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:37:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:37:23,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:23,738 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:37:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672305469] [2025-01-09 22:37:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672305469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:37:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571902975] [2025-01-09 22:37:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:23,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:23,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:37:23,741 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:23,911 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2025-01-09 22:37:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:23,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 22:37:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:23,913 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:37:23,913 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:37:23,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:23,914 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 109 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:23,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 81 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:37:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:37:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 22:37:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 83 states have (on average 1.5662650602409638) internal successors, (130), 119 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2025-01-09 22:37:23,921 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 12 [2025-01-09 22:37:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:23,921 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2025-01-09 22:37:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2025-01-09 22:37:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:37:23,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:23,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:23,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:37:23,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 518878672, now seen corresponding path program 1 times [2025-01-09 22:37:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334540145] [2025-01-09 22:37:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:23,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:37:23,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:37:23,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:23,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,025 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:37:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334540145] [2025-01-09 22:37:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334540145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:37:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033194983] [2025-01-09 22:37:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:37:24,026 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:24,147 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2025-01-09 22:37:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:37:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 22:37:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:24,148 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:37:24,148 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:37:24,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:24,149 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:24,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 121 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:37:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-01-09 22:37:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-01-09 22:37:24,157 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 12 [2025-01-09 22:37:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:24,157 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-01-09 22:37:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-01-09 22:37:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:37:24,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:24,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:24,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:37:24,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 425791069, now seen corresponding path program 1 times [2025-01-09 22:37:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:24,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146620090] [2025-01-09 22:37:24,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:24,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:37:24,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:37:24,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:24,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,213 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:37:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146620090] [2025-01-09 22:37:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146620090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455720636] [2025-01-09 22:37:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:37:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:24,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:37:24,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:37:24,214 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:24,369 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2025-01-09 22:37:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:24,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:37:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:24,371 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:37:24,371 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:37:24,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:37:24,372 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 219 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:24,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 141 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:37:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 131. [2025-01-09 22:37:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 129 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2025-01-09 22:37:24,376 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 15 [2025-01-09 22:37:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:24,376 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2025-01-09 22:37:24,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2025-01-09 22:37:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:37:24,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:24,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:24,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:37:24,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:24,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1553247505, now seen corresponding path program 1 times [2025-01-09 22:37:24,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:24,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667479746] [2025-01-09 22:37:24,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:37:24,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:37:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,466 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:37:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667479746] [2025-01-09 22:37:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667479746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887951642] [2025-01-09 22:37:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:24,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:24,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:24,468 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:37:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:24,617 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2025-01-09 22:37:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:37:24,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2025-01-09 22:37:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:24,620 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:37:24,620 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:37:24,620 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:37:24,620 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 28 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:24,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 277 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:37:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-01-09 22:37:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 128 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2025-01-09 22:37:24,627 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 16 [2025-01-09 22:37:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:24,627 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2025-01-09 22:37:24,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:37:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2025-01-09 22:37:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:37:24,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:24,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:37:24,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:24,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1553247506, now seen corresponding path program 1 times [2025-01-09 22:37:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257989227] [2025-01-09 22:37:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:24,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:37:24,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:37:24,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:24,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:24,788 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:37:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257989227] [2025-01-09 22:37:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257989227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526186782] [2025-01-09 22:37:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:24,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:24,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:24,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:24,791 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:37:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:24,934 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2025-01-09 22:37:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:37:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2025-01-09 22:37:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:24,934 INFO L225 Difference]: With dead ends: 132 [2025-01-09 22:37:24,934 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 22:37:24,935 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:37:24,935 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 14 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:24,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 326 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 22:37:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2025-01-09 22:37:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 123 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2025-01-09 22:37:24,937 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 16 [2025-01-09 22:37:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:24,938 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2025-01-09 22:37:24,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:37:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2025-01-09 22:37:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:37:24,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:24,938 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:37:24,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:37:24,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1167247561, now seen corresponding path program 1 times [2025-01-09 22:37:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-01-09 22:37:24,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:24,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:37:24,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:37:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:25,087 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:37:25,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:25,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-01-09 22:37:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551444715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:37:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552738006] [2025-01-09 22:37:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:37:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:25,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:37:25,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:37:25,088 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:25,256 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2025-01-09 22:37:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:37:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:37:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:25,257 INFO L225 Difference]: With dead ends: 173 [2025-01-09 22:37:25,257 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 22:37:25,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:37:25,257 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 327 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:25,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 261 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 22:37:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2025-01-09 22:37:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 130 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2025-01-09 22:37:25,261 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 18 [2025-01-09 22:37:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:25,261 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2025-01-09 22:37:25,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2025-01-09 22:37:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:37:25,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:25,263 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:25,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:37:25,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash -654824176, now seen corresponding path program 1 times [2025-01-09 22:37:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563011632] [2025-01-09 22:37:25,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:25,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:37:25,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:37:25,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:25,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563011632] [2025-01-09 22:37:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563011632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069413460] [2025-01-09 22:37:25,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:25,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:25,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:25,436 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:37:25,437 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:37:25,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:37:25,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:37:25,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:25,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:37:25,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:25,572 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:37:25,578 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:37:25,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:37:25,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:37:25,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:37:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:25,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:26,067 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 10 treesize of output 8 [2025-01-09 22:37:26,072 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 14 treesize of output 12 [2025-01-09 22:37:26,078 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 10 treesize of output 8 [2025-01-09 22:37:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069413460] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:26,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2025-01-09 22:37:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106015991] [2025-01-09 22:37:26,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:37:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:26,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:37:26,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:37:26,093 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:26,441 INFO L93 Difference]: Finished difference Result 171 states and 191 transitions. [2025-01-09 22:37:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:37:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:37:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:26,442 INFO L225 Difference]: With dead ends: 171 [2025-01-09 22:37:26,442 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 22:37:26,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:37:26,443 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 320 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:26,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 492 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:37:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 22:37:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 139. [2025-01-09 22:37:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.385321100917431) internal successors, (151), 137 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-01-09 22:37:26,446 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 23 [2025-01-09 22:37:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:26,446 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-01-09 22:37:26,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-01-09 22:37:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:37:26,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:26,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:26,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:37:26,653 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,SelfDestructingSolverStorable10 [2025-01-09 22:37:26,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash -245604390, now seen corresponding path program 1 times [2025-01-09 22:37:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578281821] [2025-01-09 22:37:26,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:26,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:37:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:37:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:26,696 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:37:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:26,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578281821] [2025-01-09 22:37:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578281821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:26,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839408061] [2025-01-09 22:37:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:37:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:37:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:37:26,697 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:26,782 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-01-09 22:37:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:37:26,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 22:37:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:26,784 INFO L225 Difference]: With dead ends: 142 [2025-01-09 22:37:26,784 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 22:37:26,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:26,784 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:26,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 311 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 22:37:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-01-09 22:37:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 136 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2025-01-09 22:37:26,789 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 24 [2025-01-09 22:37:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:26,789 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2025-01-09 22:37:26,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2025-01-09 22:37:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:37:26,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:26,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:26,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:37:26,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 657148581, now seen corresponding path program 1 times [2025-01-09 22:37:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38957524] [2025-01-09 22:37:26,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:26,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:37:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:37:26,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:26,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:26,895 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:37:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38957524] [2025-01-09 22:37:26,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38957524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:26,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:26,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994055202] [2025-01-09 22:37:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:26,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:26,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:26,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:26,896 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:27,035 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2025-01-09 22:37:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:37:27,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 22:37:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:27,036 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:37:27,036 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:37:27,036 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:37:27,036 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:27,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 274 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:37:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-01-09 22:37:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 135 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2025-01-09 22:37:27,039 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 25 [2025-01-09 22:37:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:27,039 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2025-01-09 22:37:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2025-01-09 22:37:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:37:27,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:27,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:37:27,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 657148582, now seen corresponding path program 1 times [2025-01-09 22:37:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060340778] [2025-01-09 22:37:27,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:27,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:37:27,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:37:27,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:27,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:27,202 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:37:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060340778] [2025-01-09 22:37:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060340778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:37:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834650497] [2025-01-09 22:37:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:37:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:37:27,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:27,205 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:27,329 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2025-01-09 22:37:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:37:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 22:37:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:27,330 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:37:27,330 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:37:27,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:37:27,330 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:27,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 331 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:37:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:37:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2025-01-09 22:37:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2025-01-09 22:37:27,333 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 25 [2025-01-09 22:37:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:27,333 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2025-01-09 22:37:27,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2025-01-09 22:37:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:37:27,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:27,334 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:27,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:37:27,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:27,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1437565920, now seen corresponding path program 1 times [2025-01-09 22:37:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868431593] [2025-01-09 22:37:27,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:37:27,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:37:27,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:27,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868431593] [2025-01-09 22:37:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868431593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988682095] [2025-01-09 22:37:27,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:27,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:27,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:27,766 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:37:27,768 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:37:27,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:37:27,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:37:27,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:27,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:27,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:37:27,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:37:27,865 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:37:27,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:27,925 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:37:27,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:27,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:37:27,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:37:28,021 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:37:28,037 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:37:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:28,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:28,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2025-01-09 22:37:28,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array Int Int)) (v_ArrVal_529 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= v_ArrVal_527 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_527 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) is different from false [2025-01-09 22:37:28,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_527 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_8| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_59| Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_527) |v_ULTIMATE.start_main_#t~malloc4#1.base_8| v_ArrVal_529) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8|) 0)) (not (= v_ArrVal_527 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_59| (select v_ArrVal_527 |v_ULTIMATE.start_main_~end~0#1.offset_59|)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_59|))) is different from false [2025-01-09 22:37:28,255 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 40 treesize of output 38 [2025-01-09 22:37:28,258 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:28,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:28,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:37:28,266 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 8 treesize of output 4 [2025-01-09 22:37:28,268 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 7 treesize of output 3 [2025-01-09 22:37:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988682095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:28,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:28,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 32 [2025-01-09 22:37:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738992005] [2025-01-09 22:37:28,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:37:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:28,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:37:28,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=665, Unknown=16, NotChecked=168, Total=992 [2025-01-09 22:37:28,286 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:29,147 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2025-01-09 22:37:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:37:29,147 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:37:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:29,148 INFO L225 Difference]: With dead ends: 188 [2025-01-09 22:37:29,148 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 22:37:29,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1270, Unknown=16, NotChecked=240, Total=1892 [2025-01-09 22:37:29,149 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 395 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 48 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:29,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 678 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1043 Invalid, 2 Unknown, 518 Unchecked, 0.5s Time] [2025-01-09 22:37:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 22:37:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 143. [2025-01-09 22:37:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.305084745762712) internal successors, (154), 141 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2025-01-09 22:37:29,154 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 29 [2025-01-09 22:37:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2025-01-09 22:37:29,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2025-01-09 22:37:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:37:29,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:29,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:29,161 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:37:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:37:29,356 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:29,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 442970459, now seen corresponding path program 1 times [2025-01-09 22:37:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314396195] [2025-01-09 22:37:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:29,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:37:29,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:37:29,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:29,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314396195] [2025-01-09 22:37:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314396195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774222780] [2025-01-09 22:37:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:29,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:29,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:29,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:29,385 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:29,420 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2025-01-09 22:37:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 22:37:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:29,421 INFO L225 Difference]: With dead ends: 144 [2025-01-09 22:37:29,421 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 22:37:29,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:29,421 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:29,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 109 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:37:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 22:37:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-01-09 22:37:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 142 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-01-09 22:37:29,425 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2025-01-09 22:37:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-01-09 22:37:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-01-09 22:37:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:37:29,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:29,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:29,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:37:29,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 492856319, now seen corresponding path program 1 times [2025-01-09 22:37:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974979962] [2025-01-09 22:37:29,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:29,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:37:29,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:37:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974979962] [2025-01-09 22:37:29,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974979962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577586647] [2025-01-09 22:37:29,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:29,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:29,504 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:37:29,506 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:37:29,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:37:29,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:37:29,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:29,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:29,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:37:29,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:29,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:37:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:29,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:37:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577586647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:37:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-01-09 22:37:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330673820] [2025-01-09 22:37:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:37:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:29,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:37:29,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:37:29,619 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:29,662 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-01-09 22:37:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:37:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-01-09 22:37:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:29,664 INFO L225 Difference]: With dead ends: 152 [2025-01-09 22:37:29,664 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:37:29,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:37:29,664 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:29,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:37:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:37:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2025-01-09 22:37:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 145 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2025-01-09 22:37:29,668 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 31 [2025-01-09 22:37:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:29,668 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2025-01-09 22:37:29,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2025-01-09 22:37:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:37:29,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:29,670 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:29,676 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:37:29,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:29,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:29,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 781845140, now seen corresponding path program 1 times [2025-01-09 22:37:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225161764] [2025-01-09 22:37:29,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:29,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:37:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:37:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225161764] [2025-01-09 22:37:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225161764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23827000] [2025-01-09 22:37:30,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:30,022 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:37:30,023 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:37:30,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:37:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:37:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:30,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:30,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:37:30,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:30,102 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:37:30,106 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:37:30,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:37:30,121 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:37:30,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:37:30,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:37:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:30,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23827000] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:30,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2025-01-09 22:37:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890271586] [2025-01-09 22:37:30,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:37:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:30,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:37:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:37:30,305 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:30,570 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2025-01-09 22:37:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:37:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:37:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:30,571 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:37:30,571 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:37:30,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:37:30,571 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:30,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 392 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:37:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:37:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2025-01-09 22:37:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 156 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2025-01-09 22:37:30,577 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 32 [2025-01-09 22:37:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:30,577 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2025-01-09 22:37:30,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2025-01-09 22:37:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:37:30,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:30,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:30,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:37:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:37:30,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1532563562, now seen corresponding path program 1 times [2025-01-09 22:37:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403876973] [2025-01-09 22:37:30,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:30,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:37:30,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:37:30,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:30,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:37:30,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:30,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403876973] [2025-01-09 22:37:30,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403876973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:37:30,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:37:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:37:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521267402] [2025-01-09 22:37:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:37:30,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:37:30,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:30,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:37:30,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:30,807 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:37:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:30,836 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-01-09 22:37:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:37:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:37:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:30,837 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:37:30,837 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:37:30,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:37:30,837 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:30,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 79 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:37:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:37:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 22:37:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.263157894736842) internal successors, (168), 155 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-01-09 22:37:30,844 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 33 [2025-01-09 22:37:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:30,844 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-01-09 22:37:30,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:37:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-01-09 22:37:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:37:30,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:30,845 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, 1] [2025-01-09 22:37:30,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:37:30,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -364382183, now seen corresponding path program 1 times [2025-01-09 22:37:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723704510] [2025-01-09 22:37:30,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:30,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:37:30,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:37:30,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:30,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:31,101 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:37:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723704510] [2025-01-09 22:37:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723704510] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955574116] [2025-01-09 22:37:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:31,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:31,104 INFO L229 MonitoredProcess]: Starting monitored process 6 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:37:31,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:37:31,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:37:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:37:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:31,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:37:31,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:31,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:37:31,259 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:37:31,259 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:37:31,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:31,379 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:31,379 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 33 treesize of output 24 [2025-01-09 22:37:31,410 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:31,411 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 34 treesize of output 33 [2025-01-09 22:37:31,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:31,598 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:37:31,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:31,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:31,823 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 20 treesize of output 21 [2025-01-09 22:37:31,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:31,833 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 34 treesize of output 37 [2025-01-09 22:37:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-01-09 22:37:32,307 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:37:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955574116] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:32,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-01-09 22:37:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851562901] [2025-01-09 22:37:32,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:32,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:37:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:32,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:37:32,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=845, Unknown=9, NotChecked=0, Total=992 [2025-01-09 22:37:32,310 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 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:37:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:33,330 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2025-01-09 22:37:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:37:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 22:37:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:33,331 INFO L225 Difference]: With dead ends: 257 [2025-01-09 22:37:33,331 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 22:37:33,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1314, Unknown=9, NotChecked=0, Total=1560 [2025-01-09 22:37:33,332 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 317 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:33,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 814 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:37:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 22:37:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 181. [2025-01-09 22:37:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 179 states have internal predecessors, (196), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2025-01-09 22:37:33,336 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 34 [2025-01-09 22:37:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:33,336 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2025-01-09 22:37:33,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 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:37:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2025-01-09 22:37:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:37:33,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:33,336 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, 1] [2025-01-09 22:37:33,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:37:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:33,541 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash -364382182, now seen corresponding path program 1 times [2025-01-09 22:37:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150207095] [2025-01-09 22:37:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:33,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:37:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:37:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:33,885 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:37:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150207095] [2025-01-09 22:37:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150207095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275927770] [2025-01-09 22:37:33,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:33,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:33,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:33,888 INFO L229 MonitoredProcess]: Starting monitored process 7 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:37:33,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:37:33,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:37:33,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:37:33,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:33,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:33,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:37:33,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:33,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:37:33,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:33,998 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:37:34,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-01-09 22:37:34,022 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:37:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:34,103 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:37:34,103 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 33 treesize of output 24 [2025-01-09 22:37:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:34,109 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:37:34,128 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:37:34,128 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 50 treesize of output 45 [2025-01-09 22:37:34,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:37:34,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:37:34,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:37:34,240 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:37:34,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:34,359 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_915 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4)))) is different from false [2025-01-09 22:37:34,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_915 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_916) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2025-01-09 22:37:34,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:34,430 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 20 treesize of output 21 [2025-01-09 22:37:34,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:34,436 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 34 treesize of output 37 [2025-01-09 22:37:34,442 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 7 treesize of output 5 [2025-01-09 22:37:34,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:34,452 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 37 treesize of output 38 [2025-01-09 22:37:34,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:34,457 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 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-09 22:37:34,458 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 22:37:34,461 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:34,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-09 22:37:34,543 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:37:34,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275927770] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:34,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:34,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-01-09 22:37:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812577215] [2025-01-09 22:37:34,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:34,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:37:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:34,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:37:34,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=756, Unknown=18, NotChecked=114, Total=992 [2025-01-09 22:37:34,544 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 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:37:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:35,376 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2025-01-09 22:37:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:37:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 22:37:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:35,377 INFO L225 Difference]: With dead ends: 232 [2025-01-09 22:37:35,377 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 22:37:35,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1764, Unknown=21, NotChecked=178, Total=2256 [2025-01-09 22:37:35,378 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 437 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:35,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 679 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1283 Invalid, 0 Unknown, 352 Unchecked, 0.5s Time] [2025-01-09 22:37:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 22:37:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 184. [2025-01-09 22:37:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 160 states have (on average 1.24375) internal successors, (199), 182 states have internal predecessors, (199), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2025-01-09 22:37:35,381 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 34 [2025-01-09 22:37:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:35,381 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2025-01-09 22:37:35,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 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:37:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2025-01-09 22:37:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:37:35,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:35,382 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:35,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:37:35,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 22:37:35,583 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -541023485, now seen corresponding path program 1 times [2025-01-09 22:37:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316432363] [2025-01-09 22:37:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:37:35,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:37:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:36,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316432363] [2025-01-09 22:37:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316432363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073675220] [2025-01-09 22:37:36,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:36,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:36,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:36,132 INFO L229 MonitoredProcess]: Starting monitored process 8 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:37:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:37:36,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:37:36,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:37:36,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:36,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:36,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 22:37:36,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:36,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:37:36,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:37:36,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:37:36,277 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:37:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:37:36,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:37:36,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:37:36,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:37:36,359 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:37:36,369 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:37:36,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:37:36,401 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:37:36,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:37:36,471 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:37:36,471 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 16 treesize of output 15 [2025-01-09 22:37:36,516 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 22:37:36,516 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 23 treesize of output 26 [2025-01-09 22:37:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:36,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:36,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:37:36,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_97| Int) (v_ArrVal_1059 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1059) |v_ULTIMATE.start_main_~end~0#1.base_97| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= (select v_arrayElimArr_5 4) 1)))) is different from false [2025-01-09 22:37:37,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_97| Int) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (or (not (= v_ArrVal_1055 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1055 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1059) |v_ULTIMATE.start_main_~end~0#1.base_97| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= (select v_arrayElimArr_5 4) 1)))) is different from false [2025-01-09 22:37:37,094 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_82| Int) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.base_97| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_17| Int) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_17|) 0)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_82|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1055) |v_ULTIMATE.start_main_#t~malloc4#1.base_17| v_ArrVal_1059) |v_ULTIMATE.start_main_~end~0#1.base_97| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1) (not (= (select v_arrayElimArr_5 4) 1)) (not (= v_ArrVal_1055 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_82| (select v_ArrVal_1055 |v_ULTIMATE.start_main_~end~0#1.offset_82|)))))) is different from false [2025-01-09 22:37:37,101 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 142 treesize of output 140 [2025-01-09 22:37:37,106 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 29 treesize of output 25 [2025-01-09 22:37:37,110 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:37:37,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:37:37,115 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 35 treesize of output 33 [2025-01-09 22:37:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:37:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073675220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:37,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 46 [2025-01-09 22:37:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44125365] [2025-01-09 22:37:37,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 22:37:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 22:37:37,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1499, Unknown=59, NotChecked=252, Total=2070 [2025-01-09 22:37:37,163 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 46 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:49,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:53,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:58,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:37:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:58,268 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2025-01-09 22:37:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:37:58,270 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 46 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:37:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:58,270 INFO L225 Difference]: With dead ends: 190 [2025-01-09 22:37:58,270 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 22:37:58,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=683, Invalid=2925, Unknown=64, NotChecked=360, Total=4032 [2025-01-09 22:37:58,272 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 479 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 62 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:58,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 795 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1276 Invalid, 5 Unknown, 357 Unchecked, 12.6s Time] [2025-01-09 22:37:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 22:37:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 167. [2025-01-09 22:37:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.25) internal successors, (180), 165 states have internal predecessors, (180), 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:37:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2025-01-09 22:37:58,274 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 36 [2025-01-09 22:37:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:58,275 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2025-01-09 22:37:58,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 46 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:37:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2025-01-09 22:37:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:37:58,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:58,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:58,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:37:58,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:58,476 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash 380207961, now seen corresponding path program 1 times [2025-01-09 22:37:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:58,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171186014] [2025-01-09 22:37:58,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:37:58,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:37:58,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:58,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:37:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171186014] [2025-01-09 22:37:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171186014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:37:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755865795] [2025-01-09 22:37:58,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:37:58,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:58,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:37:58,634 INFO L229 MonitoredProcess]: Starting monitored process 9 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:37:58,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:37:58,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:37:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:37:58,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:37:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:37:58,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:37:58,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:37:58,760 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:37:58,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-01-09 22:37:58,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2025-01-09 22:37:58,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 37 [2025-01-09 22:37:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:58,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:37:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:37:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755865795] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:37:59,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:37:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-09 22:37:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191924992] [2025-01-09 22:37:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:37:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:37:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:37:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:37:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:37:59,161 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:37:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:37:59,486 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2025-01-09 22:37:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:37:59,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 35 [2025-01-09 22:37:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:37:59,487 INFO L225 Difference]: With dead ends: 177 [2025-01-09 22:37:59,487 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 22:37:59,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:37:59,487 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:37:59,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 380 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:37:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 22:37:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 22:37:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 150 states have internal predecessors, (164), 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:37:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2025-01-09 22:37:59,490 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 35 [2025-01-09 22:37:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:37:59,490 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2025-01-09 22:37:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:37:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2025-01-09 22:37:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:37:59,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:37:59,491 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:37:59,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:37:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:37:59,691 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:37:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:37:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash -821542945, now seen corresponding path program 2 times [2025-01-09 22:37:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:37:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502987698] [2025-01-09 22:37:59,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:37:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:37:59,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:37:59,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:37:59,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:37:59,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502987698] [2025-01-09 22:38:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502987698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:38:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408827061] [2025-01-09 22:38:00,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:38:00,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:38:00,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:00,154 INFO L229 MonitoredProcess]: Starting monitored process 10 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:38:00,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:38:00,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:38:00,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:38:00,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:38:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:00,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 22:38:00,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:38:00,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:38:00,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:38:00,371 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:38:00,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:38:00,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:38:00,522 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:38:00,522 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 27 treesize of output 22 [2025-01-09 22:38:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:38:00,531 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 19 treesize of output 18 [2025-01-09 22:38:00,595 INFO L349 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2025-01-09 22:38:00,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 90 [2025-01-09 22:38:00,609 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-01-09 22:38:00,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2025-01-09 22:38:00,896 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-09 22:38:00,897 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2025-01-09 22:38:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:00,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:38:01,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (not (= v_ArrVal_1231 (store .cse0 .cse1 (select v_ArrVal_1231 .cse1)))) (forall ((v_ArrVal_1232 Int)) (= |ULTIMATE.start_main_~null~0#1.base| (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1232)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (forall ((v_ArrVal_1232 Int)) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1231))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1232)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|)) (not (= v_ArrVal_1231 (store .cse0 .cse1 (select v_ArrVal_1231 .cse1)))))))) is different from false [2025-01-09 22:38:01,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem5#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1231 .cse1)) v_ArrVal_1231)) (forall ((v_ArrVal_1232 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store .cse3 |c_ULTIMATE.start_main_#t~mem5#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1232)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) |c_ULTIMATE.start_main_~null~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1231 .cse1)) v_ArrVal_1231)) (forall ((v_ArrVal_1232 Int)) (= |ULTIMATE.start_main_~null~0#1.base| (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store .cse3 |c_ULTIMATE.start_main_#t~mem5#1.offset| |ULTIMATE.start_main_~null~0#1.base|) .cse1 v_ArrVal_1232)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))) is different from false [2025-01-09 22:38:01,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3 |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse4 (+ .cse3 4))) (and (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (forall ((v_ArrVal_1232 Int)) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1231))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store (store .cse2 .cse3 |ULTIMATE.start_main_~null~0#1.base|) .cse4 v_ArrVal_1232)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= v_ArrVal_1231 (store .cse5 .cse4 (select v_ArrVal_1231 .cse4)))))) (forall ((|ULTIMATE.start_main_~null~0#1.base| Int) (v_ArrVal_1231 (Array Int Int))) (or (forall ((v_ArrVal_1232 Int)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 (store (store .cse2 .cse3 |ULTIMATE.start_main_~null~0#1.base|) .cse4 v_ArrVal_1232)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) |ULTIMATE.start_main_~null~0#1.base|)) (not (= v_ArrVal_1231 (store .cse5 .cse4 (select v_ArrVal_1231 .cse4))))))))) is different from false [2025-01-09 22:38:01,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:01,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 199135 treesize of output 185371 [2025-01-09 22:38:04,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:04,743 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 8460 treesize of output 8156 [2025-01-09 22:38:04,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:04,935 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 10139 treesize of output 9331 [2025-01-09 22:38:24,184 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 17 treesize of output 13 [2025-01-09 22:38:24,188 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 110 treesize of output 106 [2025-01-09 22:38:24,206 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 6 treesize of output 4 [2025-01-09 22:38:24,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:38:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:38:24,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:38:24,217 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 22:38:24,217 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 47 treesize of output 1 [2025-01-09 22:38:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408827061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:38:24,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:38:24,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 37 [2025-01-09 22:38:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310998678] [2025-01-09 22:38:24,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:38:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:38:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:24,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:38:24,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=992, Unknown=20, NotChecked=198, Total=1332 [2025-01-09 22:38:24,289 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 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:38:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:25,511 INFO L93 Difference]: Finished difference Result 198 states and 218 transitions. [2025-01-09 22:38:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:38:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 22:38:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:25,513 INFO L225 Difference]: With dead ends: 198 [2025-01-09 22:38:25,513 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 22:38:25,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=2121, Unknown=20, NotChecked=294, Total=2756 [2025-01-09 22:38:25,514 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 535 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:25,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 762 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1534 Invalid, 0 Unknown, 539 Unchecked, 0.8s Time] [2025-01-09 22:38:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 22:38:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2025-01-09 22:38:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 152 states have internal predecessors, (166), 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:38:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-01-09 22:38:25,516 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 39 [2025-01-09 22:38:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:25,516 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-01-09 22:38:25,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 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:38:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-01-09 22:38:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:38:25,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:25,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:38:25,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:38:25,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:38:25,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:38:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1118918933, now seen corresponding path program 1 times [2025-01-09 22:38:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444367156] [2025-01-09 22:38:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:25,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:38:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:38:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444367156] [2025-01-09 22:38:26,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444367156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:38:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453305481] [2025-01-09 22:38:26,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:38:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:26,151 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:38:26,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:38:26,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:38:26,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:26,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 22:38:26,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:38:26,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:38:26,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:38:26,281 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:38:26,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:38:26,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:38:26,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:38:26,407 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 23 treesize of output 20 [2025-01-09 22:38:26,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:38:26,424 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:38:26,425 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 24 treesize of output 17 [2025-01-09 22:38:26,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:38:26,466 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 66 treesize of output 59 [2025-01-09 22:38:26,468 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 25 treesize of output 17 [2025-01-09 22:38:26,470 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 41 treesize of output 26 [2025-01-09 22:38:26,551 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 33 treesize of output 21 [2025-01-09 22:38:26,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-01-09 22:38:26,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:26,616 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 19 treesize of output 15 [2025-01-09 22:38:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:26,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:38:26,867 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 32 treesize of output 19 [2025-01-09 22:38:26,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1338 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) (and (or .cse0 (< |c_ULTIMATE.start_main_~end~0#1.offset| 1)) (forall ((v_ArrVal_1338 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (< .cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1)) (< .cse1 0)))) (or (forall ((v_ArrVal_1336 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse0))) is different from false [2025-01-09 22:38:27,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (forall ((v_ArrVal_1338 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1338) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) (and (or (forall ((v_ArrVal_1336 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse1) (forall ((v_ArrVal_1338 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1338) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (< .cse2 0) (< .cse2 (+ .cse3 1))))) (or (< .cse3 1) .cse1)))) is different from false [2025-01-09 22:38:27,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:27,037 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 99 treesize of output 76 [2025-01-09 22:38:27,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:27,044 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 75 treesize of output 76 [2025-01-09 22:38:27,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:27,052 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 125 treesize of output 104 [2025-01-09 22:38:27,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:27,063 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 117 treesize of output 120 [2025-01-09 22:38:27,070 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 104 treesize of output 102 [2025-01-09 22:38:27,074 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 102 treesize of output 100 [2025-01-09 22:38:27,081 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 100 treesize of output 96 [2025-01-09 22:38:27,085 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 96 treesize of output 94 [2025-01-09 22:38:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453305481] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:38:27,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:38:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 37 [2025-01-09 22:38:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713679350] [2025-01-09 22:38:27,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:38:27,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:38:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:27,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:38:27,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1083, Unknown=21, NotChecked=134, Total=1332 [2025-01-09 22:38:27,213 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 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:38:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:28,758 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2025-01-09 22:38:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:38:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-09 22:38:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:28,759 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:38:28,759 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 22:38:28,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=2644, Unknown=23, NotChecked=214, Total=3192 [2025-01-09 22:38:28,760 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 255 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:28,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1043 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1785 Invalid, 0 Unknown, 292 Unchecked, 0.9s Time] [2025-01-09 22:38:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 22:38:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2025-01-09 22:38:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 151 states have internal predecessors, (164), 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:38:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2025-01-09 22:38:28,763 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 40 [2025-01-09 22:38:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2025-01-09 22:38:28,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 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:38:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2025-01-09 22:38:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:38:28,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:28,764 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:38:28,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:38:28,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:38:28,968 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2025-01-09 22:38:28,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash -161765610, now seen corresponding path program 1 times [2025-01-09 22:38:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795705949] [2025-01-09 22:38:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:28,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:38:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:38:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:29,333 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:38:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795705949] [2025-01-09 22:38:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795705949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:38:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714835166] [2025-01-09 22:38:29,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:38:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:29,335 INFO L229 MonitoredProcess]: Starting monitored process 12 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:38:29,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:38:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:38:29,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:38:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:29,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:38:29,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:38:29,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:38:29,505 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:38:29,505 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:38:29,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:38:29,630 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:38:29,630 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 33 treesize of output 24 [2025-01-09 22:38:29,655 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:38:29,656 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 33 treesize of output 24 [2025-01-09 22:38:29,685 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-01-09 22:38:29,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-01-09 22:38:29,737 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:38:29,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2025-01-09 22:38:29,884 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-09 22:38:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2025-01-09 22:38:29,913 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:38:29,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2025-01-09 22:38:30,088 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:38:30,088 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-01-09 22:38:30,146 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:38:30,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:38:34,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:34,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 22:38:41,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:41,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 22:38:51,410 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-01-09 22:38:51,410 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 39 treesize of output 42 [2025-01-09 22:38:51,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:38:51,429 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 76 treesize of output 81 [2025-01-09 22:38:51,433 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 14 treesize of output 12 [2025-01-09 22:38:52,826 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:38:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714835166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:38:52,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:38:52,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2025-01-09 22:38:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286401633] [2025-01-09 22:38:52,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:38:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:38:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:52,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:38:52,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1666, Unknown=17, NotChecked=0, Total=1892 [2025-01-09 22:38:52,828 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 44 states, 43 states have (on average 2.604651162790698) internal successors, (112), 44 states have internal predecessors, (112), 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:38:57,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]