./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:00:49,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:00:49,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:00:49,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:00:49,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:00:49,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:00:49,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:00:49,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:00:49,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:00:49,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:00:49,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:00:49,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:00:49,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:00:49,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:00:49,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:00:49,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:00:49,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-03-17 14:00:49,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:00:49,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:00:49,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:00:49,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:00:49,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:00:49,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-03-17 14:00:50,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00401d7f/75a02829c75e4ded9698faa4754b0b54/FLAG24db8ac96 [2025-03-17 14:00:51,155 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:00:51,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-03-17 14:00:51,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00401d7f/75a02829c75e4ded9698faa4754b0b54/FLAG24db8ac96 [2025-03-17 14:00:51,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00401d7f/75a02829c75e4ded9698faa4754b0b54 [2025-03-17 14:00:51,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:00:51,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:00:51,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:00:51,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:00:51,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:00:51,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574dfba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51, skipping insertion in model container [2025-03-17 14:00:51,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:00:51,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:00:51,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:00:51,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:00:51,712 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:00:51,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51 WrapperNode [2025-03-17 14:00:51,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:00:51,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:00:51,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:00:51,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:00:51,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,739 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-03-17 14:00:51,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:00:51,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:00:51,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:00:51,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:00:51,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,757 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-17 14:00:51,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:00:51,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:00:51,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:00:51,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:00:51,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (1/1) ... [2025-03-17 14:00:51,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:00:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:00:51,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:00:51,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:00:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:00:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:00:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:00:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 14:00:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:00:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:00:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:00:51,809 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:00:51,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:00:51,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:00:52,041 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:00:52,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:00:52,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:00:52,144 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:00:52,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:00:52 BoogieIcfgContainer [2025-03-17 14:00:52,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:00:52,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:00:52,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:00:52,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:00:52,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:00:51" (1/3) ... [2025-03-17 14:00:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:00:52, skipping insertion in model container [2025-03-17 14:00:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:00:51" (2/3) ... [2025-03-17 14:00:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:00:52, skipping insertion in model container [2025-03-17 14:00:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:00:52" (3/3) ... [2025-03-17 14:00:52,155 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-03-17 14:00:52,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:00:52,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 14:00:52,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:00:52,205 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:00:52,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 26 transitions, 56 flow [2025-03-17 14:00:52,250 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-17 14:00:52,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:52,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 43 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-17 14:00:52,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 26 transitions, 56 flow [2025-03-17 14:00:52,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 26 transitions, 56 flow [2025-03-17 14:00:52,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:00:52,269 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;@5b086345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:00:52,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:00:52,271 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:00:52,271 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:00:52,271 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:52,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:52,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:52,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-17 14:00:52,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 189740, now seen corresponding path program 1 times [2025-03-17 14:00:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983680931] [2025-03-17 14:00:52,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:52,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983680931] [2025-03-17 14:00:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983680931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:00:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873770654] [2025-03-17 14:00:52,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:52,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:00:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:52,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:00:52,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:00:52,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2025-03-17 14:00:52,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:52,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:52,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2025-03-17 14:00:52,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:52,503 INFO L124 PetriNetUnfolderBase]: 17/65 cut-off events. [2025-03-17 14:00:52,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 65 events. 17/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 158 event pairs, 14 based on Foata normal form. 6/68 useless extension candidates. Maximal degree in co-relation 101. Up to 44 conditions per place. [2025-03-17 14:00:52,505 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 12 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-03-17 14:00:52,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 68 flow [2025-03-17 14:00:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:00:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:00:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-03-17 14:00:52,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-03-17 14:00:52,518 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 56 flow. Second operand 2 states and 33 transitions. [2025-03-17 14:00:52,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 68 flow [2025-03-17 14:00:52,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:52,524 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-03-17 14:00:52,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-03-17 14:00:52,530 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-03-17 14:00:52,530 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-03-17 14:00:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:52,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:52,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:00:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:00:52,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-17 14:00:52,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1359515862, now seen corresponding path program 1 times [2025-03-17 14:00:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844549303] [2025-03-17 14:00:52,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:52,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:52,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:52,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:00:52,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:52,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:52,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:52,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:52,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:00:52,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:00:52,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-17 14:00:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-17 14:00:52,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-17 14:00:52,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:00:52,604 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 14:00:52,607 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:00:52,608 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:00:52,631 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:00:52,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 100 flow [2025-03-17 14:00:52,649 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-03-17 14:00:52,649 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:00:52,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2025-03-17 14:00:52,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 45 transitions, 100 flow [2025-03-17 14:00:52,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 100 flow [2025-03-17 14:00:52,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:00:52,653 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;@5b086345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:00:52,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 14:00:52,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:00:52,654 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:00:52,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:52,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:52,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:52,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:00:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 234425, now seen corresponding path program 1 times [2025-03-17 14:00:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102411617] [2025-03-17 14:00:52,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:52,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:52,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:52,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102411617] [2025-03-17 14:00:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102411617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:00:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606396806] [2025-03-17 14:00:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:00:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:52,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:00:52,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:00:52,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-03-17 14:00:52,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:52,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:52,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-03-17 14:00:52,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:52,830 INFO L124 PetriNetUnfolderBase]: 345/762 cut-off events. [2025-03-17 14:00:52,830 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 14:00:52,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 762 events. 345/762 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4034 event pairs, 294 based on Foata normal form. 99/835 useless extension candidates. Maximal degree in co-relation 757. Up to 564 conditions per place. [2025-03-17 14:00:52,835 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-17 14:00:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 124 flow [2025-03-17 14:00:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:00:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:00:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2025-03-17 14:00:52,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-17 14:00:52,837 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 100 flow. Second operand 2 states and 58 transitions. [2025-03-17 14:00:52,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 124 flow [2025-03-17 14:00:52,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:52,838 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 82 flow [2025-03-17 14:00:52,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-17 14:00:52,839 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-03-17 14:00:52,839 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 82 flow [2025-03-17 14:00:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:52,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:52,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:00:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:00:52,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:00:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1603640205, now seen corresponding path program 1 times [2025-03-17 14:00:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996890566] [2025-03-17 14:00:52,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:52,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:52,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:52,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996890566] [2025-03-17 14:00:52,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996890566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:00:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309085160] [2025-03-17 14:00:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:52,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:00:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:52,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:00:52,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:00:52,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-17 14:00:52,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:52,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:52,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-17 14:00:52,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:53,091 INFO L124 PetriNetUnfolderBase]: 345/749 cut-off events. [2025-03-17 14:00:53,091 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 14:00:53,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 749 events. 345/749 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3886 event pairs, 294 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 1338. Up to 563 conditions per place. [2025-03-17 14:00:53,096 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-17 14:00:53,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2025-03-17 14:00:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:00:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:00:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-17 14:00:53,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-17 14:00:53,097 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 82 flow. Second operand 3 states and 65 transitions. [2025-03-17 14:00:53,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2025-03-17 14:00:53,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:53,099 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2025-03-17 14:00:53,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-17 14:00:53,100 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-03-17 14:00:53,100 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2025-03-17 14:00:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:53,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:53,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:00:53,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:00:53,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:00:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1603640204, now seen corresponding path program 1 times [2025-03-17 14:00:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:53,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488588655] [2025-03-17 14:00:53,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:53,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:53,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:53,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488588655] [2025-03-17 14:00:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488588655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:00:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031075191] [2025-03-17 14:00:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:00:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:53,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:00:53,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:00:53,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-17 14:00:53,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:53,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:53,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-17 14:00:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:53,526 INFO L124 PetriNetUnfolderBase]: 646/1366 cut-off events. [2025-03-17 14:00:53,526 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 14:00:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 1366 events. 646/1366 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7735 event pairs, 188 based on Foata normal form. 27/1359 useless extension candidates. Maximal degree in co-relation 2467. Up to 420 conditions per place. [2025-03-17 14:00:53,532 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-17 14:00:53,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 246 flow [2025-03-17 14:00:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:00:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:00:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-17 14:00:53,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-03-17 14:00:53,534 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 5 states and 127 transitions. [2025-03-17 14:00:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 246 flow [2025-03-17 14:00:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:00:53,536 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-03-17 14:00:53,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-17 14:00:53,536 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-03-17 14:00:53,536 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-03-17 14:00:53,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:53,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:53,537 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-17 14:00:53,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:00:53,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-17 14:00:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1703352636, now seen corresponding path program 1 times [2025-03-17 14:00:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13057389] [2025-03-17 14:00:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:53,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:00:53,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:00:53,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:53,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:53,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:00:53,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:00:53,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:00:53,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:53,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:53,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:00:53,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:00:53,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 14:00:53,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-03-17 14:00:53,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-03-17 14:00:53,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-03-17 14:00:53,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-03-17 14:00:53,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:00:53,554 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:00:53,554 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:00:53,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:00:53,585 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:00:53,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 146 flow [2025-03-17 14:00:53,591 INFO L124 PetriNetUnfolderBase]: 9/78 cut-off events. [2025-03-17 14:00:53,591 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:00:53,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 78 events. 9/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 213 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-03-17 14:00:53,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 64 transitions, 146 flow [2025-03-17 14:00:53,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 64 transitions, 146 flow [2025-03-17 14:00:53,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:00:53,593 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;@5b086345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:00:53,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:00:53,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:00:53,594 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:00:53,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:53,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:53,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:53,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:00:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 297977, now seen corresponding path program 1 times [2025-03-17 14:00:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456453378] [2025-03-17 14:00:53,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:53,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456453378] [2025-03-17 14:00:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456453378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:53,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:00:53,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379188442] [2025-03-17 14:00:53,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:53,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:00:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:53,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:00:53,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:00:53,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2025-03-17 14:00:53,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:53,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:53,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2025-03-17 14:00:53,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:54,115 INFO L124 PetriNetUnfolderBase]: 4505/7966 cut-off events. [2025-03-17 14:00:54,116 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-17 14:00:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14512 conditions, 7966 events. 4505/7966 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 55902 event pairs, 3878 based on Foata normal form. 1212/8912 useless extension candidates. Maximal degree in co-relation 3003. Up to 6260 conditions per place. [2025-03-17 14:00:54,161 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 30 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-03-17 14:00:54,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 182 flow [2025-03-17 14:00:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:00:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:00:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2025-03-17 14:00:54,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2025-03-17 14:00:54,164 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 146 flow. Second operand 2 states and 83 transitions. [2025-03-17 14:00:54,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 182 flow [2025-03-17 14:00:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:54,167 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 120 flow [2025-03-17 14:00:54,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-17 14:00:54,169 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-03-17 14:00:54,169 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 120 flow [2025-03-17 14:00:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:54,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:54,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:00:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:00:54,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:00:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 290237217, now seen corresponding path program 1 times [2025-03-17 14:00:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720979958] [2025-03-17 14:00:54,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:54,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:54,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720979958] [2025-03-17 14:00:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720979958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:00:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147095359] [2025-03-17 14:00:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:54,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:00:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:00:54,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:00:54,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-03-17 14:00:54,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:54,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:54,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-03-17 14:00:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:54,781 INFO L124 PetriNetUnfolderBase]: 4505/7857 cut-off events. [2025-03-17 14:00:54,781 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-17 14:00:54,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14340 conditions, 7857 events. 4505/7857 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54032 event pairs, 3878 based on Foata normal form. 0/7700 useless extension candidates. Maximal degree in co-relation 14334. Up to 6259 conditions per place. [2025-03-17 14:00:54,813 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 29 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-03-17 14:00:54,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 174 flow [2025-03-17 14:00:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:00:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:00:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-17 14:00:54,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-03-17 14:00:54,814 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 120 flow. Second operand 3 states and 93 transitions. [2025-03-17 14:00:54,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 174 flow [2025-03-17 14:00:54,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:00:54,816 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 116 flow [2025-03-17 14:00:54,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-03-17 14:00:54,816 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-17 14:00:54,817 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 116 flow [2025-03-17 14:00:54,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:54,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:54,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:00:54,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:00:54,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:00:54,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash 290237218, now seen corresponding path program 1 times [2025-03-17 14:00:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47931773] [2025-03-17 14:00:54,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:54,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:00:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:00:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47931773] [2025-03-17 14:00:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47931773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:54,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:00:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990469367] [2025-03-17 14:00:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:54,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:00:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:54,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:00:54,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:00:54,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-17 14:00:54,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:54,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:54,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-17 14:00:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:55,747 INFO L124 PetriNetUnfolderBase]: 8446/14371 cut-off events. [2025-03-17 14:00:55,748 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-03-17 14:00:55,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26519 conditions, 14371 events. 8446/14371 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 104364 event pairs, 1830 based on Foata normal form. 219/14313 useless extension candidates. Maximal degree in co-relation 26512. Up to 4692 conditions per place. [2025-03-17 14:00:55,802 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 72 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-03-17 14:00:55,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 382 flow [2025-03-17 14:00:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:00:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:00:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-03-17 14:00:55,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.590625 [2025-03-17 14:00:55,806 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 116 flow. Second operand 5 states and 189 transitions. [2025-03-17 14:00:55,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 382 flow [2025-03-17 14:00:55,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:00:55,808 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 142 flow [2025-03-17 14:00:55,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-17 14:00:55,809 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-03-17 14:00:55,810 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 142 flow [2025-03-17 14:00:55,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:55,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:55,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:00:55,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:00:55,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:00:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 109163028, now seen corresponding path program 1 times [2025-03-17 14:00:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059154757] [2025-03-17 14:00:55,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:55,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:00:55,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:00:55,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:55,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:55,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059154757] [2025-03-17 14:00:55,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059154757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:55,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:55,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:00:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750836769] [2025-03-17 14:00:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:00:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:55,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:00:55,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:00:55,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-03-17 14:00:55,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:55,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:55,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-03-17 14:00:55,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:00:57,313 INFO L124 PetriNetUnfolderBase]: 14743/24832 cut-off events. [2025-03-17 14:00:57,313 INFO L125 PetriNetUnfolderBase]: For 5578/5944 co-relation queries the response was YES. [2025-03-17 14:00:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49667 conditions, 24832 events. 14743/24832 cut-off events. For 5578/5944 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 191219 event pairs, 3306 based on Foata normal form. 378/24708 useless extension candidates. Maximal degree in co-relation 49658. Up to 8148 conditions per place. [2025-03-17 14:00:57,549 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-17 14:00:57,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 446 flow [2025-03-17 14:00:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:00:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:00:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-03-17 14:00:57,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584375 [2025-03-17 14:00:57,551 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 142 flow. Second operand 5 states and 187 transitions. [2025-03-17 14:00:57,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 446 flow [2025-03-17 14:00:57,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:00:57,559 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 168 flow [2025-03-17 14:00:57,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-03-17 14:00:57,560 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-17 14:00:57,561 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 168 flow [2025-03-17 14:00:57,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:57,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:57,561 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-17 14:00:57,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:00:57,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-17 14:00:57,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -325599339, now seen corresponding path program 1 times [2025-03-17 14:00:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711492962] [2025-03-17 14:00:57,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:57,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:00:57,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:00:57,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:57,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:57,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:00:57,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:00:57,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:00:57,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:57,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:00:57,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:00:57,585 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:00:57,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 14:00:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-17 14:00:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-17 14:00:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-17 14:00:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-03-17 14:00:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:00:57,586 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 14:00:57,587 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:00:57,587 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:00:57,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:00:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 194 flow [2025-03-17 14:00:57,620 INFO L124 PetriNetUnfolderBase]: 12/102 cut-off events. [2025-03-17 14:00:57,621 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:00:57,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 102 events. 12/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 305 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-03-17 14:00:57,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 83 transitions, 194 flow [2025-03-17 14:00:57,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 83 transitions, 194 flow [2025-03-17 14:00:57,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:00:57,623 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;@5b086345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:00:57,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 14:00:57,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:00:57,624 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 14:00:57,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:00:57,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:00:57,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:00:57,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:00:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:00:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 380396, now seen corresponding path program 1 times [2025-03-17 14:00:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:00:57,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820106808] [2025-03-17 14:00:57,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:00:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:00:57,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:00:57,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:00:57,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:00:57,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:00:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:00:57,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:00:57,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820106808] [2025-03-17 14:00:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820106808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:00:57,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:00:57,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:00:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570730586] [2025-03-17 14:00:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:00:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:00:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:00:57,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:00:57,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:00:57,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-03-17 14:00:57,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:00:57,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:00:57,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-03-17 14:00:57,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:01,331 INFO L124 PetriNetUnfolderBase]: 50073/77894 cut-off events. [2025-03-17 14:01:01,331 INFO L125 PetriNetUnfolderBase]: For 6566/6566 co-relation queries the response was YES. [2025-03-17 14:01:01,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144857 conditions, 77894 events. 50073/77894 cut-off events. For 6566/6566 co-relation queries the response was YES. Maximal size of possible extension queue 2514. Compared 629709 event pairs, 43302 based on Foata normal form. 13184/88879 useless extension candidates. Maximal degree in co-relation 14586. Up to 64116 conditions per place. [2025-03-17 14:01:01,728 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 39 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2025-03-17 14:01:01,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 242 flow [2025-03-17 14:01:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2025-03-17 14:01:01,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506024096385542 [2025-03-17 14:01:01,730 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 194 flow. Second operand 2 states and 108 transitions. [2025-03-17 14:01:01,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 242 flow [2025-03-17 14:01:01,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:01,734 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 158 flow [2025-03-17 14:01:01,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-03-17 14:01:01,735 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2025-03-17 14:01:01,735 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 158 flow [2025-03-17 14:01:01,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:01,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:01,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:01,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:01:01,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:01,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1548749119, now seen corresponding path program 1 times [2025-03-17 14:01:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:01,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416328369] [2025-03-17 14:01:01,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:01,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:01,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:01,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:01,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:01,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416328369] [2025-03-17 14:01:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416328369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869223020] [2025-03-17 14:01:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:01,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:01,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:01,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:01,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-03-17 14:01:01,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:01,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:01,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-03-17 14:01:01,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:05,700 INFO L124 PetriNetUnfolderBase]: 50073/77017 cut-off events. [2025-03-17 14:01:05,700 INFO L125 PetriNetUnfolderBase]: For 2842/2842 co-relation queries the response was YES. [2025-03-17 14:01:05,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142893 conditions, 77017 events. 50073/77017 cut-off events. For 2842/2842 co-relation queries the response was YES. Maximal size of possible extension queue 2457. Compared 610082 event pairs, 43302 based on Foata normal form. 0/75695 useless extension candidates. Maximal degree in co-relation 142886. Up to 64115 conditions per place. [2025-03-17 14:01:06,147 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 38 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-17 14:01:06,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 228 flow [2025-03-17 14:01:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-03-17 14:01:06,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4859437751004016 [2025-03-17 14:01:06,148 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 158 flow. Second operand 3 states and 121 transitions. [2025-03-17 14:01:06,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 228 flow [2025-03-17 14:01:06,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:06,153 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 152 flow [2025-03-17 14:01:06,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-03-17 14:01:06,154 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-03-17 14:01:06,154 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 152 flow [2025-03-17 14:01:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:06,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:06,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:01:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:01:06,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1548749118, now seen corresponding path program 1 times [2025-03-17 14:01:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415659305] [2025-03-17 14:01:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:06,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:01:06,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:01:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415659305] [2025-03-17 14:01:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415659305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901703856] [2025-03-17 14:01:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:06,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:06,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:06,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-17 14:01:06,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:06,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:06,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-17 14:01:06,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:13,663 INFO L124 PetriNetUnfolderBase]: 93886/142063 cut-off events. [2025-03-17 14:01:13,663 INFO L125 PetriNetUnfolderBase]: For 3681/3681 co-relation queries the response was YES. [2025-03-17 14:01:13,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265572 conditions, 142063 events. 93886/142063 cut-off events. For 3681/3681 co-relation queries the response was YES. Maximal size of possible extension queue 3591. Compared 1172211 event pairs, 20774 based on Foata normal form. 1755/141339 useless extension candidates. Maximal degree in co-relation 265564. Up to 48084 conditions per place. [2025-03-17 14:01:14,510 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 99 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-03-17 14:01:14,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 518 flow [2025-03-17 14:01:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-03-17 14:01:14,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-03-17 14:01:14,511 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 152 flow. Second operand 5 states and 251 transitions. [2025-03-17 14:01:14,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 518 flow [2025-03-17 14:01:14,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:14,515 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 178 flow [2025-03-17 14:01:14,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-03-17 14:01:14,516 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2025-03-17 14:01:14,516 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 178 flow [2025-03-17 14:01:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:14,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:14,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:01:14,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-17 14:01:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash 938207225, now seen corresponding path program 1 times [2025-03-17 14:01:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734610530] [2025-03-17 14:01:14,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:01:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:01:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:14,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734610530] [2025-03-17 14:01:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734610530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:14,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870545269] [2025-03-17 14:01:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:14,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:14,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:14,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-03-17 14:01:14,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:14,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:14,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-03-17 14:01:14,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand