./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/35_double_lock_p3_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 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:37:04,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:37:04,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:37:04,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:37:04,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:37:04,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:37:04,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:37:04,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:37:04,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:37:04,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:37:04,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:37:04,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:37:04,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:37:04,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:37:04,845 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:37:04,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:37:04,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:37:04,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:37:04,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:04,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:37:04,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:37:04,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:37:04,848 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 -> 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 [2025-02-06 12:37:05,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:37:05,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:37:05,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:37:05,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:37:05,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:37:05,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-02-06 12:37:06,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bf34f761/8ba565653d234029b1a4ecc945a2d459/FLAG62c19f449 [2025-02-06 12:37:06,958 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:37:06,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-02-06 12:37:06,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bf34f761/8ba565653d234029b1a4ecc945a2d459/FLAG62c19f449 [2025-02-06 12:37:06,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bf34f761/8ba565653d234029b1a4ecc945a2d459 [2025-02-06 12:37:06,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:37:06,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:37:06,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:06,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:37:07,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:37:07,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:06" (1/1) ... [2025-02-06 12:37:07,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c774eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07, skipping insertion in model container [2025-02-06 12:37:07,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:06" (1/1) ... [2025-02-06 12:37:07,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:37:07,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:07,360 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:37:07,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:07,448 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:37:07,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07 WrapperNode [2025-02-06 12:37:07,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:07,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:07,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:37:07,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:37:07,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,480 INFO L138 Inliner]: procedures = 164, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-02-06 12:37:07,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:07,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:37:07,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:37:07,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:37:07,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,513 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-06 12:37:07,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:37:07,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:37:07,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:37:07,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:37:07,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (1/1) ... [2025-02-06 12:37:07,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:07,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:37:07,558 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-06 12:37:07,560 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-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 12:37:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:37:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:37:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:37:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:37:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:37:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:37:07,577 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:37:07,671 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:37:07,674 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:37:07,848 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:37:07,848 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:37:07,932 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:37:07,932 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:37:07,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:07 BoogieIcfgContainer [2025-02-06 12:37:07,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:37:07,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:37:07,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:37:07,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:37:07,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:06" (1/3) ... [2025-02-06 12:37:07,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683415c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:07, skipping insertion in model container [2025-02-06 12:37:07,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:07" (2/3) ... [2025-02-06 12:37:07,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683415c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:07, skipping insertion in model container [2025-02-06 12:37:07,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:07" (3/3) ... [2025-02-06 12:37:07,949 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-02-06 12:37:07,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:37:07,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 33 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:37:07,966 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:37:08,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 82 flow [2025-02-06 12:37:08,093 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-06 12:37:08,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:08,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 4/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 96 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-02-06 12:37:08,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 82 flow [2025-02-06 12:37:08,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 36 transitions, 79 flow [2025-02-06 12:37:08,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:08,120 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;@7677137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:08,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 12:37:08,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:08,125 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:08,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:08,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:08,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:08,126 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-06 12:37:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash 201771901, now seen corresponding path program 1 times [2025-02-06 12:37:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938260868] [2025-02-06 12:37:08,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:08,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:08,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:08,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:08,291 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-06 12:37:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938260868] [2025-02-06 12:37:08,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938260868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:08,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655525500] [2025-02-06 12:37:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:08,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:08,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:08,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-06 12:37:08,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-06 12:37:08,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-06 12:37:08,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:08,520 INFO L124 PetriNetUnfolderBase]: 198/365 cut-off events. [2025-02-06 12:37:08,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 365 events. 198/365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1778 event pairs, 185 based on Foata normal form. 107/456 useless extension candidates. Maximal degree in co-relation 711. Up to 343 conditions per place. [2025-02-06 12:37:08,528 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-02-06 12:37:08,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 105 flow [2025-02-06 12:37:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2025-02-06 12:37:08,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-02-06 12:37:08,544 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 79 flow. Second operand 2 states and 46 transitions. [2025-02-06 12:37:08,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 105 flow [2025-02-06 12:37:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:08,554 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 64 flow [2025-02-06 12:37:08,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-02-06 12:37:08,562 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2025-02-06 12:37:08,563 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 64 flow [2025-02-06 12:37:08,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-06 12:37:08,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:08,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:08,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:37:08,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1965294273, now seen corresponding path program 1 times [2025-02-06 12:37:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249007199] [2025-02-06 12:37:08,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:08,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:08,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:08,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:08,648 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:08,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 12:37:08,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 12:37:08,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-06 12:37:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 12:37:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 12:37:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:37:08,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:37:08,656 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:08,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:37:08,696 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:08,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 150 flow [2025-02-06 12:37:08,714 INFO L124 PetriNetUnfolderBase]: 5/58 cut-off events. [2025-02-06 12:37:08,714 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:37:08,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 58 events. 5/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 153 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2025-02-06 12:37:08,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 65 transitions, 150 flow [2025-02-06 12:37:08,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 49 transitions, 111 flow [2025-02-06 12:37:08,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:08,723 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;@7677137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:08,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:37:08,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:08,728 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:08,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:08,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:08,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:08,729 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-06 12:37:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 264606083, now seen corresponding path program 1 times [2025-02-06 12:37:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266521027] [2025-02-06 12:37:08,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:08,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:08,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:08,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:08,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:08,784 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-06 12:37:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266521027] [2025-02-06 12:37:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266521027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098190082] [2025-02-06 12:37:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:08,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:08,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:08,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-02-06 12:37:08,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-06 12:37:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:08,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-02-06 12:37:08,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:09,424 INFO L124 PetriNetUnfolderBase]: 3751/5538 cut-off events. [2025-02-06 12:37:09,424 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-06 12:37:09,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11032 conditions, 5538 events. 3751/5538 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32726 event pairs, 3474 based on Foata normal form. 1195/6416 useless extension candidates. Maximal degree in co-relation 11021. Up to 5348 conditions per place. [2025-02-06 12:37:09,475 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2025-02-06 12:37:09,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 161 flow [2025-02-06 12:37:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2025-02-06 12:37:09,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2025-02-06 12:37:09,479 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 111 flow. Second operand 2 states and 74 transitions. [2025-02-06 12:37:09,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 161 flow [2025-02-06 12:37:09,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:09,481 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 96 flow [2025-02-06 12:37:09,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-02-06 12:37:09,482 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-06 12:37:09,482 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 96 flow [2025-02-06 12:37:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-06 12:37:09,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:09,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:09,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:37:09,484 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-06 12:37:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -152879044, now seen corresponding path program 1 times [2025-02-06 12:37:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:09,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689957809] [2025-02-06 12:37:09,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:09,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:09,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:09,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:09,588 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-06 12:37:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689957809] [2025-02-06 12:37:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689957809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:09,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:09,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470374519] [2025-02-06 12:37:09,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:09,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:09,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:09,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:09,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-02-06 12:37:09,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-06 12:37:09,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:09,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-02-06 12:37:09,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:10,012 INFO L124 PetriNetUnfolderBase]: 2714/4054 cut-off events. [2025-02-06 12:37:10,013 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-02-06 12:37:10,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 4054 events. 2714/4054 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23065 event pairs, 2506 based on Foata normal form. 398/4214 useless extension candidates. Maximal degree in co-relation 8072. Up to 3911 conditions per place. [2025-02-06 12:37:10,050 INFO L140 encePairwiseOnDemand]: 63/65 looper letters, 30 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2025-02-06 12:37:10,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 152 flow [2025-02-06 12:37:10,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 12:37:10,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2025-02-06 12:37:10,053 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 96 flow. Second operand 3 states and 89 transitions. [2025-02-06 12:37:10,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 152 flow [2025-02-06 12:37:10,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:10,057 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 92 flow [2025-02-06 12:37:10,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-02-06 12:37:10,059 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-06 12:37:10,059 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 92 flow [2025-02-06 12:37:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-06 12:37:10,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:10,061 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:10,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:37:10,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 350873504, now seen corresponding path program 1 times [2025-02-06 12:37:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971797151] [2025-02-06 12:37:10,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:10,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:37:10,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:37:10,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:10,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:10,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:10,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:37:10,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:37:10,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:10,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:10,097 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:10,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 12:37:10,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:37:10,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:37:10,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:37:10,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 12:37:10,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:37:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:37:10,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:10,099 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:10,099 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:37:10,158 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:10,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 222 flow [2025-02-06 12:37:10,172 INFO L124 PetriNetUnfolderBase]: 6/76 cut-off events. [2025-02-06 12:37:10,172 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:37:10,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 76 events. 6/76 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 226 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2025-02-06 12:37:10,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 93 transitions, 222 flow [2025-02-06 12:37:10,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 145 flow [2025-02-06 12:37:10,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:10,177 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;@7677137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:10,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:37:10,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:10,180 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 12:37:10,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:10,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:10,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:10,181 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-06 12:37:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 354160805, now seen corresponding path program 1 times [2025-02-06 12:37:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571814542] [2025-02-06 12:37:10,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:10,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:10,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:10,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:10,210 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-06 12:37:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571814542] [2025-02-06 12:37:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571814542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:10,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948524528] [2025-02-06 12:37:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:10,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:10,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:10,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:10,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 93 [2025-02-06 12:37:10,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 145 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-06 12:37:10,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:10,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 93 [2025-02-06 12:37:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:15,333 INFO L124 PetriNetUnfolderBase]: 58806/78313 cut-off events. [2025-02-06 12:37:15,333 INFO L125 PetriNetUnfolderBase]: For 3412/3412 co-relation queries the response was YES. [2025-02-06 12:37:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156771 conditions, 78313 events. 58806/78313 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 2927. Compared 506299 event pairs, 54173 based on Foata normal form. 13174/86402 useless extension candidates. Maximal degree in co-relation 156759. Up to 76375 conditions per place. [2025-02-06 12:37:15,946 INFO L140 encePairwiseOnDemand]: 89/93 looper letters, 44 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2025-02-06 12:37:15,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 219 flow [2025-02-06 12:37:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-02-06 12:37:15,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-02-06 12:37:15,948 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 145 flow. Second operand 2 states and 102 transitions. [2025-02-06 12:37:15,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 219 flow [2025-02-06 12:37:15,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:15,957 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 128 flow [2025-02-06 12:37:15,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-02-06 12:37:15,958 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2025-02-06 12:37:15,958 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 128 flow [2025-02-06 12:37:15,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-06 12:37:15,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:15,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:15,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:37:15,959 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-06 12:37:15,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -299389960, now seen corresponding path program 1 times [2025-02-06 12:37:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730861379] [2025-02-06 12:37:15,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:15,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:15,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:16,028 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-06 12:37:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730861379] [2025-02-06 12:37:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730861379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:16,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:16,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821829414] [2025-02-06 12:37:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:16,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:16,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:16,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:16,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 93 [2025-02-06 12:37:16,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 12:37:16,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:16,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 93 [2025-02-06 12:37:16,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:19,103 INFO L124 PetriNetUnfolderBase]: 43007/57637 cut-off events. [2025-02-06 12:37:19,103 INFO L125 PetriNetUnfolderBase]: For 1482/1482 co-relation queries the response was YES. [2025-02-06 12:37:19,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115022 conditions, 57637 events. 43007/57637 cut-off events. For 1482/1482 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 365255 event pairs, 39532 based on Foata normal form. 4391/58214 useless extension candidates. Maximal degree in co-relation 115016. Up to 56183 conditions per place. [2025-02-06 12:37:19,426 INFO L140 encePairwiseOnDemand]: 91/93 looper letters, 42 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-02-06 12:37:19,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 208 flow [2025-02-06 12:37:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-02-06 12:37:19,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2025-02-06 12:37:19,429 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 128 flow. Second operand 3 states and 125 transitions. [2025-02-06 12:37:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 208 flow [2025-02-06 12:37:19,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:19,432 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 124 flow [2025-02-06 12:37:19,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-02-06 12:37:19,433 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-02-06 12:37:19,433 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 124 flow [2025-02-06 12:37:19,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 12:37:19,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:19,434 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:19,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:37:19,434 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-06 12:37:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -532868492, now seen corresponding path program 1 times [2025-02-06 12:37:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853211115] [2025-02-06 12:37:19,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:19,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:37:19,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:37:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:19,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:37:19,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:37:19,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:19,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:19,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:19,610 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:37:19,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:37:19,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:37:19,611 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:19,611 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:19,611 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:37:19,661 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:19,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 121 transitions, 298 flow [2025-02-06 12:37:19,675 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2025-02-06 12:37:19,675 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:37:19,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 94 events. 7/94 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 294 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 110. Up to 5 conditions per place. [2025-02-06 12:37:19,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 121 transitions, 298 flow [2025-02-06 12:37:19,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 75 transitions, 181 flow [2025-02-06 12:37:19,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:19,681 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;@7677137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:19,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:37:19,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:19,685 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:19,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:19,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:19,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:19,686 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-06 12:37:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 470436067, now seen corresponding path program 1 times [2025-02-06 12:37:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379183395] [2025-02-06 12:37:19,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:19,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:19,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:19,706 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-06 12:37:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379183395] [2025-02-06 12:37:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379183395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:19,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848257496] [2025-02-06 12:37:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:19,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 121 [2025-02-06 12:37:19,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 181 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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-06 12:37:19,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:19,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 121 [2025-02-06 12:37:19,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand