./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --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 00:56:58,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:56:59,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:56:59,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:56:59,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:56:59,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:56:59,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:56:59,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:56:59,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:56:59,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:56:59,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:56:59,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:56:59,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:56:59,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:56:59,082 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:56:59,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:56:59,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:56:59,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:56:59,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:56:59,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:56:59,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:56:59,085 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 ! call(reach_error())) ) 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 00:56:59,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:56:59,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:56:59,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:56:59,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:56:59,358 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:56:59,359 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 00:57:00,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69167c6/ba1936c31cc4423d8670834e5e38c073/FLAGda01ba81a [2025-02-08 00:57:00,787 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:57:00,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-02-08 00:57:00,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69167c6/ba1936c31cc4423d8670834e5e38c073/FLAGda01ba81a [2025-02-08 00:57:01,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad69167c6/ba1936c31cc4423d8670834e5e38c073 [2025-02-08 00:57:01,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:57:01,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:57:01,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:57:01,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:57:01,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:57:01,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e382dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01, skipping insertion in model container [2025-02-08 00:57:01,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:57:01,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2025-02-08 00:57:01,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:57:01,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:57:01,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2025-02-08 00:57:01,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:57:01,385 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:57:01,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01 WrapperNode [2025-02-08 00:57:01,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:57:01,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:57:01,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:57:01,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:57:01,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,405 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-02-08 00:57:01,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:57:01,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:57:01,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:57:01,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:57:01,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,418 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 00:57:01,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:57:01,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:57:01,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:57:01,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:57:01,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (1/1) ... [2025-02-08 00:57:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:57:01,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:57:01,444 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 00:57:01,446 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 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-08 00:57:01,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:57:01,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 00:57:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:57:01,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:57:01,461 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 00:57:01,542 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:57:01,543 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:57:01,600 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 00:57:01,653 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:57:01,653 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:57:01,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:57:01,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:57:01,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:57:01 BoogieIcfgContainer [2025-02-08 00:57:01,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:57:01,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:57:01,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:57:01,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:57:01,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:57:01" (1/3) ... [2025-02-08 00:57:01,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c6ee0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:57:01, skipping insertion in model container [2025-02-08 00:57:01,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:57:01" (2/3) ... [2025-02-08 00:57:01,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c6ee0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:57:01, skipping insertion in model container [2025-02-08 00:57:01,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:57:01" (3/3) ... [2025-02-08 00:57:01,715 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-02-08 00:57:01,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:57:01,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 00:57:01,726 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:57:01,767 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:01,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 70 flow [2025-02-08 00:57:01,803 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-02-08 00:57:01,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:57:01,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 2/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-02-08 00:57:01,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 70 flow [2025-02-08 00:57:01,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 67 flow [2025-02-08 00:57:01,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:01,821 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=LoopHeads, 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;@7e3db2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:01,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:57:01,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:01,826 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-02-08 00:57:01,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:57:01,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:01,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:01,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 00:57:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1720184421, now seen corresponding path program 1 times [2025-02-08 00:57:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748411221] [2025-02-08 00:57:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:01,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:01,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:01,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:01,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:01,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:01,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:01,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:01,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:01,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:01,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:01,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:57:01,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:57:01,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 00:57:01,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:57:01,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:57:01,955 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:57:01,958 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:01,959 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:57:01,984 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 55 transitions, 130 flow [2025-02-08 00:57:02,002 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-02-08 00:57:02,005 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:57:02,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 2/47 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 54. Up to 3 conditions per place. [2025-02-08 00:57:02,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 55 transitions, 130 flow [2025-02-08 00:57:02,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 42 transitions, 97 flow [2025-02-08 00:57:02,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:02,010 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=LoopHeads, 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;@7e3db2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:02,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:57:02,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:02,018 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-02-08 00:57:02,018 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:57:02,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:02,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:02,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:57:02,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1908894079, now seen corresponding path program 1 times [2025-02-08 00:57:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436901053] [2025-02-08 00:57:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:02,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:02,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:02,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:02,144 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 00:57:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436901053] [2025-02-08 00:57:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436901053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:02,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:57:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230859780] [2025-02-08 00:57:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:02,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:57:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:02,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:57:02,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:57:02,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-02-08 00:57:02,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 00:57:02,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:02,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-02-08 00:57:02,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:02,494 INFO L124 PetriNetUnfolderBase]: 2069/3373 cut-off events. [2025-02-08 00:57:02,494 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-02-08 00:57:02,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 3373 events. 2069/3373 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20885 event pairs, 2068 based on Foata normal form. 664/3826 useless extension candidates. Maximal degree in co-relation 6533. Up to 3068 conditions per place. [2025-02-08 00:57:02,557 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 26 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-02-08 00:57:02,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 141 flow [2025-02-08 00:57:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:57:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:57:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 00:57:02,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-02-08 00:57:02,569 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 97 flow. Second operand 3 states and 84 transitions. [2025-02-08 00:57:02,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 141 flow [2025-02-08 00:57:02,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 00:57:02,575 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 88 flow [2025-02-08 00:57:02,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-02-08 00:57:02,580 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-02-08 00:57:02,581 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 88 flow [2025-02-08 00:57:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 00:57:02,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:02,582 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:57:02,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:57:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2114311214, now seen corresponding path program 1 times [2025-02-08 00:57:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:02,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207037653] [2025-02-08 00:57:02,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:57:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:57:02,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:02,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:02,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:02,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:57:02,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:57:02,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:02,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:02,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:02,627 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:02,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:57:02,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:57:02,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 00:57:02,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:57:02,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:57:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:57:02,630 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:57:02,631 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:02,631 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:57:02,661 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:02,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 194 flow [2025-02-08 00:57:02,671 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2025-02-08 00:57:02,671 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:57:02,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 62 events. 2/62 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2025-02-08 00:57:02,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 194 flow [2025-02-08 00:57:02,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 129 flow [2025-02-08 00:57:02,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:02,674 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=LoopHeads, 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;@7e3db2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:02,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:57:02,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:02,677 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 00:57:02,677 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:57:02,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:02,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:02,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 00:57:02,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 440238519, now seen corresponding path program 1 times [2025-02-08 00:57:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794884145] [2025-02-08 00:57:02,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:02,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:02,709 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 00:57:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794884145] [2025-02-08 00:57:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794884145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:02,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:57:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939087061] [2025-02-08 00:57:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:57:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:57:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:57:02,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-02-08 00:57:02,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 00:57:02,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:02,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-02-08 00:57:02,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:57:05,108 INFO L124 PetriNetUnfolderBase]: 29669/43045 cut-off events. [2025-02-08 00:57:05,109 INFO L125 PetriNetUnfolderBase]: For 2136/2136 co-relation queries the response was YES. [2025-02-08 00:57:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84017 conditions, 43045 events. 29669/43045 cut-off events. For 2136/2136 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 309246 event pairs, 29668 based on Foata normal form. 6664/46588 useless extension candidates. Maximal degree in co-relation 84005. Up to 39668 conditions per place. [2025-02-08 00:57:05,527 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 36 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-02-08 00:57:05,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 193 flow [2025-02-08 00:57:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:57:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:57:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-02-08 00:57:05,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4978902953586498 [2025-02-08 00:57:05,531 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 129 flow. Second operand 3 states and 118 transitions. [2025-02-08 00:57:05,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 193 flow [2025-02-08 00:57:05,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 190 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 00:57:05,536 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 118 flow [2025-02-08 00:57:05,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=59, PETRI_TRANSITIONS=49} [2025-02-08 00:57:05,537 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-02-08 00:57:05,537 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 118 flow [2025-02-08 00:57:05,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 00:57:05,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:05,537 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:05,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:57:05,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 00:57:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1271693830, now seen corresponding path program 1 times [2025-02-08 00:57:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033544811] [2025-02-08 00:57:05,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:57:05,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:57:05,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:05,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:57:05,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:57:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:57:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:57:05,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:57:05,583 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-08 00:57:05,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 00:57:05,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:57:05,583 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:57:05,584 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:57:05,584 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:57:05,618 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:57:05,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 103 transitions, 262 flow [2025-02-08 00:57:05,628 INFO L124 PetriNetUnfolderBase]: 2/77 cut-off events. [2025-02-08 00:57:05,628 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:57:05,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 77 events. 2/77 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 204 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-02-08 00:57:05,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 103 transitions, 262 flow [2025-02-08 00:57:05,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 66 transitions, 163 flow [2025-02-08 00:57:05,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:57:05,630 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=LoopHeads, 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;@7e3db2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:57:05,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:57:05,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:57:05,631 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-02-08 00:57:05,631 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:57:05,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:57:05,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:57:05,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:57:05,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:57:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1767148275, now seen corresponding path program 1 times [2025-02-08 00:57:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:57:05,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367157659] [2025-02-08 00:57:05,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:57:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:57:05,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 00:57:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 00:57:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:57:05,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:57:05,664 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 00:57:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:57:05,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367157659] [2025-02-08 00:57:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367157659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:57:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:57:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:57:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646804473] [2025-02-08 00:57:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:57:05,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:57:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:57:05,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:57:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:57:05,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 103 [2025-02-08 00:57:05,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 00:57:05,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:57:05,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 103 [2025-02-08 00:57:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand