./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:11:50,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:11:50,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:11:50,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:11:50,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:11:50,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:11:50,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:11:50,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:11:50,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:11:50,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:11:50,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:11:50,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:11:50,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:11:50,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:11:50,411 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:11:50,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:11:50,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:11:50,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:11:50,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:11:50,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:11:50,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:11:50,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:11:50,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:11:50,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:11:50,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:11:50,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:11:50,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:50,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:11:50,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:11:50,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:11:50,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:11:50,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:11:50,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:11:50,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:11:50,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:11:50,415 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-02-08 08:11:50,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:11:50,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:11:50,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:11:50,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:11:50,738 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:11:50,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-08 08:11:52,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cf96155b/92137dd89f5e407aaef48581e2667b6f/FLAG8fb1bdba7 [2025-02-08 08:11:52,309 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:11:52,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-08 08:11:52,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cf96155b/92137dd89f5e407aaef48581e2667b6f/FLAG8fb1bdba7 [2025-02-08 08:11:52,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cf96155b/92137dd89f5e407aaef48581e2667b6f [2025-02-08 08:11:52,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:11:52,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:11:52,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:52,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:11:52,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:11:52,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:52" (1/1) ... [2025-02-08 08:11:52,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26046535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:52, skipping insertion in model container [2025-02-08 08:11:52,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:11:52" (1/1) ... [2025-02-08 08:11:52,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:11:52,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:52,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:11:53,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:11:53,048 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:11:53,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53 WrapperNode [2025-02-08 08:11:53,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:11:53,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:53,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:11:53,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:11:53,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,088 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-02-08 08:11:53,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:11:53,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:11:53,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:11:53,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:11:53,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,121 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-02-08 08:11:53,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:11:53,138 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:11:53,138 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:11:53,138 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:11:53,139 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (1/1) ... [2025-02-08 08:11:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:11:53,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:11:53,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:11:53,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:11:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:11:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:11:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:11:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:11:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:11:53,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:11:53,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:11:53,197 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:11:53,309 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:11:53,311 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:11:53,474 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:11:53,474 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:11:53,610 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:11:53,611 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:11:53,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:53 BoogieIcfgContainer [2025-02-08 08:11:53,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:11:53,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:11:53,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:11:53,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:11:53,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:11:52" (1/3) ... [2025-02-08 08:11:53,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857c216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:53, skipping insertion in model container [2025-02-08 08:11:53,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:11:53" (2/3) ... [2025-02-08 08:11:53,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857c216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:11:53, skipping insertion in model container [2025-02-08 08:11:53,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:11:53" (3/3) ... [2025-02-08 08:11:53,620 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-02-08 08:11:53,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:11:53,636 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-02-08 08:11:53,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:11:53,684 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:53,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 26 transitions, 56 flow [2025-02-08 08:11:53,742 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-08 08:11:53,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:53,749 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-02-08 08:11:53,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 26 transitions, 56 flow [2025-02-08 08:11:53,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 26 transitions, 56 flow [2025-02-08 08:11:53,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:53,785 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;@57af0a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:53,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:11:53,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:53,791 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:53,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:53,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:53,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:53,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:11:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 189740, now seen corresponding path program 1 times [2025-02-08 08:11:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-02-08 08:11:53,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:53,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:53,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699789365] [2025-02-08 08:11:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699789365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155488843] [2025-02-08 08:11:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:53,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:53,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:53,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2025-02-08 08:11:53,995 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-02-08 08:11:53,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:53,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2025-02-08 08:11:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:54,045 INFO L124 PetriNetUnfolderBase]: 17/65 cut-off events. [2025-02-08 08:11:54,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:54,048 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-02-08 08:11:54,049 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 12 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-02-08 08:11:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 68 flow [2025-02-08 08:11:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-02-08 08:11:54,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-02-08 08:11:54,061 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 56 flow. Second operand 2 states and 33 transitions. [2025-02-08 08:11:54,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 68 flow [2025-02-08 08:11:54,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:54,066 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-02-08 08:11:54,068 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-02-08 08:11:54,071 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-02-08 08:11:54,072 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-02-08 08:11:54,072 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-02-08 08:11:54,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:54,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:11:54,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:11:54,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:11:54,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1359515862, now seen corresponding path program 1 times [2025-02-08 08:11:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101603010] [2025-02-08 08:11:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:54,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:54,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:54,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:54,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:54,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:54,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:54,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:54,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:54,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-08 08:11:54,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-02-08 08:11:54,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-02-08 08:11:54,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-02-08 08:11:54,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-08 08:11:54,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-02-08 08:11:54,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-02-08 08:11:54,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-08 08:11:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:11:54,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:11:54,170 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:54,171 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:11:54,203 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:54,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 100 flow [2025-02-08 08:11:54,229 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-02-08 08:11:54,231 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:11:54,232 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-02-08 08:11:54,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 45 transitions, 100 flow [2025-02-08 08:11:54,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 100 flow [2025-02-08 08:11:54,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:54,236 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;@57af0a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:54,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 08:11:54,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:54,239 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:54,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:54,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:54,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:54,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-08 08:11:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash 234425, now seen corresponding path program 1 times [2025-02-08 08:11:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-02-08 08:11:54,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:54,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:54,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-02-08 08:11:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709641450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:54,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288609694] [2025-02-08 08:11:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:54,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:54,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:54,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-02-08 08:11:54,289 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-02-08 08:11:54,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:54,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-02-08 08:11:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:54,473 INFO L124 PetriNetUnfolderBase]: 345/762 cut-off events. [2025-02-08 08:11:54,473 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:11:54,477 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-02-08 08:11:54,484 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-02-08 08:11:54,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 124 flow [2025-02-08 08:11:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2025-02-08 08:11:54,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-02-08 08:11:54,486 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 100 flow. Second operand 2 states and 58 transitions. [2025-02-08 08:11:54,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 124 flow [2025-02-08 08:11:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:54,488 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 82 flow [2025-02-08 08:11:54,488 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-02-08 08:11:54,490 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-02-08 08:11:54,490 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 82 flow [2025-02-08 08:11:54,491 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-02-08 08:11:54,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:54,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:54,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:11:54,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-08 08:11:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1603640205, now seen corresponding path program 1 times [2025-02-08 08:11:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291720972] [2025-02-08 08:11:54,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:54,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:54,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:54,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:54,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291720972] [2025-02-08 08:11:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291720972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:54,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:11:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039753068] [2025-02-08 08:11:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:54,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:54,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:54,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:54,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-08 08:11:54,628 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-02-08 08:11:54,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:54,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-08 08:11:54,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:54,743 INFO L124 PetriNetUnfolderBase]: 345/749 cut-off events. [2025-02-08 08:11:54,744 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:11:54,745 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-02-08 08:11:54,749 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-02-08 08:11:54,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2025-02-08 08:11:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-08 08:11:54,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-02-08 08:11:54,751 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 82 flow. Second operand 3 states and 65 transitions. [2025-02-08 08:11:54,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2025-02-08 08:11:54,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:54,753 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2025-02-08 08:11:54,753 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-02-08 08:11:54,753 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-02-08 08:11:54,754 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2025-02-08 08:11:54,754 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-02-08 08:11:54,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:54,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:11:54,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-08 08:11:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1603640204, now seen corresponding path program 1 times [2025-02-08 08:11:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640076868] [2025-02-08 08:11:54,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:54,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:54,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:54,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:54,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640076868] [2025-02-08 08:11:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640076868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:54,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:11:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408141175] [2025-02-08 08:11:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:54,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:11:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:11:54,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:11:55,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-02-08 08:11:55,023 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-02-08 08:11:55,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:55,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-02-08 08:11:55,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:55,287 INFO L124 PetriNetUnfolderBase]: 646/1366 cut-off events. [2025-02-08 08:11:55,287 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 08:11:55,289 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-02-08 08:11:55,296 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-02-08 08:11:55,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 246 flow [2025-02-08 08:11:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:11:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:11:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-08 08:11:55,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-02-08 08:11:55,298 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 5 states and 127 transitions. [2025-02-08 08:11:55,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 246 flow [2025-02-08 08:11:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:11:55,302 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-02-08 08:11:55,302 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-02-08 08:11:55,303 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-02-08 08:11:55,304 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-02-08 08:11:55,304 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-02-08 08:11:55,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:55,304 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:11:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:11:55,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-08 08:11:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1703352636, now seen corresponding path program 1 times [2025-02-08 08:11:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519609795] [2025-02-08 08:11:55,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:55,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:55,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:55,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:11:55,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:55,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:11:55,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:11:55,332 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-02-08 08:11:55,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-02-08 08:11:55,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-02-08 08:11:55,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-02-08 08:11:55,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-02-08 08:11:55,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:11:55,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 08:11:55,333 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:11:55,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:11:55,361 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:11:55,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 146 flow [2025-02-08 08:11:55,370 INFO L124 PetriNetUnfolderBase]: 9/78 cut-off events. [2025-02-08 08:11:55,370 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:11:55,372 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-02-08 08:11:55,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 64 transitions, 146 flow [2025-02-08 08:11:55,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 64 transitions, 146 flow [2025-02-08 08:11:55,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:11:55,376 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;@57af0a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:11:55,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 08:11:55,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:11:55,378 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:11:55,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:11:55,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:55,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:11:55,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-08 08:11:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 297977, now seen corresponding path program 1 times [2025-02-08 08:11:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924368968] [2025-02-08 08:11:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:55,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:11:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:11:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924368968] [2025-02-08 08:11:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924368968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:55,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:11:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273243222] [2025-02-08 08:11:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:55,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:11:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:55,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:11:55,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:11:55,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2025-02-08 08:11:55,396 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-02-08 08:11:55,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:55,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2025-02-08 08:11:55,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:56,176 INFO L124 PetriNetUnfolderBase]: 4505/7966 cut-off events. [2025-02-08 08:11:56,176 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-02-08 08:11:56,193 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-02-08 08:11:56,233 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 30 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-02-08 08:11:56,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 182 flow [2025-02-08 08:11:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:11:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:11:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2025-02-08 08:11:56,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2025-02-08 08:11:56,237 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 146 flow. Second operand 2 states and 83 transitions. [2025-02-08 08:11:56,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 182 flow [2025-02-08 08:11:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:56,239 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 120 flow [2025-02-08 08:11:56,239 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-02-08 08:11:56,241 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-02-08 08:11:56,242 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 120 flow [2025-02-08 08:11:56,242 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-02-08 08:11:56,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:56,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:11:56,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-08 08:11:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 290237217, now seen corresponding path program 1 times [2025-02-08 08:11:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118546909] [2025-02-08 08:11:56,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:56,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:56,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118546909] [2025-02-08 08:11:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118546909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:11:56,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499495535] [2025-02-08 08:11:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:11:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:56,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:11:56,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:11:56,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-02-08 08:11:56,328 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-02-08 08:11:56,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:56,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-02-08 08:11:56,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:56,970 INFO L124 PetriNetUnfolderBase]: 4505/7857 cut-off events. [2025-02-08 08:11:56,971 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-02-08 08:11:56,998 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-02-08 08:11:57,049 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 29 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-02-08 08:11:57,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 174 flow [2025-02-08 08:11:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:11:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:11:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 08:11:57,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-02-08 08:11:57,054 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 120 flow. Second operand 3 states and 93 transitions. [2025-02-08 08:11:57,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 174 flow [2025-02-08 08:11:57,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:11:57,058 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 116 flow [2025-02-08 08:11:57,058 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-02-08 08:11:57,060 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-02-08 08:11:57,060 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 116 flow [2025-02-08 08:11:57,060 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-02-08 08:11:57,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:57,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:11:57,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:11:57,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-08 08:11:57,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:57,062 INFO L85 PathProgramCache]: Analyzing trace with hash 290237218, now seen corresponding path program 1 times [2025-02-08 08:11:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:57,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702302415] [2025-02-08 08:11:57,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:11:57,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:11:57,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702302415] [2025-02-08 08:11:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702302415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:11:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974102202] [2025-02-08 08:11:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:57,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:11:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:11:57,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:11:57,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-02-08 08:11:57,290 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-02-08 08:11:57,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:57,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-02-08 08:11:57,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:11:58,480 INFO L124 PetriNetUnfolderBase]: 8446/14371 cut-off events. [2025-02-08 08:11:58,480 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-02-08 08:11:58,515 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-02-08 08:11:58,578 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 72 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-02-08 08:11:58,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 382 flow [2025-02-08 08:11:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:11:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:11:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-02-08 08:11:58,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.590625 [2025-02-08 08:11:58,580 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 116 flow. Second operand 5 states and 189 transitions. [2025-02-08 08:11:58,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 382 flow [2025-02-08 08:11:58,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:11:58,583 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 142 flow [2025-02-08 08:11:58,583 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-02-08 08:11:58,584 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-02-08 08:11:58,585 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 142 flow [2025-02-08 08:11:58,585 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-02-08 08:11:58,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:11:58,585 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:11:58,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:11:58,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-08 08:11:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:11:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash 109163028, now seen corresponding path program 1 times [2025-02-08 08:11:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:11:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-02-08 08:11:58,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:11:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:11:58,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:11:58,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:11:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:11:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:11:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:11:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:11:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726946089] [2025-02-08 08:11:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726946089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:11:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:11:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:11:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014020176] [2025-02-08 08:11:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:11:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:11:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:11:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:11:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:11:58,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-02-08 08:11:58,846 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-02-08 08:11:58,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:11:58,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-02-08 08:11:58,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:00,644 INFO L124 PetriNetUnfolderBase]: 14743/24832 cut-off events. [2025-02-08 08:12:00,644 INFO L125 PetriNetUnfolderBase]: For 5578/5944 co-relation queries the response was YES. [2025-02-08 08:12:00,679 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-02-08 08:12:00,782 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-02-08 08:12:00,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 446 flow [2025-02-08 08:12:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:12:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:12:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-02-08 08:12:00,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584375 [2025-02-08 08:12:00,784 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 142 flow. Second operand 5 states and 187 transitions. [2025-02-08 08:12:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 446 flow [2025-02-08 08:12:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:00,793 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 168 flow [2025-02-08 08:12:00,793 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-02-08 08:12:00,795 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-02-08 08:12:00,796 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 168 flow [2025-02-08 08:12:00,796 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-02-08 08:12:00,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:00,796 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 08:12:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:12:00,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-08 08:12:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -325599339, now seen corresponding path program 1 times [2025-02-08 08:12:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638341849] [2025-02-08 08:12:00,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:00,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:12:00,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:12:00,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:00,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:12:00,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:12:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:12:00,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:00,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:12:00,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:12:00,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-02-08 08:12:00,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-08 08:12:00,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-02-08 08:12:00,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:12:00,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 08:12:00,824 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:12:00,824 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:12:00,857 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:12:00,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 194 flow [2025-02-08 08:12:00,866 INFO L124 PetriNetUnfolderBase]: 12/102 cut-off events. [2025-02-08 08:12:00,866 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:12:00,866 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-02-08 08:12:00,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 83 transitions, 194 flow [2025-02-08 08:12:00,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 83 transitions, 194 flow [2025-02-08 08:12:00,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:12:00,868 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;@57af0a73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:12:00,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 08:12:00,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:12:00,869 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-08 08:12:00,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:12:00,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:00,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:12:00,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-08 08:12:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 380396, now seen corresponding path program 1 times [2025-02-08 08:12:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889583919] [2025-02-08 08:12:00,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:00,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:12:00,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:12:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889583919] [2025-02-08 08:12:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889583919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:12:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300168339] [2025-02-08 08:12:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:00,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:12:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:00,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:12:00,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:12:00,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-02-08 08:12:00,881 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-02-08 08:12:00,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:00,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-02-08 08:12:00,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:04,991 INFO L124 PetriNetUnfolderBase]: 50073/77894 cut-off events. [2025-02-08 08:12:04,991 INFO L125 PetriNetUnfolderBase]: For 6566/6566 co-relation queries the response was YES. [2025-02-08 08:12:05,096 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-02-08 08:12:05,409 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 39 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2025-02-08 08:12:05,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 242 flow [2025-02-08 08:12:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:12:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:12:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2025-02-08 08:12:05,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506024096385542 [2025-02-08 08:12:05,411 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 194 flow. Second operand 2 states and 108 transitions. [2025-02-08 08:12:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 242 flow [2025-02-08 08:12:05,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:05,419 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 158 flow [2025-02-08 08:12:05,419 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-02-08 08:12:05,420 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2025-02-08 08:12:05,421 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 158 flow [2025-02-08 08:12:05,422 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-02-08 08:12:05,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:05,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:12:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:12:05,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-08 08:12:05,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1548749119, now seen corresponding path program 1 times [2025-02-08 08:12:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187853569] [2025-02-08 08:12:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:05,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:12:05,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:12:05,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:05,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187853569] [2025-02-08 08:12:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187853569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:12:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699684767] [2025-02-08 08:12:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:12:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:05,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:12:05,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:12:05,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-02-08 08:12:05,494 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-02-08 08:12:05,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:05,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-02-08 08:12:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:09,488 INFO L124 PetriNetUnfolderBase]: 50073/77017 cut-off events. [2025-02-08 08:12:09,488 INFO L125 PetriNetUnfolderBase]: For 2842/2842 co-relation queries the response was YES. [2025-02-08 08:12:09,638 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-02-08 08:12:09,912 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 38 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-08 08:12:09,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 228 flow [2025-02-08 08:12:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:12:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:12:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-02-08 08:12:09,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4859437751004016 [2025-02-08 08:12:09,913 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 158 flow. Second operand 3 states and 121 transitions. [2025-02-08 08:12:09,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 228 flow [2025-02-08 08:12:09,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:12:09,919 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 152 flow [2025-02-08 08:12:09,919 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-02-08 08:12:09,920 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-02-08 08:12:09,920 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 152 flow [2025-02-08 08:12:09,920 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-02-08 08:12:09,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:09,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:12:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:12:09,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-08 08:12:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1548749118, now seen corresponding path program 1 times [2025-02-08 08:12:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484719333] [2025-02-08 08:12:09,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:09,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:12:09,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:12:09,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:09,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:10,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484719333] [2025-02-08 08:12:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484719333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:12:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103510098] [2025-02-08 08:12:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:10,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:12:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:12:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:12:10,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-08 08:12:10,328 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-02-08 08:12:10,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:10,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-08 08:12:10,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:12:17,837 INFO L124 PetriNetUnfolderBase]: 93886/142063 cut-off events. [2025-02-08 08:12:17,837 INFO L125 PetriNetUnfolderBase]: For 3681/3681 co-relation queries the response was YES. [2025-02-08 08:12:18,188 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-02-08 08:12:18,653 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 99 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-02-08 08:12:18,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 518 flow [2025-02-08 08:12:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:12:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:12:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-02-08 08:12:18,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-02-08 08:12:18,655 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 152 flow. Second operand 5 states and 251 transitions. [2025-02-08 08:12:18,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 518 flow [2025-02-08 08:12:18,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:12:18,661 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 178 flow [2025-02-08 08:12:18,662 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-02-08 08:12:18,662 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2025-02-08 08:12:18,662 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 178 flow [2025-02-08 08:12:18,662 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-02-08 08:12:18,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:12:18,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:12:18,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:12:18,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-08 08:12:18,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:12:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 938207225, now seen corresponding path program 1 times [2025-02-08 08:12:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:12:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-02-08 08:12:18,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:12:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:12:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:12:18,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:12:18,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:12:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:12:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:12:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:12:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072912484] [2025-02-08 08:12:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072912484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:12:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:12:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:12:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873218631] [2025-02-08 08:12:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:12:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:12:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:12:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:12:18,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:12:18,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-08 08:12:18,856 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-02-08 08:12:18,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:12:18,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-08 08:12:18,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand