./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:09:13,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:09:13,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:09:13,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:09:13,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:09:13,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:09:13,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:09:13,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:09:13,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:09:13,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:09:13,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:09:13,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:09:13,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:09:13,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:09:13,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:09:13,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:09:13,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:09:13,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:09:13,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:09:13,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:09:13,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:09:13,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:09:13,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:09:13,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:09:13,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:09:13,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:09:13,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:09:13,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:09:13,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:09:13,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:09:13,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:09:13,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:09:13,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:09:13,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:09:13,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:09:13,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:09:13,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:09:13,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:09:13,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:09:13,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:09:13,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:09:13,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:09:13,735 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2024-11-10 10:09:14,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:09:14,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:09:14,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:09:14,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:09:14,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:09:14,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2024-11-10 10:09:15,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:09:15,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:09:15,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2024-11-10 10:09:15,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43ccf6ed/b2c539b91e5142bc8bd4d1eb67650063/FLAGef7522acb [2024-11-10 10:09:15,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43ccf6ed/b2c539b91e5142bc8bd4d1eb67650063 [2024-11-10 10:09:15,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:09:15,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:09:15,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:09:15,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:09:15,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:09:15,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:09:15" (1/1) ... [2024-11-10 10:09:15,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99a0360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:15, skipping insertion in model container [2024-11-10 10:09:15,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:09:15" (1/1) ... [2024-11-10 10:09:15,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:09:16,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30863,30876] [2024-11-10 10:09:16,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:09:16,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:09:16,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30863,30876] [2024-11-10 10:09:16,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:09:16,466 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:09:16,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16 WrapperNode [2024-11-10 10:09:16,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:09:16,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:09:16,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:09:16,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:09:16,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,519 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-10 10:09:16,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:09:16,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:09:16,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:09:16,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:09:16,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,551 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2024-11-10 10:09:16,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:09:16,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:09:16,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:09:16,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:09:16,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (1/1) ... [2024-11-10 10:09:16,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:09:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:16,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:09:16,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:09:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:09:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:09:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:09:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 10:09:16,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 10:09:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:09:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:09:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:09:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:09:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:09:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:09:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:09:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:09:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:09:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:09:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:09:16,653 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:09:16,785 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:09:16,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:09:17,064 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:09:17,065 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:09:17,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:09:17,246 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:09:17,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:09:17 BoogieIcfgContainer [2024-11-10 10:09:17,247 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:09:17,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:09:17,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:09:17,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:09:17,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:09:15" (1/3) ... [2024-11-10 10:09:17,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a8ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:09:17, skipping insertion in model container [2024-11-10 10:09:17,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:16" (2/3) ... [2024-11-10 10:09:17,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a8ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:09:17, skipping insertion in model container [2024-11-10 10:09:17,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:09:17" (3/3) ... [2024-11-10 10:09:17,260 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2024-11-10 10:09:17,274 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:09:17,274 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:09:17,274 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:09:17,316 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:09:17,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 34 transitions, 72 flow [2024-11-10 10:09:17,376 INFO L124 PetriNetUnfolderBase]: 8/39 cut-off events. [2024-11-10 10:09:17,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:09:17,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 8/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 4 conditions per place. [2024-11-10 10:09:17,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 34 transitions, 72 flow [2024-11-10 10:09:17,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 34 transitions, 72 flow [2024-11-10 10:09:17,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:09:17,408 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;@46a228b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:09:17,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:09:17,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:09:17,422 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2024-11-10 10:09:17,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:09:17,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:17,423 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:17,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:09:17,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:17,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1820933304, now seen corresponding path program 1 times [2024-11-10 10:09:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992825767] [2024-11-10 10:09:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992825767] [2024-11-10 10:09:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992825767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:17,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456975241] [2024-11-10 10:09:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:17,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:09:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:09:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:09:17,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2024-11-10 10:09:17,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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) [2024-11-10 10:09:17,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:17,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2024-11-10 10:09:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:17,770 INFO L124 PetriNetUnfolderBase]: 21/82 cut-off events. [2024-11-10 10:09:17,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:09:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 82 events. 21/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 16 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 115. Up to 51 conditions per place. [2024-11-10 10:09:17,773 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 15 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2024-11-10 10:09:17,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 90 flow [2024-11-10 10:09:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:09:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:09:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2024-11-10 10:09:17,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-11-10 10:09:17,788 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 72 flow. Second operand 2 states and 46 transitions. [2024-11-10 10:09:17,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 90 flow [2024-11-10 10:09:17,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:17,793 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 60 flow [2024-11-10 10:09:17,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=60, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2024-11-10 10:09:17,798 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2024-11-10 10:09:17,798 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 60 flow [2024-11-10 10:09:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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) [2024-11-10 10:09:17,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:17,799 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:17,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:09:17,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:09:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1172588729, now seen corresponding path program 1 times [2024-11-10 10:09:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173206776] [2024-11-10 10:09:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173206776] [2024-11-10 10:09:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173206776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741239122] [2024-11-10 10:09:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:17,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-10 10:09:17,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:17,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:17,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-10 10:09:17,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:18,043 INFO L124 PetriNetUnfolderBase]: 21/84 cut-off events. [2024-11-10 10:09:18,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:09:18,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 84 events. 21/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 16 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 138. Up to 52 conditions per place. [2024-11-10 10:09:18,045 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 15 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-10 10:09:18,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 96 flow [2024-11-10 10:09:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-11-10 10:09:18,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2024-11-10 10:09:18,047 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 60 flow. Second operand 3 states and 54 transitions. [2024-11-10 10:09:18,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 96 flow [2024-11-10 10:09:18,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:18,050 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 72 flow [2024-11-10 10:09:18,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2024-11-10 10:09:18,051 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2024-11-10 10:09:18,051 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 72 flow [2024-11-10 10:09:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:18,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:18,052 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:18,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:09:18,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:09:18,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1109194670, now seen corresponding path program 1 times [2024-11-10 10:09:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680171292] [2024-11-10 10:09:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680171292] [2024-11-10 10:09:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680171292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131795906] [2024-11-10 10:09:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:18,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:18,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:09:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:18,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:09:18,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131795906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:18,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:18,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:09:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985451205] [2024-11-10 10:09:18,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:18,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:09:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:18,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:09:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:09:18,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-10 10:09:18,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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) [2024-11-10 10:09:18,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:18,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-10 10:09:18,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:18,427 INFO L124 PetriNetUnfolderBase]: 21/90 cut-off events. [2024-11-10 10:09:18,427 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:09:18,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 90 events. 21/90 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 16 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 155. Up to 52 conditions per place. [2024-11-10 10:09:18,429 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 15 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2024-11-10 10:09:18,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 124 flow [2024-11-10 10:09:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:09:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:09:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-10 10:09:18,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2024-11-10 10:09:18,431 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 72 flow. Second operand 6 states and 95 transitions. [2024-11-10 10:09:18,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 124 flow [2024-11-10 10:09:18,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:18,434 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 106 flow [2024-11-10 10:09:18,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-11-10 10:09:18,434 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-11-10 10:09:18,435 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 106 flow [2024-11-10 10:09:18,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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) [2024-11-10 10:09:18,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:18,435 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:18,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:09:18,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:18,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:09:18,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1802533277, now seen corresponding path program 2 times [2024-11-10 10:09:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370992614] [2024-11-10 10:09:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:18,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370992614] [2024-11-10 10:09:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370992614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:18,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901557545] [2024-11-10 10:09:18,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:09:18,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:18,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:18,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:18,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:09:18,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:09:18,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:09:18,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:09:18,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:09:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901557545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:18,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 10:09:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124148955] [2024-11-10 10:09:18,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:18,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:09:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:18,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:09:18,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:09:18,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-10 10:09:18,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 106 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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) [2024-11-10 10:09:18,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:18,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-10 10:09:18,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:19,051 INFO L124 PetriNetUnfolderBase]: 21/94 cut-off events. [2024-11-10 10:09:19,051 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-10 10:09:19,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 94 events. 21/94 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 16 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 176. Up to 52 conditions per place. [2024-11-10 10:09:19,052 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 15 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2024-11-10 10:09:19,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 162 flow [2024-11-10 10:09:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:09:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:09:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-11-10 10:09:19,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2024-11-10 10:09:19,055 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 106 flow. Second operand 8 states and 120 transitions. [2024-11-10 10:09:19,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 162 flow [2024-11-10 10:09:19,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 154 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:19,057 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 134 flow [2024-11-10 10:09:19,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2024-11-10 10:09:19,058 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-11-10 10:09:19,058 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 134 flow [2024-11-10 10:09:19,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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) [2024-11-10 10:09:19,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:19,059 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 6, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:19,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 10:09:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 10:09:19,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:09:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1639015567, now seen corresponding path program 3 times [2024-11-10 10:09:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267183931] [2024-11-10 10:09:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:19,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:19,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:09:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:19,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:09:19,353 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:09:19,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-10 10:09:19,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-10 10:09:19,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-10 10:09:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:09:19,357 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:09:19,359 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:09:19,359 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:09:19,388 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:09:19,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 55 transitions, 120 flow [2024-11-10 10:09:19,403 INFO L124 PetriNetUnfolderBase]: 13/66 cut-off events. [2024-11-10 10:09:19,404 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:09:19,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 13/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2024-11-10 10:09:19,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 55 transitions, 120 flow [2024-11-10 10:09:19,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 55 transitions, 120 flow [2024-11-10 10:09:19,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:09:19,412 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;@46a228b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:09:19,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:09:19,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:09:19,417 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2024-11-10 10:09:19,418 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:09:19,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:19,418 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:19,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:19,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -548182410, now seen corresponding path program 1 times [2024-11-10 10:09:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500233884] [2024-11-10 10:09:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500233884] [2024-11-10 10:09:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500233884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336794844] [2024-11-10 10:09:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:19,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:09:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:09:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:09:19,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-10 10:09:19,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 55 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2024-11-10 10:09:19,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:19,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-10 10:09:19,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:19,601 INFO L124 PetriNetUnfolderBase]: 449/998 cut-off events. [2024-11-10 10:09:19,601 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 10:09:19,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 998 events. 449/998 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5785 event pairs, 376 based on Foata normal form. 230/1169 useless extension candidates. Maximal degree in co-relation 982. Up to 708 conditions per place. [2024-11-10 10:09:19,611 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 25 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-11-10 10:09:19,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 154 flow [2024-11-10 10:09:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:09:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:09:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2024-11-10 10:09:19,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-10 10:09:19,613 INFO L175 Difference]: Start difference. First operand has 49 places, 55 transitions, 120 flow. Second operand 2 states and 76 transitions. [2024-11-10 10:09:19,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 154 flow [2024-11-10 10:09:19,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:19,614 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 104 flow [2024-11-10 10:09:19,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-11-10 10:09:19,615 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-10 10:09:19,616 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 104 flow [2024-11-10 10:09:19,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2024-11-10 10:09:19,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:19,616 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:19,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:09:19,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash 205642734, now seen corresponding path program 1 times [2024-11-10 10:09:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170298054] [2024-11-10 10:09:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170298054] [2024-11-10 10:09:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170298054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496330022] [2024-11-10 10:09:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:19,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:19,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 10:09:19,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:19,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:19,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 10:09:19,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:19,819 INFO L124 PetriNetUnfolderBase]: 449/1000 cut-off events. [2024-11-10 10:09:19,819 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-10 10:09:19,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 1000 events. 449/1000 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5780 event pairs, 376 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1738. Up to 709 conditions per place. [2024-11-10 10:09:19,827 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-11-10 10:09:19,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 160 flow [2024-11-10 10:09:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-10 10:09:19,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-10 10:09:19,829 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 104 flow. Second operand 3 states and 91 transitions. [2024-11-10 10:09:19,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 160 flow [2024-11-10 10:09:19,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:19,831 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 116 flow [2024-11-10 10:09:19,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-10 10:09:19,832 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-10 10:09:19,832 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 116 flow [2024-11-10 10:09:19,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:19,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:19,833 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:19,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:09:19,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1415134823, now seen corresponding path program 1 times [2024-11-10 10:09:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897329534] [2024-11-10 10:09:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897329534] [2024-11-10 10:09:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897329534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185722845] [2024-11-10 10:09:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:19,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:19,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:19,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:19,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:09:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:19,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:09:19,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:19,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185722845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:20,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:09:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250652389] [2024-11-10 10:09:20,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:09:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:09:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:09:20,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 10:09:20,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2024-11-10 10:09:20,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:20,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 10:09:20,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:20,227 INFO L124 PetriNetUnfolderBase]: 449/1006 cut-off events. [2024-11-10 10:09:20,228 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 10:09:20,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 1006 events. 449/1006 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5782 event pairs, 376 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 1755. Up to 709 conditions per place. [2024-11-10 10:09:20,236 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-11-10 10:09:20,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 188 flow [2024-11-10 10:09:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:09:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:09:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-10 10:09:20,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-11-10 10:09:20,239 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 116 flow. Second operand 6 states and 159 transitions. [2024-11-10 10:09:20,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 188 flow [2024-11-10 10:09:20,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:20,241 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 150 flow [2024-11-10 10:09:20,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-10 10:09:20,243 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-10 10:09:20,244 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 150 flow [2024-11-10 10:09:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2024-11-10 10:09:20,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:20,245 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:20,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:09:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:20,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:20,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2101786542, now seen corresponding path program 2 times [2024-11-10 10:09:20,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579163363] [2024-11-10 10:09:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:20,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579163363] [2024-11-10 10:09:20,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579163363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059971608] [2024-11-10 10:09:20,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:09:20,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:20,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:20,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:20,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:09:20,659 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 10:09:20,659 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:09:20,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 10:09:20,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 10:09:20,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:09:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059971608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:09:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-10 10:09:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496523740] [2024-11-10 10:09:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:20,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:09:20,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 10:09:20,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:20,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:20,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 10:09:20,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:20,952 INFO L124 PetriNetUnfolderBase]: 761/1712 cut-off events. [2024-11-10 10:09:20,952 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-10 10:09:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 1712 events. 761/1712 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11229 event pairs, 331 based on Foata normal form. 0/1626 useless extension candidates. Maximal degree in co-relation 2987. Up to 634 conditions per place. [2024-11-10 10:09:20,971 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 46 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-10 10:09:20,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 287 flow [2024-11-10 10:09:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-10 10:09:20,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-10 10:09:20,973 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 150 flow. Second operand 3 states and 108 transitions. [2024-11-10 10:09:20,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 287 flow [2024-11-10 10:09:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 279 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:20,977 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 156 flow [2024-11-10 10:09:20,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-11-10 10:09:20,980 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-10 10:09:20,980 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 156 flow [2024-11-10 10:09:20,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:09:20,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:20,981 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:21,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 10:09:21,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:21,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:21,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 528105549, now seen corresponding path program 1 times [2024-11-10 10:09:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:21,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231915446] [2024-11-10 10:09:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:09:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231915446] [2024-11-10 10:09:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231915446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063426723] [2024-11-10 10:09:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:21,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:09:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:21,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:09:21,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:09:21,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:09:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063426723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:21,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 10:09:21,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908150088] [2024-11-10 10:09:21,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:21,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:09:21,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:09:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:09:21,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-10 10:09:21,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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) [2024-11-10 10:09:21,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:21,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-10 10:09:21,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:21,691 INFO L124 PetriNetUnfolderBase]: 770/1733 cut-off events. [2024-11-10 10:09:21,692 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-11-10 10:09:21,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 1733 events. 770/1733 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 11391 event pairs, 646 based on Foata normal form. 2/1625 useless extension candidates. Maximal degree in co-relation 3191. Up to 1207 conditions per place. [2024-11-10 10:09:21,708 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-11-10 10:09:21,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 236 flow [2024-11-10 10:09:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:09:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:09:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-10 10:09:21,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2024-11-10 10:09:21,711 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 156 flow. Second operand 8 states and 202 transitions. [2024-11-10 10:09:21,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 236 flow [2024-11-10 10:09:21,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 54 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:09:21,716 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 188 flow [2024-11-10 10:09:21,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-11-10 10:09:21,718 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-10 10:09:21,719 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 188 flow [2024-11-10 10:09:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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) [2024-11-10 10:09:21,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:21,720 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:21,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 10:09:21,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 10:09:21,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:09:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 626660479, now seen corresponding path program 2 times [2024-11-10 10:09:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873266022] [2024-11-10 10:09:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:21,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:09:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:21,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:09:21,987 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:09:21,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:09:21,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:09:21,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:09:21,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:09:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:09:21,990 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-11-10 10:09:21,991 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:09:21,991 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:09:22,029 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:09:22,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 76 transitions, 170 flow [2024-11-10 10:09:22,041 INFO L124 PetriNetUnfolderBase]: 18/93 cut-off events. [2024-11-10 10:09:22,041 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 10:09:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 18/93 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 241 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2024-11-10 10:09:22,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 76 transitions, 170 flow [2024-11-10 10:09:22,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 76 transitions, 170 flow [2024-11-10 10:09:22,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:09:22,047 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;@46a228b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:09:22,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:09:22,051 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:09:22,051 INFO L124 PetriNetUnfolderBase]: 8/38 cut-off events. [2024-11-10 10:09:22,051 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:09:22,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:22,052 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:22,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:22,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 424059018, now seen corresponding path program 1 times [2024-11-10 10:09:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167202461] [2024-11-10 10:09:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167202461] [2024-11-10 10:09:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167202461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660198614] [2024-11-10 10:09:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:22,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:09:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:09:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:09:22,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 76 [2024-11-10 10:09:22,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 170 flow. Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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) [2024-11-10 10:09:22,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:22,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 76 [2024-11-10 10:09:22,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:23,164 INFO L124 PetriNetUnfolderBase]: 6458/11318 cut-off events. [2024-11-10 10:09:23,164 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2024-11-10 10:09:23,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20483 conditions, 11318 events. 6458/11318 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 85675 event pairs, 5560 based on Foata normal form. 2866/13614 useless extension candidates. Maximal degree in co-relation 2206. Up to 8808 conditions per place. [2024-11-10 10:09:23,339 INFO L140 encePairwiseOnDemand]: 67/76 looper letters, 35 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2024-11-10 10:09:23,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 220 flow [2024-11-10 10:09:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:09:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:09:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2024-11-10 10:09:23,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6973684210526315 [2024-11-10 10:09:23,341 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 170 flow. Second operand 2 states and 106 transitions. [2024-11-10 10:09:23,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 220 flow [2024-11-10 10:09:23,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:23,345 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 148 flow [2024-11-10 10:09:23,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2024-11-10 10:09:23,346 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-10 10:09:23,347 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 148 flow [2024-11-10 10:09:23,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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) [2024-11-10 10:09:23,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:23,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:09:23,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash 354092110, now seen corresponding path program 1 times [2024-11-10 10:09:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956976682] [2024-11-10 10:09:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956976682] [2024-11-10 10:09:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956976682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:23,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286013399] [2024-11-10 10:09:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:23,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:23,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 76 [2024-11-10 10:09:23,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2024-11-10 10:09:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:23,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 76 [2024-11-10 10:09:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:24,599 INFO L124 PetriNetUnfolderBase]: 6458/11320 cut-off events. [2024-11-10 10:09:24,599 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2024-11-10 10:09:24,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20407 conditions, 11320 events. 6458/11320 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 85712 event pairs, 5560 based on Foata normal form. 0/10749 useless extension candidates. Maximal degree in co-relation 20401. Up to 8809 conditions per place. [2024-11-10 10:09:24,685 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-11-10 10:09:24,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 224 flow [2024-11-10 10:09:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-10 10:09:24,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-11-10 10:09:24,687 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 148 flow. Second operand 3 states and 128 transitions. [2024-11-10 10:09:24,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 224 flow [2024-11-10 10:09:24,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:24,689 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 160 flow [2024-11-10 10:09:24,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-11-10 10:09:24,691 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2024-11-10 10:09:24,691 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 160 flow [2024-11-10 10:09:24,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2024-11-10 10:09:24,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:24,693 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:24,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:09:24,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 405654855, now seen corresponding path program 1 times [2024-11-10 10:09:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094107868] [2024-11-10 10:09:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:24,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094107868] [2024-11-10 10:09:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094107868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510679449] [2024-11-10 10:09:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:24,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:24,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:24,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:24,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 10:09:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:24,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:09:24,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:24,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510679449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:24,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:09:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925743582] [2024-11-10 10:09:24,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:09:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:24,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:09:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:09:24,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 76 [2024-11-10 10:09:24,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 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) [2024-11-10 10:09:24,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:24,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 76 [2024-11-10 10:09:24,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:26,054 INFO L124 PetriNetUnfolderBase]: 6458/11326 cut-off events. [2024-11-10 10:09:26,055 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2024-11-10 10:09:26,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20426 conditions, 11326 events. 6458/11326 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 85774 event pairs, 5560 based on Foata normal form. 0/10755 useless extension candidates. Maximal degree in co-relation 20418. Up to 8809 conditions per place. [2024-11-10 10:09:26,158 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 35 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-11-10 10:09:26,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 252 flow [2024-11-10 10:09:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:09:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:09:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-11-10 10:09:26,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48903508771929827 [2024-11-10 10:09:26,160 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 160 flow. Second operand 6 states and 223 transitions. [2024-11-10 10:09:26,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 252 flow [2024-11-10 10:09:26,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:26,163 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 194 flow [2024-11-10 10:09:26,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2024-11-10 10:09:26,164 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2024-11-10 10:09:26,164 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 194 flow [2024-11-10 10:09:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 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) [2024-11-10 10:09:26,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:26,165 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:26,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 10:09:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:26,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash 463620786, now seen corresponding path program 2 times [2024-11-10 10:09:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153413062] [2024-11-10 10:09:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 10:09:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153413062] [2024-11-10 10:09:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153413062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:26,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:09:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784737488] [2024-11-10 10:09:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:26,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 76 [2024-11-10 10:09:26,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2024-11-10 10:09:26,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:26,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 76 [2024-11-10 10:09:26,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:28,067 INFO L124 PetriNetUnfolderBase]: 10943/19360 cut-off events. [2024-11-10 10:09:28,068 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2024-11-10 10:09:28,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34794 conditions, 19360 events. 10943/19360 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 160161 event pairs, 4912 based on Foata normal form. 0/18576 useless extension candidates. Maximal degree in co-relation 34783. Up to 7834 conditions per place. [2024-11-10 10:09:28,194 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 66 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-11-10 10:09:28,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 98 transitions, 396 flow [2024-11-10 10:09:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-10 10:09:28,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6798245614035088 [2024-11-10 10:09:28,196 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 194 flow. Second operand 3 states and 155 transitions. [2024-11-10 10:09:28,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 98 transitions, 396 flow [2024-11-10 10:09:28,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 388 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:09:28,199 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 200 flow [2024-11-10 10:09:28,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2024-11-10 10:09:28,200 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2024-11-10 10:09:28,200 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 200 flow [2024-11-10 10:09:28,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2024-11-10 10:09:28,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:28,200 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:28,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 10:09:28,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:28,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash -792764361, now seen corresponding path program 1 times [2024-11-10 10:09:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054901861] [2024-11-10 10:09:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-10 10:09:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054901861] [2024-11-10 10:09:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054901861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:09:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054443862] [2024-11-10 10:09:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:28,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 76 [2024-11-10 10:09:28,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2024-11-10 10:09:28,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:28,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 76 [2024-11-10 10:09:28,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:31,079 INFO L124 PetriNetUnfolderBase]: 18626/32724 cut-off events. [2024-11-10 10:09:31,079 INFO L125 PetriNetUnfolderBase]: For 4443/4443 co-relation queries the response was YES. [2024-11-10 10:09:31,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61494 conditions, 32724 events. 18626/32724 cut-off events. For 4443/4443 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 288839 event pairs, 8353 based on Foata normal form. 0/31369 useless extension candidates. Maximal degree in co-relation 61481. Up to 13303 conditions per place. [2024-11-10 10:09:31,294 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 69 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-11-10 10:09:31,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 100 transitions, 417 flow [2024-11-10 10:09:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-10 10:09:31,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2024-11-10 10:09:31,297 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 200 flow. Second operand 3 states and 154 transitions. [2024-11-10 10:09:31,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 100 transitions, 417 flow [2024-11-10 10:09:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:09:31,314 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 210 flow [2024-11-10 10:09:31,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-11-10 10:09:31,316 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2024-11-10 10:09:31,316 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 210 flow [2024-11-10 10:09:31,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2024-11-10 10:09:31,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:31,317 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:31,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 10:09:31,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1565941093, now seen corresponding path program 1 times [2024-11-10 10:09:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175212585] [2024-11-10 10:09:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 10:09:31,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:31,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175212585] [2024-11-10 10:09:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175212585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:31,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636740126] [2024-11-10 10:09:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:31,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:31,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:31,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:31,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 10:09:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:31,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:09:31,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 10:09:31,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 10:09:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636740126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:31,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 10:09:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943554402] [2024-11-10 10:09:31,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:09:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:09:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:09:31,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 76 [2024-11-10 10:09:31,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 210 flow. Second operand has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 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) [2024-11-10 10:09:31,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:31,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 76 [2024-11-10 10:09:31,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:34,400 INFO L124 PetriNetUnfolderBase]: 18752/32888 cut-off events. [2024-11-10 10:09:34,400 INFO L125 PetriNetUnfolderBase]: For 5679/5679 co-relation queries the response was YES. [2024-11-10 10:09:34,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63460 conditions, 32888 events. 18752/32888 cut-off events. For 5679/5679 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 291364 event pairs, 16018 based on Foata normal form. 2/31152 useless extension candidates. Maximal degree in co-relation 63446. Up to 25300 conditions per place. [2024-11-10 10:09:34,642 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 39 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-11-10 10:09:34,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 314 flow [2024-11-10 10:09:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:09:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:09:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2024-11-10 10:09:34,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2024-11-10 10:09:34,644 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 210 flow. Second operand 8 states and 284 transitions. [2024-11-10 10:09:34,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 314 flow [2024-11-10 10:09:34,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:09:34,688 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 242 flow [2024-11-10 10:09:34,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2024-11-10 10:09:34,689 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 21 predicate places. [2024-11-10 10:09:34,689 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 242 flow [2024-11-10 10:09:34,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 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) [2024-11-10 10:09:34,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:34,690 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:34,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 10:09:34,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:34,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:09:34,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:34,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2036628173, now seen corresponding path program 2 times [2024-11-10 10:09:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:34,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212206490] [2024-11-10 10:09:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:34,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:09:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:09:34,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:09:34,936 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:09:34,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:09:34,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:09:34,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:09:34,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:09:34,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:09:34,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 10:09:34,938 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-11-10 10:09:34,939 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:09:34,939 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 10:09:34,981 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:09:34,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 97 transitions, 222 flow [2024-11-10 10:09:34,997 INFO L124 PetriNetUnfolderBase]: 23/120 cut-off events. [2024-11-10 10:09:34,997 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 10:09:34,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 120 events. 23/120 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 101. Up to 10 conditions per place. [2024-11-10 10:09:34,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 97 transitions, 222 flow [2024-11-10 10:09:34,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 97 transitions, 222 flow [2024-11-10 10:09:35,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:09:35,001 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;@46a228b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:09:35,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:09:35,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:09:35,006 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2024-11-10 10:09:35,006 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:09:35,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:35,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:35,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:09:35,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2082883106, now seen corresponding path program 1 times [2024-11-10 10:09:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142344940] [2024-11-10 10:09:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:35,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142344940] [2024-11-10 10:09:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142344940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:35,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450628602] [2024-11-10 10:09:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:35,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:09:35,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:09:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:09:35,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2024-11-10 10:09:35,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 222 flow. Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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) [2024-11-10 10:09:35,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:35,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2024-11-10 10:09:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:45,234 INFO L124 PetriNetUnfolderBase]: 80220/123818 cut-off events. [2024-11-10 10:09:45,234 INFO L125 PetriNetUnfolderBase]: For 9191/9191 co-relation queries the response was YES. [2024-11-10 10:09:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229212 conditions, 123818 events. 80220/123818 cut-off events. For 9191/9191 co-relation queries the response was YES. Maximal size of possible extension queue 3570. Compared 1074526 event pairs, 69712 based on Foata normal form. 33174/151841 useless extension candidates. Maximal degree in co-relation 20563. Up to 101391 conditions per place. [2024-11-10 10:09:46,136 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 45 selfloop transitions, 0 changer transitions 0/85 dead transitions. [2024-11-10 10:09:46,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 288 flow [2024-11-10 10:09:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:09:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:09:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2024-11-10 10:09:46,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7010309278350515 [2024-11-10 10:09:46,138 INFO L175 Difference]: Start difference. First operand has 87 places, 97 transitions, 222 flow. Second operand 2 states and 136 transitions. [2024-11-10 10:09:46,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 288 flow [2024-11-10 10:09:46,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 85 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:46,146 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 192 flow [2024-11-10 10:09:46,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=192, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2024-11-10 10:09:46,147 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2024-11-10 10:09:46,147 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 192 flow [2024-11-10 10:09:46,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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) [2024-11-10 10:09:46,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:46,148 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:46,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 10:09:46,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:09:46,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash -548170621, now seen corresponding path program 1 times [2024-11-10 10:09:46,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:46,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550820645] [2024-11-10 10:09:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550820645] [2024-11-10 10:09:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550820645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:09:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:09:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:09:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376459298] [2024-11-10 10:09:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:09:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:09:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:09:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:09:46,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-10 10:09:46,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-11-10 10:09:46,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:46,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-10 10:09:46,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:09:55,947 INFO L124 PetriNetUnfolderBase]: 80220/123820 cut-off events. [2024-11-10 10:09:55,947 INFO L125 PetriNetUnfolderBase]: For 3913/3913 co-relation queries the response was YES. [2024-11-10 10:09:56,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227678 conditions, 123820 events. 80220/123820 cut-off events. For 3913/3913 co-relation queries the response was YES. Maximal size of possible extension queue 3570. Compared 1074628 event pairs, 69712 based on Foata normal form. 0/118668 useless extension candidates. Maximal degree in co-relation 227671. Up to 101392 conditions per place. [2024-11-10 10:09:56,871 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-11-10 10:09:56,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 288 flow [2024-11-10 10:09:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:09:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:09:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-11-10 10:09:56,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2024-11-10 10:09:56,873 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 192 flow. Second operand 3 states and 165 transitions. [2024-11-10 10:09:56,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 288 flow [2024-11-10 10:09:56,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:09:56,893 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 204 flow [2024-11-10 10:09:56,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2024-11-10 10:09:56,894 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, 2 predicate places. [2024-11-10 10:09:56,894 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 204 flow [2024-11-10 10:09:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2024-11-10 10:09:56,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:09:56,895 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:09:56,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 10:09:56,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:09:56,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:09:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2087516836, now seen corresponding path program 1 times [2024-11-10 10:09:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:09:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071011414] [2024-11-10 10:09:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:09:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:09:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071011414] [2024-11-10 10:09:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071011414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:09:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853742375] [2024-11-10 10:09:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:09:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:09:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:09:56,935 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:09:56,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 10:09:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:09:57,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:09:57,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:09:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:57,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:09:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:09:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853742375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:09:57,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:09:57,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:09:57,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400482325] [2024-11-10 10:09:57,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:09:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:09:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:09:57,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:09:57,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:09:57,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-10 10:09:57,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 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) [2024-11-10 10:09:57,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:09:57,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-10 10:09:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand