./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 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/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-?-48c9605-m [2025-02-08 08:13:03,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:13:03,997 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:04,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:13:04,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:13:04,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:13:04,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:13:04,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:13:04,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:13:04,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:13:04,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:13:04,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:13:04,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:13:04,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:13:04,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:13:04,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:13:04,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:13:04,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:04,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:13:04,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:13:04,026 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-08 08:13:04,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:13:04,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:13:04,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:13:04,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:13:04,240 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:13:04,241 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-08 08:13:05,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ac04372/f21b3fe8094c45ba92e64f375e1bca5c/FLAG30499b795 [2025-02-08 08:13:05,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:13:05,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-02-08 08:13:05,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ac04372/f21b3fe8094c45ba92e64f375e1bca5c/FLAG30499b795 [2025-02-08 08:13:05,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ac04372/f21b3fe8094c45ba92e64f375e1bca5c [2025-02-08 08:13:05,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:13:05,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:13:05,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:05,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:13:05,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:13:05,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:05" (1/1) ... [2025-02-08 08:13:05,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:05, skipping insertion in model container [2025-02-08 08:13:05,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:13:05" (1/1) ... [2025-02-08 08:13:05,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:13:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:06,156 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:13:06,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:13:06,209 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:13:06,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:06 WrapperNode [2025-02-08 08:13:06,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:13:06,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:06,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:13:06,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:13:06,217 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:06" (1/1) ... [2025-02-08 08:13:06,226 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:06" (1/1) ... [2025-02-08 08:13:06,241 INFO L138 Inliner]: procedures = 164, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-02-08 08:13:06,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:13:06,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:13:06,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:13:06,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:13:06,248 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:06" (1/1) ... [2025-02-08 08:13:06,248 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:06" (1/1) ... [2025-02-08 08:13:06,250 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:06" (1/1) ... [2025-02-08 08:13:06,267 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:06,269 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:06" (1/1) ... [2025-02-08 08:13:06,269 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:06" (1/1) ... [2025-02-08 08:13:06,276 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:06" (1/1) ... [2025-02-08 08:13:06,276 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:06" (1/1) ... [2025-02-08 08:13:06,277 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:06" (1/1) ... [2025-02-08 08:13:06,278 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:06" (1/1) ... [2025-02-08 08:13:06,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:13:06,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:13:06,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:13:06,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:13:06,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:06" (1/1) ... [2025-02-08 08:13:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:13:06,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:13:06,316 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:06,318 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:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-08 08:13:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 08:13:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:13:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:13:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:13:06,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:13:06,337 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:06,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:13:06,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:13:06,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc my_thread1_#t~ret1#1, my_thread1_#t~post2#1, my_thread1_#t~post3#1, my_thread1_#t~ret4#1, my_thread1_#t~ret5#1, my_thread1_#t~post6#1, my_thread1_#t~post7#1, my_thread1_#t~ret8#1;assume { :end_inline_my_thread1 } true; [2025-02-08 08:13:06,590 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:13:06,590 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:13:06,659 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:13:06,663 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:13:06,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:06 BoogieIcfgContainer [2025-02-08 08:13:06,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:13:06,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:13:06,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:13:06,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:13:06,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:13:05" (1/3) ... [2025-02-08 08:13:06,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:06, skipping insertion in model container [2025-02-08 08:13:06,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:13:06" (2/3) ... [2025-02-08 08:13:06,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:13:06, skipping insertion in model container [2025-02-08 08:13:06,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:13:06" (3/3) ... [2025-02-08 08:13:06,671 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-02-08 08:13:06,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:13:06,683 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-08 08:13:06,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:13:06,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:06,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 80 flow [2025-02-08 08:13:06,764 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-02-08 08:13:06,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:06,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-08 08:13:06,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 80 flow [2025-02-08 08:13:06,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 77 flow [2025-02-08 08:13:06,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:06,786 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;@ed8019e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:06,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:13:06,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:06,793 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:06,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:06,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:06,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:06,794 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:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 204485756, now seen corresponding path program 1 times [2025-02-08 08:13:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605219444] [2025-02-08 08:13:06,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:06,864 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,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:06,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:06,907 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,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605219444] [2025-02-08 08:13:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605219444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:06,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-02-08 08:13:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:06,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:06,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:06,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:06,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:06,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 08:13:06,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:06,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:06,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 08:13:06,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:07,036 INFO L124 PetriNetUnfolderBase]: 169/340 cut-off events. [2025-02-08 08:13:07,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:07,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 340 events. 169/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1733 event pairs, 168 based on Foata normal form. 97/420 useless extension candidates. Maximal degree in co-relation 645. Up to 302 conditions per place. [2025-02-08 08:13:07,043 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 18 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2025-02-08 08:13:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 99 flow [2025-02-08 08:13:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2025-02-08 08:13:07,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-02-08 08:13:07,053 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 77 flow. Second operand 2 states and 46 transitions. [2025-02-08 08:13:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 99 flow [2025-02-08 08:13:07,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:07,058 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 62 flow [2025-02-08 08:13:07,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-02-08 08:13:07,062 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2025-02-08 08:13:07,062 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 62 flow [2025-02-08 08:13:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:07,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:07,063 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:07,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:13:07,063 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-08 08:13:07,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1573957239, now seen corresponding path program 1 times [2025-02-08 08:13:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:07,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261457353] [2025-02-08 08:13:07,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:07,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:07,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:07,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:13:07,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:13:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:07,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:07,120 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:07,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 08:13:07,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:13:07,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-08 08:13:07,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 08:13:07,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-08 08:13:07,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:13:07,123 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:13:07,126 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:07,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:13:07,158 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:07,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 63 transitions, 146 flow [2025-02-08 08:13:07,183 INFO L124 PetriNetUnfolderBase]: 3/56 cut-off events. [2025-02-08 08:13:07,184 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:13:07,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 56 events. 3/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 63. Up to 3 conditions per place. [2025-02-08 08:13:07,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 63 transitions, 146 flow [2025-02-08 08:13:07,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 47 transitions, 107 flow [2025-02-08 08:13:07,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:07,186 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;@ed8019e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:07,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:13:07,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:07,189 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:07,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:07,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:07,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:07,189 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:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 265381537, now seen corresponding path program 1 times [2025-02-08 08:13:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488761216] [2025-02-08 08:13:07,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:07,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:07,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:07,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:07,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:07,223 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:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488761216] [2025-02-08 08:13:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488761216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861771226] [2025-02-08 08:13:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:07,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:07,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:07,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:07,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 63 [2025-02-08 08:13:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 107 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 63 [2025-02-08 08:13:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:07,613 INFO L124 PetriNetUnfolderBase]: 2869/4608 cut-off events. [2025-02-08 08:13:07,614 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-02-08 08:13:07,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8944 conditions, 4608 events. 2869/4608 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 29496 event pairs, 2868 based on Foata normal form. 997/5324 useless extension candidates. Maximal degree in co-relation 8933. Up to 4202 conditions per place. [2025-02-08 08:13:07,699 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 28 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2025-02-08 08:13:07,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 149 flow [2025-02-08 08:13:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2025-02-08 08:13:07,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-02-08 08:13:07,701 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 107 flow. Second operand 2 states and 74 transitions. [2025-02-08 08:13:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 149 flow [2025-02-08 08:13:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:07,704 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 92 flow [2025-02-08 08:13:07,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-02-08 08:13:07,705 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-08 08:13:07,705 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 92 flow [2025-02-08 08:13:07,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:07,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:07,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:13:07,706 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:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1920048317, now seen corresponding path program 1 times [2025-02-08 08:13:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-02-08 08:13:07,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:07,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:07,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:07,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:07,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:07,766 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:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-02-08 08:13:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408619316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:07,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470775444] [2025-02-08 08:13:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:07,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:07,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:07,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:07,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:07,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 63 [2025-02-08 08:13:07,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:07,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:07,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 63 [2025-02-08 08:13:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:07,987 INFO L124 PetriNetUnfolderBase]: 2069/3373 cut-off events. [2025-02-08 08:13:07,987 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-02-08 08:13:07,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 3373 events. 2069/3373 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20860 event pairs, 2068 based on Foata normal form. 332/3494 useless extension candidates. Maximal degree in co-relation 6539. Up to 3068 conditions per place. [2025-02-08 08:13:08,019 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 26 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-02-08 08:13:08,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 140 flow [2025-02-08 08:13:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-02-08 08:13:08,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-02-08 08:13:08,020 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 92 flow. Second operand 3 states and 91 transitions. [2025-02-08 08:13:08,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 140 flow [2025-02-08 08:13:08,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:08,021 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 88 flow [2025-02-08 08:13:08,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 08:13:08,022 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-02-08 08:13:08,022 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 88 flow [2025-02-08 08:13:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:08,022 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:08,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:13:08,022 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-08 08:13:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1663425564, now seen corresponding path program 1 times [2025-02-08 08:13:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693545338] [2025-02-08 08:13:08,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:08,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:13:08,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:13:08,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:08,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:13:08,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:13:08,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:08,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:08,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:08,064 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:08,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 08:13:08,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:13:08,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:13:08,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:13:08,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-08 08:13:08,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:13:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:13:08,068 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:13:08,068 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:08,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:13:08,098 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:08,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 216 flow [2025-02-08 08:13:08,108 INFO L124 PetriNetUnfolderBase]: 3/73 cut-off events. [2025-02-08 08:13:08,108 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:13:08,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 73 events. 3/73 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 214 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2025-02-08 08:13:08,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 216 flow [2025-02-08 08:13:08,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 139 flow [2025-02-08 08:13:08,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:08,111 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;@ed8019e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:08,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:13:08,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:08,113 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 08:13:08,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:08,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:08,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:08,114 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:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 352043553, now seen corresponding path program 1 times [2025-02-08 08:13:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264437160] [2025-02-08 08:13:08,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:08,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:08,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:08,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:08,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:08,134 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264437160] [2025-02-08 08:13:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264437160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214559587] [2025-02-08 08:13:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:08,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:08,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:08,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:08,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 90 [2025-02-08 08:13:08,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 139 flow. Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:08,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 90 [2025-02-08 08:13:08,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:11,089 INFO L124 PetriNetUnfolderBase]: 40669/58504 cut-off events. [2025-02-08 08:13:11,089 INFO L125 PetriNetUnfolderBase]: For 2848/2848 co-relation queries the response was YES. [2025-02-08 08:13:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114241 conditions, 58504 events. 40669/58504 cut-off events. For 2848/2848 co-relation queries the response was YES. Maximal size of possible extension queue 2314. Compared 428517 event pairs, 40668 based on Foata normal form. 9998/64342 useless extension candidates. Maximal degree in co-relation 114229. Up to 54002 conditions per place. [2025-02-08 08:13:11,389 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 38 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-02-08 08:13:11,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 201 flow [2025-02-08 08:13:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:13:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:13:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-02-08 08:13:11,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 08:13:11,391 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 139 flow. Second operand 2 states and 102 transitions. [2025-02-08 08:13:11,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 201 flow [2025-02-08 08:13:11,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 198 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:13:11,395 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 122 flow [2025-02-08 08:13:11,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=122, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-02-08 08:13:11,398 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2025-02-08 08:13:11,398 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 122 flow [2025-02-08 08:13:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:11,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:11,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:11,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:13:11,398 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:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 851278198, now seen corresponding path program 1 times [2025-02-08 08:13:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62943133] [2025-02-08 08:13:11,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:11,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:13:11,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:13:11,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:11,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:11,449 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:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62943133] [2025-02-08 08:13:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62943133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443360164] [2025-02-08 08:13:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:13:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:11,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:13:11,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:13:11,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 90 [2025-02-08 08:13:11,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:11,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:11,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 90 [2025-02-08 08:13:11,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:13:13,385 INFO L124 PetriNetUnfolderBase]: 29669/43045 cut-off events. [2025-02-08 08:13:13,385 INFO L125 PetriNetUnfolderBase]: For 1248/1248 co-relation queries the response was YES. [2025-02-08 08:13:13,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83717 conditions, 43045 events. 29669/43045 cut-off events. For 1248/1248 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 309325 event pairs, 29668 based on Foata normal form. 3332/43257 useless extension candidates. Maximal degree in co-relation 83711. Up to 39668 conditions per place. [2025-02-08 08:13:13,574 INFO L140 encePairwiseOnDemand]: 88/90 looper letters, 36 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-02-08 08:13:13,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 190 flow [2025-02-08 08:13:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:13:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:13:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-08 08:13:13,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2025-02-08 08:13:13,576 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 122 flow. Second operand 3 states and 128 transitions. [2025-02-08 08:13:13,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 190 flow [2025-02-08 08:13:13,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:13:13,579 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 118 flow [2025-02-08 08:13:13,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-02-08 08:13:13,579 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-02-08 08:13:13,579 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 118 flow [2025-02-08 08:13:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:13:13,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:13,580 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:13:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:13:13,580 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:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1506772490, now seen corresponding path program 1 times [2025-02-08 08:13:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-02-08 08:13:13,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:13:13,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:13:13,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:13,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:13:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:13:13,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:13:13,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:13,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:13:13,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:13:13,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-08 08:13:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:13:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:13:13,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:13:13,604 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:13:13,604 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:13:13,629 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:13:13,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 117 transitions, 290 flow [2025-02-08 08:13:13,635 INFO L124 PetriNetUnfolderBase]: 3/90 cut-off events. [2025-02-08 08:13:13,636 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:13:13,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 90 events. 3/90 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 278 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 106. Up to 5 conditions per place. [2025-02-08 08:13:13,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 117 transitions, 290 flow [2025-02-08 08:13:13,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 71 transitions, 173 flow [2025-02-08 08:13:13,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:13:13,639 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;@ed8019e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:13:13,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:13:13,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:13:13,641 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-08 08:13:13,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:13:13,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:13:13,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:13:13,642 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:13,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:13:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 464471804, now seen corresponding path program 1 times [2025-02-08 08:13:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:13:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222438125] [2025-02-08 08:13:13,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:13:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:13:13,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:13:13,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:13:13,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:13:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:13:13,654 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:13,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:13:13,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222438125] [2025-02-08 08:13:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222438125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:13:13,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:13:13,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:13:13,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103184797] [2025-02-08 08:13:13,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:13:13,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:13:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:13:13,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:13:13,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:13:13,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2025-02-08 08:13:13,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 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:13,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:13:13,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2025-02-08 08:13:13,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand