./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.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/array-examples/data_structures_set_multi_proc_trivial_ground.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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:07:13,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:07:14,015 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:07:14,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:07:14,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:07:14,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:07:14,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:07:14,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:07:14,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:07:14,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:07:14,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:07:14,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:07:14,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:07:14,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:07:14,056 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:07:14,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:07:14,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:07:14,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:07:14,057 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:07:14,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:07:14,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:07:14,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:07:14,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:07:14,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:14,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:14,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:07:14,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:07:14,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:07:14,060 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2025-01-09 22:07:14,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:07:14,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:07:14,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:07:14,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:07:14,329 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:07:14,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-01-09 22:07:15,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61018b1c1/846756b374b3495eb3645b0308c1c1fc/FLAG23ef2c40a [2025-01-09 22:07:15,791 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:07:15,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-01-09 22:07:15,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61018b1c1/846756b374b3495eb3645b0308c1c1fc/FLAG23ef2c40a [2025-01-09 22:07:15,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61018b1c1/846756b374b3495eb3645b0308c1c1fc [2025-01-09 22:07:15,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:07:15,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:07:15,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:07:15,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:07:15,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:07:15,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:15" (1/1) ... [2025-01-09 22:07:15,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffbba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:15, skipping insertion in model container [2025-01-09 22:07:15,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:07:15" (1/1) ... [2025-01-09 22:07:15,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:07:15,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:07:15,992 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:07:16,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:07:16,025 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:07:16,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16 WrapperNode [2025-01-09 22:07:16,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:07:16,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:07:16,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:07:16,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:07:16,036 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:07:16" (1/1) ... [2025-01-09 22:07:16,047 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:07:16" (1/1) ... [2025-01-09 22:07:16,070 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2025-01-09 22:07:16,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:07:16,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:07:16,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:07:16,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:07:16,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,094 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-01-09 22:07:16,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:07:16,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:07:16,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:07:16,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:07:16,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (1/1) ... [2025-01-09 22:07:16,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:07:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:16,139 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:07:16,142 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:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:07:16,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 22:07:16,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 22:07:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:07:16,236 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:07:16,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:07:16,581 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-09 22:07:16,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:07:16,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:07:16,591 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:07:16,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:16 BoogieIcfgContainer [2025-01-09 22:07:16,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:07:16,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:07:16,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:07:16,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:07:16,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:07:15" (1/3) ... [2025-01-09 22:07:16,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b06e608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:16, skipping insertion in model container [2025-01-09 22:07:16,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:07:16" (2/3) ... [2025-01-09 22:07:16,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b06e608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:07:16, skipping insertion in model container [2025-01-09 22:07:16,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:16" (3/3) ... [2025-01-09 22:07:16,600 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-01-09 22:07:16,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:07:16,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG data_structures_set_multi_proc_trivial_ground.i that has 2 procedures, 77 locations, 1 initial locations, 10 loop locations, and 26 error locations. [2025-01-09 22:07:16,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:07:16,666 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;@70db21c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:07:16,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 22:07:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 72 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:07:16,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:07:16,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:16,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:07:16,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:07:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967540733] [2025-01-09 22:07:16,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:07:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:07:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:16,883 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:07:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967540733] [2025-01-09 22:07:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967540733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:16,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067156976] [2025-01-09 22:07:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:16,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:16,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:16,922 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 72 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:17,040 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2025-01-09 22:07:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:07:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:17,051 INFO L225 Difference]: With dead ends: 69 [2025-01-09 22:07:17,052 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:07:17,054 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:07:17,057 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 54 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:17,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 62 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:07:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 22:07:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:07:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-01-09 22:07:17,096 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 4 [2025-01-09 22:07:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-01-09 22:07:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:07:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-01-09 22:07:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:07:17,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:17,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:07:17,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:07:17,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:17,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:17,099 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:07:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712296336] [2025-01-09 22:07:17,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:17,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:07:17,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:07:17,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:17,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:17,206 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:07:17,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:17,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712296336] [2025-01-09 22:07:17,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712296336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:17,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:17,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217023613] [2025-01-09 22:07:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:17,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:17,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:17,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:17,209 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:17,290 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-01-09 22:07:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:07:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:17,291 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:07:17,291 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:07:17,291 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:07:17,291 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:17,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:07:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:07:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-01-09 22:07:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 64 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:07:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-01-09 22:07:17,296 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 4 [2025-01-09 22:07:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:17,296 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-01-09 22:07:17,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:07:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-01-09 22:07:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:07:17,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:17,296 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:07:17,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:07:17,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:07:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085570667] [2025-01-09 22:07:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:07:17,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:07:17,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:17,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:17,496 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:07:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085570667] [2025-01-09 22:07:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085570667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217560866] [2025-01-09 22:07:17,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:17,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:17,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:17,500 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:07:17,503 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:07:17,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:07:17,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:07:17,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:17,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:17,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:07:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:17,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:07:17,721 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:07:17,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:17,806 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:07:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217560866] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:17,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 22:07:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579747882] [2025-01-09 22:07:17,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:17,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:07:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:17,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:07:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:07:17,810 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:18,123 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-01-09 22:07:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:07:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:07:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:18,126 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:07:18,128 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:07:18,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:07:18,129 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:18,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 210 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:07:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:07:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:07:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 93 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:07:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2025-01-09 22:07:18,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 7 [2025-01-09 22:07:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:18,145 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2025-01-09 22:07:18,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2025-01-09 22:07:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:07:18,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:18,146 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:18,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:07:18,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:18,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:18,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1103274599, now seen corresponding path program 1 times [2025-01-09 22:07:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009711404] [2025-01-09 22:07:18,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:18,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:18,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:18,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:07:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009711404] [2025-01-09 22:07:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009711404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505875946] [2025-01-09 22:07:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:18,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:18,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:18,407 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:07:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:18,437 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2025-01-09 22:07:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:18,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:07:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:18,438 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:07:18,438 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:07:18,438 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:07:18,439 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:18,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:07:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:07:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.513157894736842) internal successors, (115), 90 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:07:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-01-09 22:07:18,446 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 18 [2025-01-09 22:07:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:18,446 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-01-09 22:07:18,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:07:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2025-01-09 22:07:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:07:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:18,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:07:18,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1103274598, now seen corresponding path program 1 times [2025-01-09 22:07:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-01-09 22:07:18,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:18,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:18,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:18,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:18,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-01-09 22:07:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595590794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924504371] [2025-01-09 22:07:18,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:18,587 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:07:18,590 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:07:18,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:07:18,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:07:18,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:18,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:18,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:07:18,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:18,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:07:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924504371] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:18,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:07:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873400932] [2025-01-09 22:07:18,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:18,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:07:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:18,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:07:18,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:07:18,789 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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:07:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:19,114 INFO L93 Difference]: Finished difference Result 359 states and 517 transitions. [2025-01-09 22:07:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:07:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:07:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:19,117 INFO L225 Difference]: With dead ends: 359 [2025-01-09 22:07:19,117 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 22:07:19,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:07:19,118 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 250 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:19,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 493 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:07:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 22:07:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 116. [2025-01-09 22:07:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 108 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:07:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2025-01-09 22:07:19,143 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 18 [2025-01-09 22:07:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:19,143 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2025-01-09 22:07:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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:07:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2025-01-09 22:07:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:07:19,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:19,145 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:19,155 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:07:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:19,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:19,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1855632134, now seen corresponding path program 2 times [2025-01-09 22:07:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280391116] [2025-01-09 22:07:19,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:19,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:07:19,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-09 22:07:19,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:07:19,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:07:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280391116] [2025-01-09 22:07:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280391116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:07:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671674661] [2025-01-09 22:07:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:07:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:07:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:07:19,414 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:07:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:19,461 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2025-01-09 22:07:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:07:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 36 [2025-01-09 22:07:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:19,463 INFO L225 Difference]: With dead ends: 119 [2025-01-09 22:07:19,463 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 22:07:19,463 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:07:19,464 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:19,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 22:07:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-01-09 22:07:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.40625) internal successors, (135), 110 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:07:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-01-09 22:07:19,473 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 36 [2025-01-09 22:07:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-01-09 22:07:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:07:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-01-09 22:07:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:07:19,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:19,474 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:19,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:07:19,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:19,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1690513870, now seen corresponding path program 1 times [2025-01-09 22:07:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:19,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322757384] [2025-01-09 22:07:19,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:19,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:07:19,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:07:19,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:07:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322757384] [2025-01-09 22:07:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322757384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80675730] [2025-01-09 22:07:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:19,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:19,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:19,607 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:19,645 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-01-09 22:07:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:07:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:19,646 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:07:19,646 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:07:19,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:19,647 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:07:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-01-09 22:07:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 97 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:07:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2025-01-09 22:07:19,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 37 [2025-01-09 22:07:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:19,660 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2025-01-09 22:07:19,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2025-01-09 22:07:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:07:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:19,660 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:07:19,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -612857165, now seen corresponding path program 1 times [2025-01-09 22:07:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124311823] [2025-01-09 22:07:19,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:07:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:07:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124311823] [2025-01-09 22:07:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124311823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665177157] [2025-01-09 22:07:19,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:19,918 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:07:19,922 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:07:19,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:07:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:07:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:20,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:07:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:20,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:20,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665177157] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:20,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 22:07:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999718823] [2025-01-09 22:07:20,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:20,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:07:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:20,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:07:20,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:07:20,323 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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:07:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:20,800 INFO L93 Difference]: Finished difference Result 533 states and 772 transitions. [2025-01-09 22:07:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:07:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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:07:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:20,803 INFO L225 Difference]: With dead ends: 533 [2025-01-09 22:07:20,803 INFO L226 Difference]: Without dead ends: 533 [2025-01-09 22:07:20,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:07:20,807 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 509 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:20,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 537 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:07:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-01-09 22:07:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 137. [2025-01-09 22:07:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.256198347107438) internal successors, (152), 133 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:07:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-01-09 22:07:20,831 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 39 [2025-01-09 22:07:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:20,831 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-01-09 22:07:20,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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:07:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-01-09 22:07:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 22:07:20,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:20,833 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:20,840 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:07:21,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:21,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:21,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1071285261, now seen corresponding path program 2 times [2025-01-09 22:07:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667238279] [2025-01-09 22:07:21,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:21,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-01-09 22:07:21,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 22:07:21,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:21,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-01-09 22:07:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667238279] [2025-01-09 22:07:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667238279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752034408] [2025-01-09 22:07:21,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:21,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:21,419 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:07:21,422 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:07:21,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-01-09 22:07:21,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 22:07:21,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:07:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:21,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 22:07:21,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:21,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:07:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752034408] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:22,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 25, 25] total 51 [2025-01-09 22:07:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128560368] [2025-01-09 22:07:22,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 22:07:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:22,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 22:07:22,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1414, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 22:07:22,829 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 0 states have call successors, (0), 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:07:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:28,294 INFO L93 Difference]: Finished difference Result 1482 states and 2200 transitions. [2025-01-09 22:07:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-01-09 22:07:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 0 states have call successors, (0), 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 75 [2025-01-09 22:07:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:28,302 INFO L225 Difference]: With dead ends: 1482 [2025-01-09 22:07:28,304 INFO L226 Difference]: Without dead ends: 1482 [2025-01-09 22:07:28,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4762 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6960, Invalid=13632, Unknown=0, NotChecked=0, Total=20592 [2025-01-09 22:07:28,315 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4119 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 952 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4166 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 952 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:28,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4166 Valid, 505 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [952 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:07:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-01-09 22:07:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 206. [2025-01-09 22:07:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 193 states have (on average 1.1398963730569949) internal successors, (220), 202 states have internal predecessors, (220), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:07:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2025-01-09 22:07:28,371 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 75 [2025-01-09 22:07:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2025-01-09 22:07:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0) internal successors, (153), 51 states have internal predecessors, (153), 0 states have call successors, (0), 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:07:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2025-01-09 22:07:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 22:07:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:28,378 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:28,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:07:28,579 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,SelfDestructingSolverStorable8 [2025-01-09 22:07:28,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash 932963609, now seen corresponding path program 1 times [2025-01-09 22:07:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491496747] [2025-01-09 22:07:28,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:28,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 22:07:28,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 22:07:28,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2025-01-09 22:07:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491496747] [2025-01-09 22:07:28,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491496747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:07:28,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714702575] [2025-01-09 22:07:28,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:28,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:07:28,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:07:28,796 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:07:28,799 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:07:28,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 22:07:28,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 22:07:28,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:28,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:28,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:07:28,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:07:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:30,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:07:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:07:32,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714702575] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:07:32,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:07:32,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 49, 49] total 98 [2025-01-09 22:07:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130098935] [2025-01-09 22:07:32,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:07:32,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-01-09 22:07:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:32,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-01-09 22:07:32,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2025-01-09 22:07:32,361 INFO L87 Difference]: Start difference. First operand 206 states and 224 transitions. Second operand has 98 states, 98 states have (on average 3.0714285714285716) internal successors, (301), 98 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:52,624 INFO L93 Difference]: Finished difference Result 3806 states and 5723 transitions. [2025-01-09 22:07:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2025-01-09 22:07:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.0714285714285716) internal successors, (301), 98 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-01-09 22:07:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:52,641 INFO L225 Difference]: With dead ends: 3806 [2025-01-09 22:07:52,641 INFO L226 Difference]: Without dead ends: 3806 [2025-01-09 22:07:52,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19742 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=27360, Invalid=54150, Unknown=0, NotChecked=0, Total=81510 [2025-01-09 22:07:52,654 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 7922 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 1819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8112 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1819 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:52,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8112 Valid, 1343 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1819 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 22:07:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2025-01-09 22:07:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 378. [2025-01-09 22:07:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 364 states have (on average 1.1071428571428572) internal successors, (403), 373 states have internal predecessors, (403), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:07:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 409 transitions. [2025-01-09 22:07:52,750 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 409 transitions. Word has length 151 [2025-01-09 22:07:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:52,751 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 409 transitions. [2025-01-09 22:07:52,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.0714285714285716) internal successors, (301), 98 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 409 transitions. [2025-01-09 22:07:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 22:07:52,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:52,758 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:52,767 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:07:52,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:07:52,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1280544960, now seen corresponding path program 2 times [2025-01-09 22:07:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:52,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848872858] [2025-01-09 22:07:52,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:07:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:52,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-01-09 22:07:53,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 298 statements. [2025-01-09 22:07:53,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:07:53,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13212 trivial. 0 not checked. [2025-01-09 22:07:53,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848872858] [2025-01-09 22:07:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848872858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:53,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:53,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609433838] [2025-01-09 22:07:53,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:53,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:53,046 INFO L87 Difference]: Start difference. First operand 378 states and 409 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:07:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:53,075 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2025-01-09 22:07:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 298 [2025-01-09 22:07:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:53,077 INFO L225 Difference]: With dead ends: 376 [2025-01-09 22:07:53,077 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 22:07:53,077 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:07:53,078 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:53,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 22:07:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2025-01-09 22:07:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 360 states have (on average 1.086111111111111) internal successors, (391), 369 states have internal predecessors, (391), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:07:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 397 transitions. [2025-01-09 22:07:53,088 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 397 transitions. Word has length 298 [2025-01-09 22:07:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:53,088 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 397 transitions. [2025-01-09 22:07:53,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:07:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 397 transitions. [2025-01-09 22:07:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 22:07:53,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:53,093 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:07:53,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -195362941, now seen corresponding path program 1 times [2025-01-09 22:07:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549580620] [2025-01-09 22:07:53,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 22:07:53,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 22:07:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:07:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13212 trivial. 0 not checked. [2025-01-09 22:07:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:07:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549580620] [2025-01-09 22:07:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549580620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:07:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:07:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:07:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313846329] [2025-01-09 22:07:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:07:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:07:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:07:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:07:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:53,439 INFO L87 Difference]: Start difference. First operand 374 states and 397 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:07:53,445 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2025-01-09 22:07:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:07:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2025-01-09 22:07:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:07:53,447 INFO L225 Difference]: With dead ends: 313 [2025-01-09 22:07:53,447 INFO L226 Difference]: Without dead ends: 313 [2025-01-09 22:07:53,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:07:53,448 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:07:53,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:07:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-01-09 22:07:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-01-09 22:07:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.0096153846153846) internal successors, (315), 312 states have internal predecessors, (315), 0 states have call successors, (0), 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:07:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 315 transitions. [2025-01-09 22:07:53,452 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 315 transitions. Word has length 302 [2025-01-09 22:07:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:07:53,454 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 315 transitions. [2025-01-09 22:07:53,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:07:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 315 transitions. [2025-01-09 22:07:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 22:07:53,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:07:53,456 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:07:53,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:07:53,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:07:53,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:07:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2141182060, now seen corresponding path program 1 times [2025-01-09 22:07:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:07:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213660992] [2025-01-09 22:07:53,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:07:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:07:53,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 22:07:53,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 22:07:53,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:07:53,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:08:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213660992] [2025-01-09 22:08:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213660992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:08:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999946899] [2025-01-09 22:08:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:08:00,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:08:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:08:00,537 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:08:00,538 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:08:00,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 22:08:00,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 22:08:00,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:08:00,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:00,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 22:08:00,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:08:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:08:01,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:08:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13222 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:08:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999946899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:08:09,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:08:09,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-01-09 22:08:09,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598022768] [2025-01-09 22:08:09,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:08:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-01-09 22:08:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-01-09 22:08:09,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-01-09 22:08:09,859 INFO L87 Difference]: Start difference. First operand 313 states and 315 transitions. Second operand has 193 states, 193 states have (on average 3.051813471502591) internal successors, (589), 193 states have internal predecessors, (589), 0 states have call successors, (0), 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:08:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:10,687 INFO L93 Difference]: Finished difference Result 601 states and 603 transitions. [2025-01-09 22:08:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-09 22:08:10,688 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.051813471502591) internal successors, (589), 193 states have internal predecessors, (589), 0 states have call successors, (0), 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 312 [2025-01-09 22:08:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:10,690 INFO L225 Difference]: With dead ends: 601 [2025-01-09 22:08:10,690 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 22:08:10,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-01-09 22:08:10,694 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:10,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:08:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 22:08:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-01-09 22:08:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.005) internal successors, (603), 600 states have internal predecessors, (603), 0 states have call successors, (0), 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:08:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 603 transitions. [2025-01-09 22:08:10,703 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 603 transitions. Word has length 312 [2025-01-09 22:08:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 603 transitions. [2025-01-09 22:08:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.051813471502591) internal successors, (589), 193 states have internal predecessors, (589), 0 states have call successors, (0), 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:08:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 603 transitions. [2025-01-09 22:08:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-01-09 22:08:10,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:08:10,711 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:10,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:08:10,912 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,SelfDestructingSolverStorable12 [2025-01-09 22:08:10,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-09 22:08:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:08:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 302210452, now seen corresponding path program 2 times [2025-01-09 22:08:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:08:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586524633] [2025-01-09 22:08:10,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:08:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:08:11,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 600 statements into 2 equivalence classes. [2025-01-09 22:08:11,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 600 statements. [2025-01-09 22:08:11,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:08:11,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:08:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 54070 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54070 trivial. 0 not checked. [2025-01-09 22:08:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:08:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586524633] [2025-01-09 22:08:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586524633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:08:11,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:08:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:08:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552437815] [2025-01-09 22:08:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:08:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:08:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:08:11,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:08:11,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:08:11,110 INFO L87 Difference]: Start difference. First operand 601 states and 603 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:08:11,127 INFO L93 Difference]: Finished difference Result 600 states and 602 transitions. [2025-01-09 22:08:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:08:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 600 [2025-01-09 22:08:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:08:11,129 INFO L225 Difference]: With dead ends: 600 [2025-01-09 22:08:11,129 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:08:11,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:08:11,129 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:08:11,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:08:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:08:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:08:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:08:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:08:11,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 600 [2025-01-09 22:08:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:08:11,130 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:08:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:08:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:08:11,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:08:11,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 26 remaining) [2025-01-09 22:08:11,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-01-09 22:08:11,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-01-09 22:08:11,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-01-09 22:08:11,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2025-01-09 22:08:11,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-01-09 22:08:11,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (1 of 26 remaining) [2025-01-09 22:08:11,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2025-01-09 22:08:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:08:11,138 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:08:11,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:08:11,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:08:11 BoogieIcfgContainer [2025-01-09 22:08:11,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:08:11,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:08:11,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:08:11,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:08:11,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:07:16" (3/4) ... [2025-01-09 22:08:11,149 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:08:11,154 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 22:08:11,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 22:08:11,160 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 22:08:11,161 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:08:11,161 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:08:11,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:08:11,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:08:11,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:08:11,244 INFO L158 Benchmark]: Toolchain (without parser) took 55433.16ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 127.9MB in the beginning and 1.0GB in the end (delta: -889.8MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,244 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:08:11,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.34ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 116.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.96ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,246 INFO L158 Benchmark]: Boogie Preprocessor took 33.99ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 112.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:08:11,246 INFO L158 Benchmark]: RCFGBuilder took 483.40ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 93.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,246 INFO L158 Benchmark]: TraceAbstraction took 54552.05ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 92.3MB in the beginning and 1.0GB in the end (delta: -933.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,247 INFO L158 Benchmark]: Witness Printer took 96.71ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:08:11,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.34ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 116.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.96ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.99ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 112.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 483.40ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 93.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 54552.05ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 92.3MB in the beginning and 1.0GB in the end (delta: -933.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 96.71ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 54.5s, OverallIterations: 14, TraceHistogramMax: 190, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13313 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12993 mSDsluCounter, 3919 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3202 mSDsCounter, 3012 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3716 IncrementalHoareTripleChecker+Invalid, 6728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3012 mSolverCounterUnsat, 717 mSDtfsCounter, 3716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1631 GetRequests, 957 SyntacticMatches, 0 SemanticMatches, 674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24943 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=13, InterpolantAutomatonStates: 694, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 5353 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 2503 NumberOfCodeBlocks, 1593 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 13478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2799 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 84729/132592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:08:11,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE