./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:25,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:26,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:26,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:26,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:26,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:26,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:26,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:26,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:26,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:26,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:26,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:26,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:26,080 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:26,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:26,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:26,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:26,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:26,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:26,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-04 09:44:26,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:26,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:26,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:26,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:26,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:26,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-04 09:44:27,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481364fff/974609d1e98a4cc79169422513e72857/FLAG4fcf31c35 [2025-03-04 09:44:27,794 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:27,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-04 09:44:27,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481364fff/974609d1e98a4cc79169422513e72857/FLAG4fcf31c35 [2025-03-04 09:44:28,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/481364fff/974609d1e98a4cc79169422513e72857 [2025-03-04 09:44:28,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:28,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:28,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:28,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:28,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:28,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cf70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28, skipping insertion in model container [2025-03-04 09:44:28,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:28,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:28,322 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:28,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:28,385 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:28,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28 WrapperNode [2025-03-04 09:44:28,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:28,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:28,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:28,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:28,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,413 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-04 09:44:28,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:28,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:28,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:28,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:28,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,429 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 09:44:28,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:28,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:28,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:28,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:28,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (1/1) ... [2025-03-04 09:44:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:28,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:28,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:28,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:44:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:44:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:28,491 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:28,582 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:28,584 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:28,774 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:28,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:28,899 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:28,899 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:28,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:28 BoogieIcfgContainer [2025-03-04 09:44:28,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:28,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:28,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:28,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:28,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:28" (1/3) ... [2025-03-04 09:44:28,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5926c137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:28, skipping insertion in model container [2025-03-04 09:44:28,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:28" (2/3) ... [2025-03-04 09:44:28,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5926c137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:28, skipping insertion in model container [2025-03-04 09:44:28,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:28" (3/3) ... [2025-03-04 09:44:28,908 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-04 09:44:28,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:28,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 09:44:28,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:28,964 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 29 transitions, 62 flow [2025-03-04 09:44:29,015 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-04 09:44:29,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-04 09:44:29,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 29 transitions, 62 flow [2025-03-04 09:44:29,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 29 transitions, 62 flow [2025-03-04 09:44:29,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:29,044 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;@3c5f1ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:29,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:44:29,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:29,047 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:29,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:29,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:29,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:44:29,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash 216303, now seen corresponding path program 1 times [2025-03-04 09:44:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725800110] [2025-03-04 09:44:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:29,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725800110] [2025-03-04 09:44:29,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725800110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:29,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:29,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636931270] [2025-03-04 09:44:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:29,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:29,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:29,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 29 [2025-03-04 09:44:29,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:29,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 29 [2025-03-04 09:44:29,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:29,306 INFO L124 PetriNetUnfolderBase]: 16/65 cut-off events. [2025-03-04 09:44:29,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:29,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 65 events. 16/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 179 event pairs, 12 based on Foata normal form. 6/64 useless extension candidates. Maximal degree in co-relation 93. Up to 39 conditions per place. [2025-03-04 09:44:29,310 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 11 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-04 09:44:29,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 72 flow [2025-03-04 09:44:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-03-04 09:44:29,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-03-04 09:44:29,323 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 62 flow. Second operand 2 states and 40 transitions. [2025-03-04 09:44:29,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 72 flow [2025-03-04 09:44:29,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:29,329 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 50 flow [2025-03-04 09:44:29,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=23} [2025-03-04 09:44:29,337 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-04 09:44:29,338 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 50 flow [2025-03-04 09:44:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 09:44:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:29,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:44:29,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2143524333, now seen corresponding path program 1 times [2025-03-04 09:44:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094808789] [2025-03-04 09:44:29,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:29,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:29,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:29,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:29,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:29,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:29,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:29,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:29,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:29,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 09:44:29,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-03-04 09:44:29,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-04 09:44:29,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-03-04 09:44:29,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-04 09:44:29,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-04 09:44:29,407 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-04 09:44:29,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-04 09:44:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:29,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:44:29,411 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:29,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:29,442 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:29,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-03-04 09:44:29,459 INFO L124 PetriNetUnfolderBase]: 8/60 cut-off events. [2025-03-04 09:44:29,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:29,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 8/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 171 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-03-04 09:44:29,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-03-04 09:44:29,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-03-04 09:44:29,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:29,465 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;@3c5f1ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:29,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 09:44:29,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:29,468 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:29,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:29,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:29,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-04 09:44:29,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 266946, now seen corresponding path program 1 times [2025-03-04 09:44:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194854033] [2025-03-04 09:44:29,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:29,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:29,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194854033] [2025-03-04 09:44:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194854033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846910884] [2025-03-04 09:44:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:29,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:29,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:29,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:29,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 51 [2025-03-04 09:44:29,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:29,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 51 [2025-03-04 09:44:29,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:29,678 INFO L124 PetriNetUnfolderBase]: 282/732 cut-off events. [2025-03-04 09:44:29,678 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 09:44:29,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 732 events. 282/732 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4466 event pairs, 222 based on Foata normal form. 118/775 useless extension candidates. Maximal degree in co-relation 565. Up to 438 conditions per place. [2025-03-04 09:44:29,691 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 19 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-03-04 09:44:29,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 132 flow [2025-03-04 09:44:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-03-04 09:44:29,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-03-04 09:44:29,694 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 2 states and 72 transitions. [2025-03-04 09:44:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 132 flow [2025-03-04 09:44:29,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:29,695 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 94 flow [2025-03-04 09:44:29,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-03-04 09:44:29,696 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-03-04 09:44:29,696 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 94 flow [2025-03-04 09:44:29,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:29,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:44:29,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-04 09:44:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -634100055, now seen corresponding path program 1 times [2025-03-04 09:44:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896614900] [2025-03-04 09:44:29,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:29,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:29,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896614900] [2025-03-04 09:44:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896614900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993762477] [2025-03-04 09:44:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:29,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:29,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:29,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-04 09:44:29,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:29,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-04 09:44:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,014 INFO L124 PetriNetUnfolderBase]: 282/717 cut-off events. [2025-03-04 09:44:30,014 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 09:44:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 717 events. 282/717 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4288 event pairs, 222 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 1177. Up to 437 conditions per place. [2025-03-04 09:44:30,021 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-04 09:44:30,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 128 flow [2025-03-04 09:44:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 09:44:30,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-03-04 09:44:30,025 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 94 flow. Second operand 3 states and 87 transitions. [2025-03-04 09:44:30,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 128 flow [2025-03-04 09:44:30,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:30,029 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 92 flow [2025-03-04 09:44:30,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-03-04 09:44:30,030 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-03-04 09:44:30,030 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 92 flow [2025-03-04 09:44:30,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:30,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:44:30,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-04 09:44:30,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash -634100054, now seen corresponding path program 1 times [2025-03-04 09:44:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458322736] [2025-03-04 09:44:30,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:30,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:30,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458322736] [2025-03-04 09:44:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458322736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318299417] [2025-03-04 09:44:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:30,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-03-04 09:44:30,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-03-04 09:44:30,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,457 INFO L124 PetriNetUnfolderBase]: 428/1162 cut-off events. [2025-03-04 09:44:30,457 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 09:44:30,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1162 events. 428/1162 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7945 event pairs, 221 based on Foata normal form. 24/1102 useless extension candidates. Maximal degree in co-relation 1883. Up to 499 conditions per place. [2025-03-04 09:44:30,463 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 38 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-04 09:44:30,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 232 flow [2025-03-04 09:44:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-03-04 09:44:30,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-04 09:44:30,465 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 5 states and 155 transitions. [2025-03-04 09:44:30,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 232 flow [2025-03-04 09:44:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:30,467 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 118 flow [2025-03-04 09:44:30,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-04 09:44:30,468 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-03-04 09:44:30,468 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 118 flow [2025-03-04 09:44:30,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,468 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 09:44:30,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:44:30,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-03-04 09:44:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1823840452, now seen corresponding path program 1 times [2025-03-04 09:44:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860914112] [2025-03-04 09:44:30,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:30,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:30,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:30,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:30,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:30,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:30,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:30,489 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-03-04 09:44:30,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-03-04 09:44:30,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-03-04 09:44:30,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-03-04 09:44:30,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-03-04 09:44:30,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-03-04 09:44:30,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-03-04 09:44:30,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:30,490 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:44:30,490 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:30,490 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:44:30,524 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:30,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 73 transitions, 164 flow [2025-03-04 09:44:30,533 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-03-04 09:44:30,534 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:44:30,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 12/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 289 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-03-04 09:44:30,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 73 transitions, 164 flow [2025-03-04 09:44:30,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 73 transitions, 164 flow [2025-03-04 09:44:30,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:30,537 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;@3c5f1ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:30,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 09:44:30,538 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:30,538 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:30,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:30,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:30,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash 339435, now seen corresponding path program 1 times [2025-03-04 09:44:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632249613] [2025-03-04 09:44:30,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:30,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:30,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632249613] [2025-03-04 09:44:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632249613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592627889] [2025-03-04 09:44:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:30,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:30,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-03-04 09:44:30,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-03-04 09:44:30,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:31,133 INFO L124 PetriNetUnfolderBase]: 3157/6374 cut-off events. [2025-03-04 09:44:31,134 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2025-03-04 09:44:31,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10857 conditions, 6374 events. 3157/6374 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 51545 event pairs, 2574 based on Foata normal form. 1463/7289 useless extension candidates. Maximal degree in co-relation 1200. Up to 4260 conditions per place. [2025-03-04 09:44:31,174 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 27 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2025-03-04 09:44:31,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 194 flow [2025-03-04 09:44:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-03-04 09:44:31,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7123287671232876 [2025-03-04 09:44:31,178 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 164 flow. Second operand 2 states and 104 transitions. [2025-03-04 09:44:31,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 194 flow [2025-03-04 09:44:31,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:31,181 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 138 flow [2025-03-04 09:44:31,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-03-04 09:44:31,182 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-03-04 09:44:31,182 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 138 flow [2025-03-04 09:44:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:31,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:31,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:31,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:31,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:31,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:31,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1526117844, now seen corresponding path program 1 times [2025-03-04 09:44:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:31,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319877529] [2025-03-04 09:44:31,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:31,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:31,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:31,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:31,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319877529] [2025-03-04 09:44:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319877529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886251871] [2025-03-04 09:44:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:31,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:31,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:31,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:31,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 73 [2025-03-04 09:44:31,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:31,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:31,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 73 [2025-03-04 09:44:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:31,703 INFO L124 PetriNetUnfolderBase]: 3157/6277 cut-off events. [2025-03-04 09:44:31,703 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-03-04 09:44:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10712 conditions, 6277 events. 3157/6277 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 49896 event pairs, 2574 based on Foata normal form. 0/5826 useless extension candidates. Maximal degree in co-relation 10706. Up to 4259 conditions per place. [2025-03-04 09:44:31,737 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 26 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-03-04 09:44:31,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 186 flow [2025-03-04 09:44:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 09:44:31,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2025-03-04 09:44:31,742 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 138 flow. Second operand 3 states and 126 transitions. [2025-03-04 09:44:31,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 186 flow [2025-03-04 09:44:31,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:31,743 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 134 flow [2025-03-04 09:44:31,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-04 09:44:31,744 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-03-04 09:44:31,744 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 134 flow [2025-03-04 09:44:31,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:31,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:31,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:31,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1526117845, now seen corresponding path program 1 times [2025-03-04 09:44:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34331373] [2025-03-04 09:44:31,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:31,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:31,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:31,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:31,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34331373] [2025-03-04 09:44:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34331373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145044746] [2025-03-04 09:44:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:31,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:31,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:31,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:31,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-04 09:44:31,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:31,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:31,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-04 09:44:31,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:32,697 INFO L124 PetriNetUnfolderBase]: 4877/10719 cut-off events. [2025-03-04 09:44:32,698 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2025-03-04 09:44:32,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17684 conditions, 10719 events. 4877/10719 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 100402 event pairs, 2966 based on Foata normal form. 171/10169 useless extension candidates. Maximal degree in co-relation 17677. Up to 4867 conditions per place. [2025-03-04 09:44:32,763 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 62 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2025-03-04 09:44:32,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 364 flow [2025-03-04 09:44:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-03-04 09:44:32,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410958904109589 [2025-03-04 09:44:32,764 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 134 flow. Second operand 5 states and 234 transitions. [2025-03-04 09:44:32,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 364 flow [2025-03-04 09:44:32,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:32,769 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 160 flow [2025-03-04 09:44:32,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-03-04 09:44:32,770 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-04 09:44:32,771 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 160 flow [2025-03-04 09:44:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:32,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:32,771 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:44:32,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:32,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1086067641, now seen corresponding path program 1 times [2025-03-04 09:44:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662887110] [2025-03-04 09:44:32,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:32,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:32,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662887110] [2025-03-04 09:44:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662887110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:32,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848002653] [2025-03-04 09:44:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:32,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-04 09:44:32,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:32,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:32,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-04 09:44:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:33,682 INFO L124 PetriNetUnfolderBase]: 6238/13206 cut-off events. [2025-03-04 09:44:33,682 INFO L125 PetriNetUnfolderBase]: For 3260/3260 co-relation queries the response was YES. [2025-03-04 09:44:33,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24274 conditions, 13206 events. 6238/13206 cut-off events. For 3260/3260 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 122169 event pairs, 3541 based on Foata normal form. 216/12564 useless extension candidates. Maximal degree in co-relation 24265. Up to 6249 conditions per place. [2025-03-04 09:44:33,757 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 66 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-03-04 09:44:33,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 424 flow [2025-03-04 09:44:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-03-04 09:44:33,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6356164383561644 [2025-03-04 09:44:33,758 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 160 flow. Second operand 5 states and 232 transitions. [2025-03-04 09:44:33,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 424 flow [2025-03-04 09:44:33,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:33,761 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 186 flow [2025-03-04 09:44:33,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-03-04 09:44:33,762 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2025-03-04 09:44:33,762 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 186 flow [2025-03-04 09:44:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:33,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:33,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:33,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:44:33,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1946697941, now seen corresponding path program 1 times [2025-03-04 09:44:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205321465] [2025-03-04 09:44:33,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:33,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:33,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205321465] [2025-03-04 09:44:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205321465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281919322] [2025-03-04 09:44:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:33,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:33,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:44:33,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:34,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 09:44:34,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:34,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281919322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:34,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-03-04 09:44:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627768010] [2025-03-04 09:44:34,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:34,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:44:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:34,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:44:34,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:44:34,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-04 09:44:34,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 186 flow. Second operand has 12 states, 12 states have (on average 34.75) internal successors, (417), 12 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:34,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:34,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-04 09:44:34,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:35,648 INFO L124 PetriNetUnfolderBase]: 9802/21447 cut-off events. [2025-03-04 09:44:35,648 INFO L125 PetriNetUnfolderBase]: For 7258/7258 co-relation queries the response was YES. [2025-03-04 09:44:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41941 conditions, 21447 events. 9802/21447 cut-off events. For 7258/7258 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 218561 event pairs, 3382 based on Foata normal form. 219/20640 useless extension candidates. Maximal degree in co-relation 41930. Up to 6462 conditions per place. [2025-03-04 09:44:35,760 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 93 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2025-03-04 09:44:35,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 606 flow [2025-03-04 09:44:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2025-03-04 09:44:35,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-03-04 09:44:35,761 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 186 flow. Second operand 6 states and 291 transitions. [2025-03-04 09:44:35,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 606 flow [2025-03-04 09:44:35,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:35,767 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 226 flow [2025-03-04 09:44:35,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2025-03-04 09:44:35,768 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-03-04 09:44:35,768 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 226 flow [2025-03-04 09:44:35,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.75) internal successors, (417), 12 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:35,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:35,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:35,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:44:35,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 09:44:35,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -218114531, now seen corresponding path program 1 times [2025-03-04 09:44:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262791480] [2025-03-04 09:44:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:35,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:35,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:35,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:35,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262791480] [2025-03-04 09:44:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262791480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:36,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:36,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055502463] [2025-03-04 09:44:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:36,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:36,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:36,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:36,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-03-04 09:44:36,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:36,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:36,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-03-04 09:44:36,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:37,162 INFO L124 PetriNetUnfolderBase]: 8101/16155 cut-off events. [2025-03-04 09:44:37,162 INFO L125 PetriNetUnfolderBase]: For 8563/8563 co-relation queries the response was YES. [2025-03-04 09:44:37,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36427 conditions, 16155 events. 8101/16155 cut-off events. For 8563/8563 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 146653 event pairs, 1312 based on Foata normal form. 657/16185 useless extension candidates. Maximal degree in co-relation 36414. Up to 8799 conditions per place. [2025-03-04 09:44:37,269 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 51 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-03-04 09:44:37,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 398 flow [2025-03-04 09:44:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-04 09:44:37,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-03-04 09:44:37,270 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 226 flow. Second operand 3 states and 149 transitions. [2025-03-04 09:44:37,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 398 flow [2025-03-04 09:44:37,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:37,298 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 227 flow [2025-03-04 09:44:37,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2025-03-04 09:44:37,302 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2025-03-04 09:44:37,302 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 227 flow [2025-03-04 09:44:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:37,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:37,302 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 09:44:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:44:37,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-03-04 09:44:37,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -830637486, now seen corresponding path program 1 times [2025-03-04 09:44:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970601089] [2025-03-04 09:44:37,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:44:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:44:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:37,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:44:37,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:44:37,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:37,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:37,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:37,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-04 09:44:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-03-04 09:44:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:44:37,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:37,319 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:37,319 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:44:37,357 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:37,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 218 flow [2025-03-04 09:44:37,368 INFO L124 PetriNetUnfolderBase]: 16/114 cut-off events. [2025-03-04 09:44:37,369 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:44:37,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 114 events. 16/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 412 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 99. Up to 5 conditions per place. [2025-03-04 09:44:37,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 95 transitions, 218 flow [2025-03-04 09:44:37,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 95 transitions, 218 flow [2025-03-04 09:44:37,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:37,371 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;@3c5f1ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:37,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 09:44:37,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:37,372 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:37,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:37,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:37,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:37,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-04 09:44:37,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:37,373 INFO L85 PathProgramCache]: Analyzing trace with hash 433770, now seen corresponding path program 1 times [2025-03-04 09:44:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957689740] [2025-03-04 09:44:37,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:37,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:37,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:37,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:37,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:37,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957689740] [2025-03-04 09:44:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957689740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139453085] [2025-03-04 09:44:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:37,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:37,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:37,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:37,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 95 [2025-03-04 09:44:37,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 218 flow. Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:37,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:37,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 95 [2025-03-04 09:44:37,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:40,059 INFO L124 PetriNetUnfolderBase]: 30501/53151 cut-off events. [2025-03-04 09:44:40,060 INFO L125 PetriNetUnfolderBase]: For 4795/4795 co-relation queries the response was YES. [2025-03-04 09:44:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93307 conditions, 53151 events. 30501/53151 cut-off events. For 4795/4795 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 498657 event pairs, 25212 based on Foata normal form. 14934/64210 useless extension candidates. Maximal degree in co-relation 10919. Up to 38217 conditions per place. [2025-03-04 09:44:40,401 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 35 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2025-03-04 09:44:40,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 258 flow [2025-03-04 09:44:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-04 09:44:40,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7157894736842105 [2025-03-04 09:44:40,402 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 218 flow. Second operand 2 states and 136 transitions. [2025-03-04 09:44:40,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 258 flow [2025-03-04 09:44:40,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 252 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:40,405 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 182 flow [2025-03-04 09:44:40,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2025-03-04 09:44:40,406 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2025-03-04 09:44:40,406 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 182 flow [2025-03-04 09:44:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:40,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:40,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:44:40,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-04 09:44:40,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 42225332, now seen corresponding path program 1 times [2025-03-04 09:44:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961722744] [2025-03-04 09:44:40,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:40,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:40,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:40,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:40,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961722744] [2025-03-04 09:44:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961722744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:40,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:40,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:40,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235864780] [2025-03-04 09:44:40,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:40,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:40,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:40,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:40,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:40,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-03-04 09:44:40,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:40,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:40,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-03-04 09:44:40,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,551 INFO L124 PetriNetUnfolderBase]: 30501/52464 cut-off events. [2025-03-04 09:44:43,552 INFO L125 PetriNetUnfolderBase]: For 2307/2307 co-relation queries the response was YES. [2025-03-04 09:44:43,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91886 conditions, 52464 events. 30501/52464 cut-off events. For 2307/2307 co-relation queries the response was YES. Maximal size of possible extension queue 2300. Compared 483688 event pairs, 25212 based on Foata normal form. 0/49276 useless extension candidates. Maximal degree in co-relation 91879. Up to 38216 conditions per place. [2025-03-04 09:44:43,823 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-03-04 09:44:43,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 244 flow [2025-03-04 09:44:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 09:44:43,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-04 09:44:43,824 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 182 flow. Second operand 3 states and 165 transitions. [2025-03-04 09:44:43,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 244 flow [2025-03-04 09:44:43,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:43,829 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 176 flow [2025-03-04 09:44:43,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-03-04 09:44:43,830 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -8 predicate places. [2025-03-04 09:44:43,830 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 176 flow [2025-03-04 09:44:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:43,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:43,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:44:43,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-04 09:44:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 42225333, now seen corresponding path program 1 times [2025-03-04 09:44:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249113755] [2025-03-04 09:44:43,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:43,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:43,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:43,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:43,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249113755] [2025-03-04 09:44:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249113755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603762759] [2025-03-04 09:44:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:43,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:43,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-04 09:44:43,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:43,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:43,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-04 09:44:43,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:48,779 INFO L124 PetriNetUnfolderBase]: 47291/86598 cut-off events. [2025-03-04 09:44:48,780 INFO L125 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-03-04 09:44:49,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148542 conditions, 86598 events. 47291/86598 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 3647. Compared 908938 event pairs, 24941 based on Foata normal form. 1200/81667 useless extension candidates. Maximal degree in co-relation 148534. Up to 43675 conditions per place. [2025-03-04 09:44:49,439 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 86 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-03-04 09:44:49,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 496 flow [2025-03-04 09:44:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2025-03-04 09:44:49,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589473684210526 [2025-03-04 09:44:49,442 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 176 flow. Second operand 5 states and 313 transitions. [2025-03-04 09:44:49,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 496 flow [2025-03-04 09:44:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:49,449 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 202 flow [2025-03-04 09:44:49,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2025-03-04 09:44:49,449 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -3 predicate places. [2025-03-04 09:44:49,449 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 202 flow [2025-03-04 09:44:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:49,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:49,450 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:49,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:44:49,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-04 09:44:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1922129453, now seen corresponding path program 1 times [2025-03-04 09:44:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296537049] [2025-03-04 09:44:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:49,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:49,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:49,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296537049] [2025-03-04 09:44:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296537049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221903993] [2025-03-04 09:44:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:49,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:49,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:49,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:49,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-04 09:44:49,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:49,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:49,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-04 09:44:49,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:56,007 INFO L124 PetriNetUnfolderBase]: 60778/111143 cut-off events. [2025-03-04 09:44:56,008 INFO L125 PetriNetUnfolderBase]: For 23902/23902 co-relation queries the response was YES. [2025-03-04 09:44:56,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205834 conditions, 111143 events. 60778/111143 cut-off events. For 23902/23902 co-relation queries the response was YES. Maximal size of possible extension queue 4396. Compared 1189556 event pairs, 33712 based on Foata normal form. 1539/105366 useless extension candidates. Maximal degree in co-relation 205824. Up to 56145 conditions per place. [2025-03-04 09:44:56,750 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 90 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-03-04 09:44:56,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 556 flow [2025-03-04 09:44:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-03-04 09:44:56,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547368421052632 [2025-03-04 09:44:56,751 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 202 flow. Second operand 5 states and 311 transitions. [2025-03-04 09:44:56,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 556 flow [2025-03-04 09:44:56,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:56,760 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 228 flow [2025-03-04 09:44:56,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-03-04 09:44:56,761 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-03-04 09:44:56,761 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 228 flow [2025-03-04 09:44:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:56,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:56,761 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:56,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:44:56,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-03-04 09:44:56,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash -490030017, now seen corresponding path program 1 times [2025-03-04 09:44:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020720179] [2025-03-04 09:44:56,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:56,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:56,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:56,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:56,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:56,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020720179] [2025-03-04 09:44:56,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020720179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:56,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120191248] [2025-03-04 09:44:56,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:56,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:56,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:44:56,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:56,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:56,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:56,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:56,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 09:44:56,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:57,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120191248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:57,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-03-04 09:44:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111299703] [2025-03-04 09:44:57,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:57,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:44:57,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:57,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:44:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:44:57,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 95 [2025-03-04 09:44:57,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 228 flow. Second operand has 12 states, 12 states have (on average 45.75) internal successors, (549), 12 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:57,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:57,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 95 [2025-03-04 09:44:57,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand