./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/goblint-regression/06-symbeq_06-tricky_address1.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 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:29:08,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:29:08,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:29:08,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:29:08,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:29:08,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:29:08,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:29:08,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:29:08,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:29:08,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:29:08,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:29:08,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:29:08,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:29:08,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:29:08,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:08,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:29:08,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:29:08,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:29:08,438 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-02-08 08:29:08,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:29:08,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:29:08,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:29:08,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:29:08,732 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:29:08,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-02-08 08:29:10,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8b46d202/a6637304769a4d8ab1b091a70315a785/FLAG1ad61794e [2025-02-08 08:29:10,308 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:29:10,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-02-08 08:29:10,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8b46d202/a6637304769a4d8ab1b091a70315a785/FLAG1ad61794e [2025-02-08 08:29:10,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8b46d202/a6637304769a4d8ab1b091a70315a785 [2025-02-08 08:29:10,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:29:10,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:29:10,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:10,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:29:10,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:29:10,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:10" (1/1) ... [2025-02-08 08:29:10,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c72e97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:10, skipping insertion in model container [2025-02-08 08:29:10,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:10" (1/1) ... [2025-02-08 08:29:10,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:29:10,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:10,926 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:29:10,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:11,040 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:29:11,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11 WrapperNode [2025-02-08 08:29:11,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:11,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:11,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:29:11,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:29:11,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,077 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2025-02-08 08:29:11,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:11,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:29:11,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:29:11,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:29:11,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,103 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-02-08 08:29:11,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:29:11,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:29:11,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:29:11,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:29:11,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (1/1) ... [2025-02-08 08:29:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:11,144 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-02-08 08:29:11,146 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-02-08 08:29:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 08:29:11,162 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:29:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:29:11,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:29:11,163 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:29:11,270 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:29:11,273 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:29:11,611 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:29:11,611 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:29:11,982 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:29:11,983 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:29:11,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:11 BoogieIcfgContainer [2025-02-08 08:29:11,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:29:11,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:29:11,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:29:11,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:29:11,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:29:10" (1/3) ... [2025-02-08 08:29:11,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ca39ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:11, skipping insertion in model container [2025-02-08 08:29:11,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:11" (2/3) ... [2025-02-08 08:29:11,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ca39ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:11, skipping insertion in model container [2025-02-08 08:29:11,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:11" (3/3) ... [2025-02-08 08:29:11,993 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-02-08 08:29:12,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:29:12,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 29 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-02-08 08:29:12,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:29:12,057 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:29:12,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 62 flow [2025-02-08 08:29:12,145 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-02-08 08:29:12,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:12,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 3. Up to 2 conditions per place. [2025-02-08 08:29:12,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 62 flow [2025-02-08 08:29:12,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 59 flow [2025-02-08 08:29:12,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:29:12,183 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;@4d3a8012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:29:12,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 08:29:12,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:29:12,193 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-02-08 08:29:12,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:12,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:12,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:12,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:12,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -657285372, now seen corresponding path program 1 times [2025-02-08 08:29:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281758289] [2025-02-08 08:29:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:12,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:29:12,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:29:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281758289] [2025-02-08 08:29:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281758289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750011869] [2025-02-08 08:29:12,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:12,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:12,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:12,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:12,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-02-08 08:29:12,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-08 08:29:12,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:12,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-02-08 08:29:12,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:12,652 INFO L124 PetriNetUnfolderBase]: 43/138 cut-off events. [2025-02-08 08:29:12,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:12,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 138 events. 43/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 531 event pairs, 42 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 230. Up to 102 conditions per place. [2025-02-08 08:29:12,658 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-02-08 08:29:12,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 97 flow [2025-02-08 08:29:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 08:29:12,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-02-08 08:29:12,675 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 59 flow. Second operand 3 states and 55 transitions. [2025-02-08 08:29:12,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 97 flow [2025-02-08 08:29:12,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:12,683 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 70 flow [2025-02-08 08:29:12,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-02-08 08:29:12,692 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-02-08 08:29:12,692 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 70 flow [2025-02-08 08:29:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-08 08:29:12,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:12,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:29:12,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -779727274, now seen corresponding path program 1 times [2025-02-08 08:29:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110015678] [2025-02-08 08:29:12,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:12,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:29:12,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:29:12,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110015678] [2025-02-08 08:29:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110015678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:29:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882435809] [2025-02-08 08:29:12,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:12,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:12,874 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-02-08 08:29:12,877 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-02-08 08:29:12,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:29:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:29:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:12,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:12,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:29:12,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:29:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:13,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:29:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882435809] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:29:13,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:29:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:29:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161849719] [2025-02-08 08:29:13,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:29:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:29:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:13,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:29:13,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:29:13,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-02-08 08:29:13,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:13,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:13,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-02-08 08:29:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:13,171 INFO L124 PetriNetUnfolderBase]: 43/141 cut-off events. [2025-02-08 08:29:13,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:13,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 141 events. 43/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 528 event pairs, 42 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 249. Up to 102 conditions per place. [2025-02-08 08:29:13,174 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2025-02-08 08:29:13,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 124 flow [2025-02-08 08:29:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:29:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:29:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-02-08 08:29:13,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-02-08 08:29:13,177 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 70 flow. Second operand 6 states and 96 transitions. [2025-02-08 08:29:13,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 124 flow [2025-02-08 08:29:13,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 120 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:13,179 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2025-02-08 08:29:13,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-02-08 08:29:13,180 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-02-08 08:29:13,180 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2025-02-08 08:29:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:13,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:13,181 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:13,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:29:13,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:13,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 25313246, now seen corresponding path program 2 times [2025-02-08 08:29:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589985379] [2025-02-08 08:29:13,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:29:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:13,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:29:13,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-02-08 08:29:13,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:29:13,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:29:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589985379] [2025-02-08 08:29:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589985379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:29:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480374038] [2025-02-08 08:29:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:13,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:13,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-02-08 08:29:13,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-02-08 08:29:13,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:13,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-02-08 08:29:13,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:13,645 INFO L124 PetriNetUnfolderBase]: 43/137 cut-off events. [2025-02-08 08:29:13,645 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:29:13,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 137 events. 43/137 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 504 event pairs, 42 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 236. Up to 105 conditions per place. [2025-02-08 08:29:13,646 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 20 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-02-08 08:29:13,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 140 flow [2025-02-08 08:29:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-08 08:29:13,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2025-02-08 08:29:13,649 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 3 states and 49 transitions. [2025-02-08 08:29:13,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 140 flow [2025-02-08 08:29:13,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 126 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:13,652 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 86 flow [2025-02-08 08:29:13,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-08 08:29:13,654 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-02-08 08:29:13,654 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 86 flow [2025-02-08 08:29:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-02-08 08:29:13,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:13,654 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:29:13,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 25313247, now seen corresponding path program 1 times [2025-02-08 08:29:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711459742] [2025-02-08 08:29:13,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:13,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:29:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:29:13,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:13,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711459742] [2025-02-08 08:29:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711459742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:29:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289084728] [2025-02-08 08:29:13,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:13,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:13,791 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-02-08 08:29:13,793 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-02-08 08:29:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:29:13,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:29:13,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:13,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:29:13,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:29:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:13,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:29:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:29:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289084728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:29:13,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:29:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 08:29:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075749194] [2025-02-08 08:29:13,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:29:13,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:29:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:13,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:29:13,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:29:13,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-02-08 08:29:13,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 86 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-08 08:29:13,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:13,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-02-08 08:29:13,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:14,073 INFO L124 PetriNetUnfolderBase]: 43/143 cut-off events. [2025-02-08 08:29:14,073 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 08:29:14,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 143 events. 43/143 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 504 event pairs, 42 based on Foata normal form. 6/140 useless extension candidates. Maximal degree in co-relation 276. Up to 102 conditions per place. [2025-02-08 08:29:14,075 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2025-02-08 08:29:14,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 176 flow [2025-02-08 08:29:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:29:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:29:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2025-02-08 08:29:14,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2025-02-08 08:29:14,077 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 86 flow. Second operand 12 states and 177 transitions. [2025-02-08 08:29:14,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 176 flow [2025-02-08 08:29:14,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:14,079 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 169 flow [2025-02-08 08:29:14,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-02-08 08:29:14,080 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-02-08 08:29:14,080 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 169 flow [2025-02-08 08:29:14,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-08 08:29:14,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:14,081 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:14,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:29:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:29:14,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -649777953, now seen corresponding path program 2 times [2025-02-08 08:29:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955372832] [2025-02-08 08:29:14,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:29:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:14,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 08:29:14,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 17 statements. [2025-02-08 08:29:14,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:29:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 08:29:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955372832] [2025-02-08 08:29:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955372832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045991747] [2025-02-08 08:29:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:14,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:29:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:14,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:29:14,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:29:14,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-02-08 08:29:14,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:14,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:14,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-02-08 08:29:14,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:14,560 INFO L124 PetriNetUnfolderBase]: 43/139 cut-off events. [2025-02-08 08:29:14,560 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 08:29:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 139 events. 43/139 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 462 event pairs, 36 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 295. Up to 86 conditions per place. [2025-02-08 08:29:14,561 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 27 selfloop transitions, 3 changer transitions 3/40 dead transitions. [2025-02-08 08:29:14,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 40 transitions, 243 flow [2025-02-08 08:29:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:29:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:29:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-08 08:29:14,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2025-02-08 08:29:14,563 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 169 flow. Second operand 4 states and 65 transitions. [2025-02-08 08:29:14,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 40 transitions, 243 flow [2025-02-08 08:29:14,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 195 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-08 08:29:14,566 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 123 flow [2025-02-08 08:29:14,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-02-08 08:29:14,567 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-02-08 08:29:14,567 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 123 flow [2025-02-08 08:29:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:14,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:14,567 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:14,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:29:14,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -649532924, now seen corresponding path program 1 times [2025-02-08 08:29:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305634978] [2025-02-08 08:29:14,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:14,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:14,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:14,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:14,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 08:29:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305634978] [2025-02-08 08:29:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305634978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:14,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215984340] [2025-02-08 08:29:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:29:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:29:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:29:14,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-08 08:29:14,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-08 08:29:14,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:14,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-08 08:29:14,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:14,805 INFO L124 PetriNetUnfolderBase]: 43/137 cut-off events. [2025-02-08 08:29:14,806 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 08:29:14,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 137 events. 43/137 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 465 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 278. Up to 90 conditions per place. [2025-02-08 08:29:14,810 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 32 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-02-08 08:29:14,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 203 flow [2025-02-08 08:29:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:29:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:29:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-02-08 08:29:14,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:29:14,811 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 123 flow. Second operand 4 states and 58 transitions. [2025-02-08 08:29:14,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 203 flow [2025-02-08 08:29:14,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 195 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:29:14,814 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 117 flow [2025-02-08 08:29:14,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2025-02-08 08:29:14,815 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2025-02-08 08:29:14,815 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 117 flow [2025-02-08 08:29:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-08 08:29:14,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:14,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:29:14,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -649532923, now seen corresponding path program 1 times [2025-02-08 08:29:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339775965] [2025-02-08 08:29:14,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:29:14,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:29:14,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:14,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 08:29:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339775965] [2025-02-08 08:29:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339775965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:15,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364391665] [2025-02-08 08:29:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:15,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:29:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:15,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:29:15,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:29:15,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-02-08 08:29:15,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:15,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:15,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-02-08 08:29:15,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:15,203 INFO L124 PetriNetUnfolderBase]: 43/122 cut-off events. [2025-02-08 08:29:15,204 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-02-08 08:29:15,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 122 events. 43/122 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 329 event pairs, 25 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 263. Up to 90 conditions per place. [2025-02-08 08:29:15,206 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2025-02-08 08:29:15,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 195 flow [2025-02-08 08:29:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:29:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:29:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-08 08:29:15,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-02-08 08:29:15,209 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 117 flow. Second operand 4 states and 66 transitions. [2025-02-08 08:29:15,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 195 flow [2025-02-08 08:29:15,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:15,215 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 112 flow [2025-02-08 08:29:15,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2025-02-08 08:29:15,216 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-02-08 08:29:15,216 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 112 flow [2025-02-08 08:29:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:29:15,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:15,216 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:29:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:29:15,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-02-08 08:29:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash 665675711, now seen corresponding path program 1 times [2025-02-08 08:29:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:15,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699657636] [2025-02-08 08:29:15,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:15,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:15,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:29:15,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:29:15,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:15,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 08:29:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699657636] [2025-02-08 08:29:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699657636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:29:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269353827] [2025-02-08 08:29:15,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:15,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:15,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2025-02-08 08:29:15,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-02-08 08:29:15,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:15,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2025-02-08 08:29:15,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:15,341 INFO L124 PetriNetUnfolderBase]: 37/104 cut-off events. [2025-02-08 08:29:15,341 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 08:29:15,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 104 events. 37/104 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 36 based on Foata normal form. 7/110 useless extension candidates. Maximal degree in co-relation 238. Up to 98 conditions per place. [2025-02-08 08:29:15,342 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-02-08 08:29:15,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 28 transitions, 162 flow [2025-02-08 08:29:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-08 08:29:15,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2025-02-08 08:29:15,344 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 112 flow. Second operand 3 states and 50 transitions. [2025-02-08 08:29:15,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 28 transitions, 162 flow [2025-02-08 08:29:15,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 28 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:15,348 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2025-02-08 08:29:15,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2025-02-08 08:29:15,349 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2025-02-08 08:29:15,349 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2025-02-08 08:29:15,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-02-08 08:29:15,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-02-08 08:29:15,353 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-08 08:29:15,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-08 08:29:15,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-02-08 08:29:15,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-02-08 08:29:15,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-02-08 08:29:15,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-02-08 08:29:15,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-02-08 08:29:15,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-02-08 08:29:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-02-08 08:29:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-02-08 08:29:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-08 08:29:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-08 08:29:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-02-08 08:29:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:29:15,359 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-08 08:29:15,362 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:29:15,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:29:15,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:29:15 BasicIcfg [2025-02-08 08:29:15,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:29:15,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:29:15,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:29:15,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:29:15,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:11" (3/4) ... [2025-02-08 08:29:15,371 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:29:15,373 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 08:29:15,379 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-02-08 08:29:15,379 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-08 08:29:15,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 08:29:15,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:29:15,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:29:15,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:29:15,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:29:15,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:29:15,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:29:15,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:29:15,463 INFO L158 Benchmark]: Toolchain (without parser) took 4894.43ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 105.2MB in the beginning and 229.7MB in the end (delta: -124.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2025-02-08 08:29:15,464 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:15,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.64ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 76.3MB in the end (delta: 28.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 08:29:15,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 73.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:15,464 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:15,465 INFO L158 Benchmark]: IcfgBuilder took 868.76ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 44.6MB in the end (delta: 27.2MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-02-08 08:29:15,466 INFO L158 Benchmark]: TraceAbstraction took 3382.22ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 43.9MB in the beginning and 235.7MB in the end (delta: -191.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2025-02-08 08:29:15,466 INFO L158 Benchmark]: Witness Printer took 94.37ms. Allocated memory is still 352.3MB. Free memory was 235.7MB in the beginning and 229.7MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:15,468 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.29ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.64ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 76.3MB in the end (delta: 28.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 73.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 868.76ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 44.6MB in the end (delta: 27.2MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3382.22ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 43.9MB in the beginning and 235.7MB in the end (delta: -191.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 94.37ms. Allocated memory is still 352.3MB. Free memory was 235.7MB in the beginning and 229.7MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 935]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 42 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 12 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 128 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 230/263 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:29:15,484 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