./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:13:01,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:13:02,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:13:02,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:13:02,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:13:02,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:13:02,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:13:02,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:13:02,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:13:02,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:13:02,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:13:02,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:13:02,048 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:13:02,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:02,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:13:02,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:13:02,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:13:02,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:13:02,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:13:02,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-02-08 08:13:02,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:13:02,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:13:02,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:13:02,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:13:02,290 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:13:02,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-08 08:13:03,426 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec19f0d88/ffeb6b879eea4351a83bdfc36f961aed/FLAGed1b10118 [2025-02-08 08:13:03,716 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:13:03,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-08 08:13:03,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec19f0d88/ffeb6b879eea4351a83bdfc36f961aed/FLAGed1b10118 [2025-02-08 08:13:04,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec19f0d88/ffeb6b879eea4351a83bdfc36f961aed [2025-02-08 08:13:04,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:13:04,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:13:04,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:04,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:13:04,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:13:04,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a8b04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04, skipping insertion in model container [2025-02-08 08:13:04,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:13:04,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:04,266 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:13:04,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:04,332 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:13:04,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04 WrapperNode [2025-02-08 08:13:04,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:04,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:04,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:13:04,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:13:04,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,356 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-02-08 08:13:04,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:04,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:13:04,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:13:04,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:13:04,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,371 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-08 08:13:04,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:13:04,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:13:04,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:13:04,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:13:04,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (1/1) ... [2025-02-08 08:13:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:13:04,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:13:04,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:13:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-08 08:13:04,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:13:04,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:13:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:13:04,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:13:04,427 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:13:04,520 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:13:04,523 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:13:04,647 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:13:04,647 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:13:04,728 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:13:04,728 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:13:04,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:04 BoogieIcfgContainer [2025-02-08 08:13:04,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:13:04,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:13:04,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:13:04,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:13:04,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:13:04" (1/3) ... [2025-02-08 08:13:04,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b68f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:04, skipping insertion in model container [2025-02-08 08:13:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:04" (2/3) ... [2025-02-08 08:13:04,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b68f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:04, skipping insertion in model container [2025-02-08 08:13:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:04" (3/3) ... [2025-02-08 08:13:04,739 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-02-08 08:13:04,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:13:04,750 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 28 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-08 08:13:04,750 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:13:04,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:04,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 72 flow [2025-02-08 08:13:04,839 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2025-02-08 08:13:04,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:04,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 4/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 08:13:04,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 72 flow [2025-02-08 08:13:04,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 69 flow [2025-02-08 08:13:04,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:04,864 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:04,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:13:04,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:04,871 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:04,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:04,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:04,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:04,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:13:04,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 164352696, now seen corresponding path program 1 times [2025-02-08 08:13:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:04,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705828176] [2025-02-08 08:13:04,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:04,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:04,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:04,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:05,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705828176] [2025-02-08 08:13:05,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705828176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395355755] [2025-02-08 08:13:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:05,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:05,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:05,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 08:13:05,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:05,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:05,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 08:13:05,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:05,097 INFO L124 PetriNetUnfolderBase]: 79/178 cut-off events. [2025-02-08 08:13:05,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:05,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 178 events. 79/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 771 event pairs, 66 based on Foata normal form. 64/230 useless extension candidates. Maximal degree in co-relation 317. Up to 136 conditions per place. [2025-02-08 08:13:05,101 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 12 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-08 08:13:05,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 77 flow [2025-02-08 08:13:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2025-02-08 08:13:05,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-02-08 08:13:05,125 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 69 flow. Second operand 2 states and 43 transitions. [2025-02-08 08:13:05,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 77 flow [2025-02-08 08:13:05,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:05,129 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 52 flow [2025-02-08 08:13:05,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=52, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-02-08 08:13:05,134 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -6 predicate places. [2025-02-08 08:13:05,134 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 52 flow [2025-02-08 08:13:05,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:05,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:05,134 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:05,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:13:05,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:13:05,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash -29556214, now seen corresponding path program 1 times [2025-02-08 08:13:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745548623] [2025-02-08 08:13:05,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:05,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:05,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:05,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:05,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:05,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:05,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:05,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:05,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:05,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 08:13:05,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:13:05,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-08 08:13:05,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 08:13:05,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-08 08:13:05,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:13:05,192 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:13:05,194 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:05,194 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:13:05,208 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:05,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 130 flow [2025-02-08 08:13:05,216 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-02-08 08:13:05,217 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:13:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 48 events. 5/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 55. Up to 3 conditions per place. [2025-02-08 08:13:05,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 55 transitions, 130 flow [2025-02-08 08:13:05,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 91 flow [2025-02-08 08:13:05,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:05,219 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:05,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:13:05,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:05,221 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 08:13:05,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:05,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:05,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:05,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:13:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash 217465082, now seen corresponding path program 1 times [2025-02-08 08:13:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387957102] [2025-02-08 08:13:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:05,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:05,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387957102] [2025-02-08 08:13:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387957102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071277858] [2025-02-08 08:13:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:05,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:05,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:05,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:05,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-02-08 08:13:05,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 91 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-02-08 08:13:05,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:05,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-02-08 08:13:05,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:05,393 INFO L124 PetriNetUnfolderBase]: 559/1002 cut-off events. [2025-02-08 08:13:05,394 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 08:13:05,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 1002 events. 559/1002 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5556 event pairs, 450 based on Foata normal form. 379/1332 useless extension candidates. Maximal degree in co-relation 1853. Up to 800 conditions per place. [2025-02-08 08:13:05,408 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 16 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-02-08 08:13:05,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 105 flow [2025-02-08 08:13:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2025-02-08 08:13:05,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-02-08 08:13:05,409 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 91 flow. Second operand 2 states and 68 transitions. [2025-02-08 08:13:05,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 105 flow [2025-02-08 08:13:05,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:05,410 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 72 flow [2025-02-08 08:13:05,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-02-08 08:13:05,411 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2025-02-08 08:13:05,411 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 72 flow [2025-02-08 08:13:05,411 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-02-08 08:13:05,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:05,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:05,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:13:05,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:13:05,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -781230148, now seen corresponding path program 1 times [2025-02-08 08:13:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098341081] [2025-02-08 08:13:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:05,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:05,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098341081] [2025-02-08 08:13:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098341081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949125035] [2025-02-08 08:13:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:05,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:05,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:05,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:05,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-02-08 08:13:05,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:05,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:05,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-02-08 08:13:05,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:05,671 INFO L124 PetriNetUnfolderBase]: 620/1150 cut-off events. [2025-02-08 08:13:05,671 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 08:13:05,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 1150 events. 620/1150 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6787 event pairs, 139 based on Foata normal form. 20/1127 useless extension candidates. Maximal degree in co-relation 2111. Up to 760 conditions per place. [2025-02-08 08:13:05,678 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 22 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-02-08 08:13:05,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 145 flow [2025-02-08 08:13:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 08:13:05,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-02-08 08:13:05,680 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 72 flow. Second operand 3 states and 95 transitions. [2025-02-08 08:13:05,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 145 flow [2025-02-08 08:13:05,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 145 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:05,682 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 91 flow [2025-02-08 08:13:05,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-02-08 08:13:05,683 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-02-08 08:13:05,683 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 91 flow [2025-02-08 08:13:05,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:05,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:05,683 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:13:05,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:13:05,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash -153277332, now seen corresponding path program 1 times [2025-02-08 08:13:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137107713] [2025-02-08 08:13:05,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:05,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:13:05,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:13:05,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:05,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:05,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:13:05,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:13:05,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:05,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:05,714 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:05,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 08:13:05,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:13:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:13:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:13:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-08 08:13:05,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:13:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:13:05,715 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:13:05,716 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:05,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:13:05,736 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:05,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 192 flow [2025-02-08 08:13:05,745 INFO L124 PetriNetUnfolderBase]: 6/61 cut-off events. [2025-02-08 08:13:05,745 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:13:05,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 61 events. 6/61 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2025-02-08 08:13:05,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 78 transitions, 192 flow [2025-02-08 08:13:05,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 47 transitions, 115 flow [2025-02-08 08:13:05,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:05,748 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:05,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:13:05,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:05,749 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:05,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:05,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:05,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:05,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:05,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 292526483, now seen corresponding path program 1 times [2025-02-08 08:13:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19569130] [2025-02-08 08:13:05,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:05,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:05,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19569130] [2025-02-08 08:13:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19569130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998281210] [2025-02-08 08:13:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:05,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:05,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:05,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 78 [2025-02-08 08:13:05,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 115 flow. Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:05,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:05,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 78 [2025-02-08 08:13:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:06,185 INFO L124 PetriNetUnfolderBase]: 3247/5082 cut-off events. [2025-02-08 08:13:06,185 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-02-08 08:13:06,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9625 conditions, 5082 events. 3247/5082 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31442 event pairs, 2562 based on Foata normal form. 2035/6908 useless extension candidates. Maximal degree in co-relation 9613. Up to 4224 conditions per place. [2025-02-08 08:13:06,210 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 20 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-02-08 08:13:06,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 135 flow [2025-02-08 08:13:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2025-02-08 08:13:06,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-02-08 08:13:06,211 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 115 flow. Second operand 2 states and 93 transitions. [2025-02-08 08:13:06,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 135 flow [2025-02-08 08:13:06,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:06,216 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 92 flow [2025-02-08 08:13:06,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-02-08 08:13:06,217 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2025-02-08 08:13:06,217 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 92 flow [2025-02-08 08:13:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:06,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:06,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:13:06,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1353769148, now seen corresponding path program 1 times [2025-02-08 08:13:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573270842] [2025-02-08 08:13:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:06,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:06,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:06,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573270842] [2025-02-08 08:13:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573270842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947943132] [2025-02-08 08:13:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:06,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:06,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:06,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:06,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 78 [2025-02-08 08:13:06,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:06,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 78 [2025-02-08 08:13:06,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:06,745 INFO L124 PetriNetUnfolderBase]: 3515/5677 cut-off events. [2025-02-08 08:13:06,746 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-02-08 08:13:06,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 5677 events. 3515/5677 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 37444 event pairs, 724 based on Foata normal form. 44/5534 useless extension candidates. Maximal degree in co-relation 10577. Up to 4267 conditions per place. [2025-02-08 08:13:06,771 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 28 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-02-08 08:13:06,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 190 flow [2025-02-08 08:13:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-02-08 08:13:06,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-02-08 08:13:06,774 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 92 flow. Second operand 3 states and 132 transitions. [2025-02-08 08:13:06,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 190 flow [2025-02-08 08:13:06,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:06,776 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 118 flow [2025-02-08 08:13:06,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-02-08 08:13:06,777 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 08:13:06,778 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 118 flow [2025-02-08 08:13:06,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:06,778 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:13:06,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 08:13:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 200232115, now seen corresponding path program 1 times [2025-02-08 08:13:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177776057] [2025-02-08 08:13:06,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:06,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:13:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:13:06,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:06,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:06,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:13:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:13:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:06,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:06,808 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:06,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 08:13:06,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:13:06,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:13:06,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:13:06,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-08 08:13:06,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-08 08:13:06,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:13:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:13:06,809 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:13:06,809 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:06,809 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:13:06,839 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:06,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 258 flow [2025-02-08 08:13:06,846 INFO L124 PetriNetUnfolderBase]: 7/74 cut-off events. [2025-02-08 08:13:06,846 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:13:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 74 events. 7/74 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-02-08 08:13:06,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 258 flow [2025-02-08 08:13:06,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 55 transitions, 141 flow [2025-02-08 08:13:06,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:06,849 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:06,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:13:06,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:06,851 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 08:13:06,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:06,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:06,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:06,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 08:13:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 389536899, now seen corresponding path program 1 times [2025-02-08 08:13:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648383877] [2025-02-08 08:13:06,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:06,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:06,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:06,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648383877] [2025-02-08 08:13:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648383877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393359174] [2025-02-08 08:13:06,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:06,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:06,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:06,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:06,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:06,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-08 08:13:06,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 141 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-08 08:13:06,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:08,549 INFO L124 PetriNetUnfolderBase]: 17071/24474 cut-off events. [2025-02-08 08:13:08,550 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2025-02-08 08:13:08,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47066 conditions, 24474 events. 17071/24474 cut-off events. For 4208/4208 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 160146 event pairs, 13314 based on Foata normal form. 10199/33824 useless extension candidates. Maximal degree in co-relation 47053. Up to 20992 conditions per place. [2025-02-08 08:13:08,685 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 24 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2025-02-08 08:13:08,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 167 flow [2025-02-08 08:13:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2025-02-08 08:13:08,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5841584158415841 [2025-02-08 08:13:08,688 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 141 flow. Second operand 2 states and 118 transitions. [2025-02-08 08:13:08,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 167 flow [2025-02-08 08:13:08,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 160 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:08,694 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 112 flow [2025-02-08 08:13:08,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-02-08 08:13:08,694 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-02-08 08:13:08,694 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 112 flow [2025-02-08 08:13:08,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:08,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:08,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:08,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:13:08,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 08:13:08,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1574439201, now seen corresponding path program 1 times [2025-02-08 08:13:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088570777] [2025-02-08 08:13:08,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:08,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:08,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:08,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:08,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088570777] [2025-02-08 08:13:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088570777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:08,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880796426] [2025-02-08 08:13:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:08,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:08,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:08,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:08,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-08 08:13:08,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:08,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:08,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-08 08:13:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:09,803 INFO L124 PetriNetUnfolderBase]: 17930/26488 cut-off events. [2025-02-08 08:13:09,804 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-02-08 08:13:09,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49842 conditions, 26488 events. 17930/26488 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 184841 event pairs, 3961 based on Foata normal form. 92/25736 useless extension candidates. Maximal degree in co-relation 49835. Up to 21382 conditions per place. [2025-02-08 08:13:10,046 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 34 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-02-08 08:13:10,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 235 flow [2025-02-08 08:13:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-02-08 08:13:10,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5577557755775577 [2025-02-08 08:13:10,048 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 112 flow. Second operand 3 states and 169 transitions. [2025-02-08 08:13:10,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 235 flow [2025-02-08 08:13:10,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:10,050 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 145 flow [2025-02-08 08:13:10,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-02-08 08:13:10,051 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-02-08 08:13:10,051 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 145 flow [2025-02-08 08:13:10,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:10,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:10,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:13:10,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 08:13:10,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1863569465, now seen corresponding path program 1 times [2025-02-08 08:13:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801275616] [2025-02-08 08:13:10,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:10,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:13:10,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:13:10,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801275616] [2025-02-08 08:13:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801275616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:10,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:13:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601106275] [2025-02-08 08:13:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:10,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:10,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:10,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-08 08:13:10,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:10,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-08 08:13:10,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:10,308 INFO L124 PetriNetUnfolderBase]: 1187/2645 cut-off events. [2025-02-08 08:13:10,309 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-02-08 08:13:10,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 2645 events. 1187/2645 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18401 event pairs, 260 based on Foata normal form. 2076/4643 useless extension candidates. Maximal degree in co-relation 5715. Up to 1627 conditions per place. [2025-02-08 08:13:10,328 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 25 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2025-02-08 08:13:10,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 247 flow [2025-02-08 08:13:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-08 08:13:10,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2025-02-08 08:13:10,330 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 145 flow. Second operand 3 states and 165 transitions. [2025-02-08 08:13:10,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 247 flow [2025-02-08 08:13:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:10,333 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 160 flow [2025-02-08 08:13:10,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-02-08 08:13:10,335 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-02-08 08:13:10,335 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 160 flow [2025-02-08 08:13:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:10,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:13:10,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 08:13:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1243106432, now seen corresponding path program 1 times [2025-02-08 08:13:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947964104] [2025-02-08 08:13:10,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:10,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:13:10,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:13:10,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947964104] [2025-02-08 08:13:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947964104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:13:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417696193] [2025-02-08 08:13:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:13:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:10,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:13:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:13:10,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-08 08:13:10,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:10,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-08 08:13:10,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:10,731 INFO L124 PetriNetUnfolderBase]: 1731/3934 cut-off events. [2025-02-08 08:13:10,732 INFO L125 PetriNetUnfolderBase]: For 1177/1207 co-relation queries the response was YES. [2025-02-08 08:13:10,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9571 conditions, 3934 events. 1731/3934 cut-off events. For 1177/1207 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 30635 event pairs, 86 based on Foata normal form. 36/3950 useless extension candidates. Maximal degree in co-relation 9562. Up to 2243 conditions per place. [2025-02-08 08:13:10,757 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 49 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2025-02-08 08:13:10,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 406 flow [2025-02-08 08:13:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:13:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:13:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-02-08 08:13:10,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5717821782178217 [2025-02-08 08:13:10,759 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 160 flow. Second operand 4 states and 231 transitions. [2025-02-08 08:13:10,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 406 flow [2025-02-08 08:13:10,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:10,763 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 202 flow [2025-02-08 08:13:10,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-02-08 08:13:10,764 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-02-08 08:13:10,764 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 202 flow [2025-02-08 08:13:10,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:10,764 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:13:10,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-08 08:13:10,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 374593280, now seen corresponding path program 1 times [2025-02-08 08:13:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307576111] [2025-02-08 08:13:10,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:10,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:13:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:13:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:10,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:13:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:13:10,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:10,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:10,789 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-02-08 08:13:10,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-08 08:13:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:13:10,790 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 08:13:10,790 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:10,790 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 08:13:10,824 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:10,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 124 transitions, 328 flow [2025-02-08 08:13:10,830 INFO L124 PetriNetUnfolderBase]: 8/87 cut-off events. [2025-02-08 08:13:10,830 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 08:13:10,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 87 events. 8/87 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 245 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2025-02-08 08:13:10,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 124 transitions, 328 flow [2025-02-08 08:13:10,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 63 transitions, 169 flow [2025-02-08 08:13:10,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:10,832 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:10,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 08:13:10,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:10,833 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:10,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:10,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:10,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:10,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-08 08:13:10,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 508496330, now seen corresponding path program 1 times [2025-02-08 08:13:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809238499] [2025-02-08 08:13:10,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:10,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:10,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:10,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:10,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809238499] [2025-02-08 08:13:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809238499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:10,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753286229] [2025-02-08 08:13:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:10,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:10,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:10,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:10,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:10,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-08 08:13:10,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:10,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:10,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-08 08:13:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:17,097 INFO L124 PetriNetUnfolderBase]: 84655/114330 cut-off events. [2025-02-08 08:13:17,097 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-02-08 08:13:17,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222427 conditions, 114330 events. 84655/114330 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 4022. Compared 774686 event pairs, 65538 based on Foata normal form. 48983/159904 useless extension candidates. Maximal degree in co-relation 222413. Up to 100352 conditions per place. [2025-02-08 08:13:17,888 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 28 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2025-02-08 08:13:17,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 201 flow [2025-02-08 08:13:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2025-02-08 08:13:17,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766129032258065 [2025-02-08 08:13:17,891 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 169 flow. Second operand 2 states and 143 transitions. [2025-02-08 08:13:17,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 201 flow [2025-02-08 08:13:17,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:17,907 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 132 flow [2025-02-08 08:13:17,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=132, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-02-08 08:13:17,908 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2025-02-08 08:13:17,908 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 132 flow [2025-02-08 08:13:17,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:17,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:17,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:13:17,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-08 08:13:17,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 17825921, now seen corresponding path program 1 times [2025-02-08 08:13:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137515213] [2025-02-08 08:13:17,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:17,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:17,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:17,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:17,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137515213] [2025-02-08 08:13:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137515213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941957305] [2025-02-08 08:13:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:17,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:17,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:17,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-08 08:13:17,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:17,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:17,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-08 08:13:17,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:24,138 INFO L124 PetriNetUnfolderBase]: 87029/120775 cut-off events. [2025-02-08 08:13:24,138 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2025-02-08 08:13:24,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228997 conditions, 120775 events. 87029/120775 cut-off events. For 5082/5082 co-relation queries the response was YES. Maximal size of possible extension queue 4434. Compared 876523 event pairs, 21478 based on Foata normal form. 188/117284 useless extension candidates. Maximal degree in co-relation 228989. Up to 101893 conditions per place. [2025-02-08 08:13:25,152 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 40 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-02-08 08:13:25,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 280 flow [2025-02-08 08:13:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-08 08:13:25,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2025-02-08 08:13:25,154 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 132 flow. Second operand 3 states and 206 transitions. [2025-02-08 08:13:25,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 280 flow [2025-02-08 08:13:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:25,158 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 172 flow [2025-02-08 08:13:25,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-08 08:13:25,158 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2025-02-08 08:13:25,158 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 172 flow [2025-02-08 08:13:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:25,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:25,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:25,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:13:25,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-08 08:13:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 760594377, now seen corresponding path program 1 times [2025-02-08 08:13:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981647607] [2025-02-08 08:13:25,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:25,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:13:25,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:13:25,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:25,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981647607] [2025-02-08 08:13:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981647607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:25,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:13:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276911201] [2025-02-08 08:13:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:25,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:25,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:25,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-08 08:13:25,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:25,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:25,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-08 08:13:25,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:25,652 INFO L124 PetriNetUnfolderBase]: 2900/6207 cut-off events. [2025-02-08 08:13:25,653 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2025-02-08 08:13:25,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13571 conditions, 6207 events. 2900/6207 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 49005 event pairs, 648 based on Foata normal form. 6162/12223 useless extension candidates. Maximal degree in co-relation 13561. Up to 3945 conditions per place. [2025-02-08 08:13:25,698 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 29 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2025-02-08 08:13:25,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 293 flow [2025-02-08 08:13:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-02-08 08:13:25,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2025-02-08 08:13:25,700 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 172 flow. Second operand 3 states and 201 transitions. [2025-02-08 08:13:25,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 293 flow [2025-02-08 08:13:25,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:25,704 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 190 flow [2025-02-08 08:13:25,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-02-08 08:13:25,705 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2025-02-08 08:13:25,705 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 190 flow [2025-02-08 08:13:25,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:25,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:25,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:25,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:13:25,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-08 08:13:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash -268212863, now seen corresponding path program 1 times [2025-02-08 08:13:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651185934] [2025-02-08 08:13:25,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:25,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:13:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:13:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651185934] [2025-02-08 08:13:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651185934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:25,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:13:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481292615] [2025-02-08 08:13:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:13:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:25,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:13:25,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:13:25,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-08 08:13:25,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:25,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:25,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-08 08:13:25,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:26,418 INFO L124 PetriNetUnfolderBase]: 4045/8702 cut-off events. [2025-02-08 08:13:26,418 INFO L125 PetriNetUnfolderBase]: For 2474/2534 co-relation queries the response was YES. [2025-02-08 08:13:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21598 conditions, 8702 events. 4045/8702 cut-off events. For 2474/2534 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 73673 event pairs, 162 based on Foata normal form. 57/8735 useless extension candidates. Maximal degree in co-relation 21588. Up to 5638 conditions per place. [2025-02-08 08:13:26,468 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 58 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2025-02-08 08:13:26,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 488 flow [2025-02-08 08:13:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:13:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:13:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-02-08 08:13:26,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685483870967742 [2025-02-08 08:13:26,469 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 190 flow. Second operand 4 states and 282 transitions. [2025-02-08 08:13:26,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 488 flow [2025-02-08 08:13:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:26,475 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 242 flow [2025-02-08 08:13:26,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-02-08 08:13:26,475 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-02-08 08:13:26,475 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 242 flow [2025-02-08 08:13:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:26,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:26,476 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:13:26,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-08 08:13:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 737250332, now seen corresponding path program 1 times [2025-02-08 08:13:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537873021] [2025-02-08 08:13:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:26,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:13:26,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:13:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:26,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:26,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:13:26,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:13:26,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:26,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:26,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:26,506 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-02-08 08:13:26,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-02-08 08:13:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:13:26,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 08:13:26,507 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:26,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-02-08 08:13:26,535 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 147 transitions, 402 flow [2025-02-08 08:13:26,541 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2025-02-08 08:13:26,541 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 08:13:26,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 100 events. 9/100 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 295 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 129. Up to 7 conditions per place. [2025-02-08 08:13:26,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 147 transitions, 402 flow [2025-02-08 08:13:26,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 71 transitions, 199 flow [2025-02-08 08:13:26,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:26,544 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;@11cfa16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:26,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 08:13:26,545 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:26,545 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:26,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:26,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:26,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:26,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-02-08 08:13:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 649404776, now seen corresponding path program 1 times [2025-02-08 08:13:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182972607] [2025-02-08 08:13:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:26,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:26,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:26,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:26,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:13:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182972607] [2025-02-08 08:13:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182972607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929804468] [2025-02-08 08:13:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:26,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:26,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:26,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 147 [2025-02-08 08:13:26,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 199 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:26,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:26,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 147 [2025-02-08 08:13:26,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand