./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-zero.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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:24:52,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:24:52,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:24:52,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:24:52,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:24:52,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:24:52,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:24:52,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:24:52,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:24:52,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:24:52,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:24:52,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:24:52,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:24:52,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:24:52,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:24:52,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:24:52,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:24:52,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:24:52,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:24:52,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:24:52,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:24:52,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:24:52,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:24:52,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:24:52,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:24:52,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:24:52,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:24:52,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:24:52,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:24:52,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:24:52,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:24:52,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:24:52,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:24:52,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:24:52,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:24:52,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:24:52,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:24:52,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:24:52,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:24:52,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:24:52,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:24:52,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:24:52,763 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2024-11-09 02:24:53,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:24:53,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:24:53,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:24:53,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:24:53,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:24:53,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2024-11-09 02:24:54,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:24:54,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:24:54,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2024-11-09 02:24:54,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b99b1e8e/d7769f6af9f0458bada149230a546595/FLAG42f6ba46f [2024-11-09 02:24:55,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b99b1e8e/d7769f6af9f0458bada149230a546595 [2024-11-09 02:24:55,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:24:55,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:24:55,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:24:55,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:24:55,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:24:55,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635d29d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55, skipping insertion in model container [2024-11-09 02:24:55,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:24:55,501 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-zero.i[30843,30856] [2024-11-09 02:24:55,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:24:55,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:24:55,591 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-zero.i[30843,30856] [2024-11-09 02:24:55,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:24:55,631 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:24:55,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55 WrapperNode [2024-11-09 02:24:55,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:24:55,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:24:55,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:24:55,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:24:55,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,693 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2024-11-09 02:24:55,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:24:55,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:24:55,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:24:55,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:24:55,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,725 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 02:24:55,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:24:55,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:24:55,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:24:55,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:24:55,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (1/1) ... [2024-11-09 02:24:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:24:55,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:55,793 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-09 02:24:55,795 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-09 02:24:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:24:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:24:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 02:24:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 02:24:55,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 02:24:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:24:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:24:55,843 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:24:55,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:24:55,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:24:56,157 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:24:56,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:24:56,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:24:56,300 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:24:56,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:24:56 BoogieIcfgContainer [2024-11-09 02:24:56,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:24:56,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:24:56,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:24:56,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:24:56,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:24:55" (1/3) ... [2024-11-09 02:24:56,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f536e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:24:56, skipping insertion in model container [2024-11-09 02:24:56,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:24:55" (2/3) ... [2024-11-09 02:24:56,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f536e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:24:56, skipping insertion in model container [2024-11-09 02:24:56,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:24:56" (3/3) ... [2024-11-09 02:24:56,313 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2024-11-09 02:24:56,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:24:56,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:24:56,332 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:24:56,384 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:24:56,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 20 transitions, 44 flow [2024-11-09 02:24:56,450 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-09 02:24:56,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:24:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-11-09 02:24:56,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 20 transitions, 44 flow [2024-11-09 02:24:56,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2024-11-09 02:24:56,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:24:56,473 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;@42d9de61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:24:56,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:24:56,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:24:56,479 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2024-11-09 02:24:56,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:24:56,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:56,481 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-09 02:24:56,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:24:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1232390792, now seen corresponding path program 1 times [2024-11-09 02:24:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601775316] [2024-11-09 02:24:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:56,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:24:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:56,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:24:56,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:24:56,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:24:56,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:24:56,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-09 02:24:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:24:56,709 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 02:24:56,719 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:24:56,719 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 02:24:56,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:24:56,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 80 flow [2024-11-09 02:24:56,782 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2024-11-09 02:24:56,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:24:56,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 6/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2024-11-09 02:24:56,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 35 transitions, 80 flow [2024-11-09 02:24:56,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 35 transitions, 80 flow [2024-11-09 02:24:56,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:24:56,792 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;@42d9de61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:24:56,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 02:24:56,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:24:56,802 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-11-09 02:24:56,803 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:24:56,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:56,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:56,804 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-09 02:24:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1797425909, now seen corresponding path program 1 times [2024-11-09 02:24:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470681257] [2024-11-09 02:24:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:57,073 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-09 02:24:57,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:57,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470681257] [2024-11-09 02:24:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470681257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:24:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688081252] [2024-11-09 02:24:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:24:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:24:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:24:57,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-11-09 02:24:57,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 02:24:57,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:57,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-11-09 02:24:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:57,508 INFO L124 PetriNetUnfolderBase]: 602/1210 cut-off events. [2024-11-09 02:24:57,509 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-09 02:24:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 1210 events. 602/1210 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6735 event pairs, 254 based on Foata normal form. 90/1135 useless extension candidates. Maximal degree in co-relation 1103. Up to 494 conditions per place. [2024-11-09 02:24:57,528 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 36 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-11-09 02:24:57,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 187 flow [2024-11-09 02:24:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:24:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:24:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-09 02:24:57,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-09 02:24:57,544 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 80 flow. Second operand 3 states and 75 transitions. [2024-11-09 02:24:57,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 187 flow [2024-11-09 02:24:57,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 187 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 02:24:57,552 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 88 flow [2024-11-09 02:24:57,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2024-11-09 02:24:57,562 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2024-11-09 02:24:57,563 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 88 flow [2024-11-09 02:24:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 02:24:57,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:57,564 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-11-09 02:24:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:24:57,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-09 02:24:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1462068220, now seen corresponding path program 1 times [2024-11-09 02:24:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909122760] [2024-11-09 02:24:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:57,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:24:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:57,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:24:57,600 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:24:57,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 02:24:57,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-09 02:24:57,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-09 02:24:57,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-09 02:24:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:24:57,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 02:24:57,603 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:24:57,603 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 02:24:57,638 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:24:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 118 flow [2024-11-09 02:24:57,650 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2024-11-09 02:24:57,651 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 02:24:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 9/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2024-11-09 02:24:57,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 50 transitions, 118 flow [2024-11-09 02:24:57,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 118 flow [2024-11-09 02:24:57,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:24:57,656 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;@42d9de61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:24:57,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 02:24:57,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:24:57,661 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-11-09 02:24:57,661 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:24:57,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:57,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:57,662 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-09 02:24:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1120187275, now seen corresponding path program 1 times [2024-11-09 02:24:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240405163] [2024-11-09 02:24:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:57,761 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-09 02:24:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240405163] [2024-11-09 02:24:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240405163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:24:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026571008] [2024-11-09 02:24:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:57,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:24:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:24:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:24:57,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-09 02:24:57,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-09 02:24:57,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:57,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-09 02:24:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:59,158 INFO L124 PetriNetUnfolderBase]: 7680/12585 cut-off events. [2024-11-09 02:24:59,158 INFO L125 PetriNetUnfolderBase]: For 734/734 co-relation queries the response was YES. [2024-11-09 02:24:59,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23435 conditions, 12585 events. 7680/12585 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 87108 event pairs, 3366 based on Foata normal form. 1386/12260 useless extension candidates. Maximal degree in co-relation 6901. Up to 5478 conditions per place. [2024-11-09 02:24:59,258 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 54 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-09 02:24:59,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 284 flow [2024-11-09 02:24:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:24:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:24:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-09 02:24:59,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-09 02:24:59,263 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 118 flow. Second operand 3 states and 110 transitions. [2024-11-09 02:24:59,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 284 flow [2024-11-09 02:24:59,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 280 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-09 02:24:59,269 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 122 flow [2024-11-09 02:24:59,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-11-09 02:24:59,270 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-11-09 02:24:59,271 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 122 flow [2024-11-09 02:24:59,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-09 02:24:59,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:59,271 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:24:59,272 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-09 02:24:59,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -999094689, now seen corresponding path program 1 times [2024-11-09 02:24:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335081606] [2024-11-09 02:24:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:24:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335081606] [2024-11-09 02:24:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335081606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:24:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458830720] [2024-11-09 02:24:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:24:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:24:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:24:59,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-09 02:24:59,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 02:24:59,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:59,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-09 02:24:59,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:25:01,294 INFO L124 PetriNetUnfolderBase]: 12770/20785 cut-off events. [2024-11-09 02:25:01,294 INFO L125 PetriNetUnfolderBase]: For 3475/3475 co-relation queries the response was YES. [2024-11-09 02:25:01,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40643 conditions, 20785 events. 12770/20785 cut-off events. For 3475/3475 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 152096 event pairs, 5594 based on Foata normal form. 0/18576 useless extension candidates. Maximal degree in co-relation 20002. Up to 9101 conditions per place. [2024-11-09 02:25:01,466 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 57 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-09 02:25:01,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 309 flow [2024-11-09 02:25:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:25:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:25:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-09 02:25:01,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2024-11-09 02:25:01,471 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 122 flow. Second operand 3 states and 101 transitions. [2024-11-09 02:25:01,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 309 flow [2024-11-09 02:25:01,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:25:01,480 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 132 flow [2024-11-09 02:25:01,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-11-09 02:25:01,482 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-11-09 02:25:01,483 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 132 flow [2024-11-09 02:25:01,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-09 02:25:01,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:25:01,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:25:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:25:01,484 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-09 02:25:01,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:25:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash -322216761, now seen corresponding path program 1 times [2024-11-09 02:25:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:25:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816133650] [2024-11-09 02:25:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:25:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:25:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:25:01,537 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-09 02:25:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:25:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816133650] [2024-11-09 02:25:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816133650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:25:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:25:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:25:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995844423] [2024-11-09 02:25:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:25:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:25:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:25:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:25:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:25:01,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-09 02:25:01,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 02:25:01,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:25:01,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-09 02:25:01,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:25:03,022 INFO L124 PetriNetUnfolderBase]: 9641/15783 cut-off events. [2024-11-09 02:25:03,023 INFO L125 PetriNetUnfolderBase]: For 3297/3297 co-relation queries the response was YES. [2024-11-09 02:25:03,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31838 conditions, 15783 events. 9641/15783 cut-off events. For 3297/3297 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 110819 event pairs, 6423 based on Foata normal form. 354/14811 useless extension candidates. Maximal degree in co-relation 22643. Up to 10356 conditions per place. [2024-11-09 02:25:03,164 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 54 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-09 02:25:03,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 308 flow [2024-11-09 02:25:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:25:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:25:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-09 02:25:03,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2024-11-09 02:25:03,167 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 132 flow. Second operand 3 states and 101 transitions. [2024-11-09 02:25:03,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 308 flow [2024-11-09 02:25:03,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:25:03,198 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 136 flow [2024-11-09 02:25:03,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=136, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-11-09 02:25:03,199 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-11-09 02:25:03,199 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 136 flow [2024-11-09 02:25:03,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 02:25:03,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:25:03,200 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-11-09 02:25:03,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:25:03,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-09 02:25:03,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:25:03,200 INFO L85 PathProgramCache]: Analyzing trace with hash 816336055, now seen corresponding path program 1 times [2024-11-09 02:25:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:25:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487838932] [2024-11-09 02:25:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:25:03,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:25:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:25:03,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:25:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:25:03,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:25:03,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:25:03,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 02:25:03,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-09 02:25:03,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-09 02:25:03,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-09 02:25:03,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-09 02:25:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:25:03,227 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 02:25:03,227 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:25:03,227 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 02:25:03,271 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:25:03,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 158 flow [2024-11-09 02:25:03,284 INFO L124 PetriNetUnfolderBase]: 12/76 cut-off events. [2024-11-09 02:25:03,285 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 02:25:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 12/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2024-11-09 02:25:03,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 65 transitions, 158 flow [2024-11-09 02:25:03,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 65 transitions, 158 flow [2024-11-09 02:25:03,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:25:03,289 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;@42d9de61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:25:03,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 02:25:03,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:25:03,292 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-11-09 02:25:03,292 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:25:03,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:25:03,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:25:03,295 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-09 02:25:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:25:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 614669306, now seen corresponding path program 1 times [2024-11-09 02:25:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:25:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736742158] [2024-11-09 02:25:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:25:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:25:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:25:03,368 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-09 02:25:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:25:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736742158] [2024-11-09 02:25:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736742158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:25:03,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:25:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:25:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587680773] [2024-11-09 02:25:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:25:03,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:25:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:25:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:25:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:25:03,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2024-11-09 02:25:03,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 02:25:03,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:25:03,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2024-11-09 02:25:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:25:12,179 INFO L124 PetriNetUnfolderBase]: 84272/123549 cut-off events. [2024-11-09 02:25:12,179 INFO L125 PetriNetUnfolderBase]: For 10202/10202 co-relation queries the response was YES. [2024-11-09 02:25:12,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234112 conditions, 123549 events. 84272/123549 cut-off events. For 10202/10202 co-relation queries the response was YES. Maximal size of possible extension queue 4210. Compared 961142 event pairs, 37670 based on Foata normal form. 16753/123736 useless extension candidates. Maximal degree in co-relation 23402. Up to 56102 conditions per place. [2024-11-09 02:25:13,201 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 72 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-11-09 02:25:13,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 385 flow [2024-11-09 02:25:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:25:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:25:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-11-09 02:25:13,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-11-09 02:25:13,206 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 158 flow. Second operand 3 states and 145 transitions. [2024-11-09 02:25:13,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 385 flow [2024-11-09 02:25:13,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 94 transitions, 373 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-09 02:25:13,215 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 156 flow [2024-11-09 02:25:13,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-11-09 02:25:13,216 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-09 02:25:13,216 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 156 flow [2024-11-09 02:25:13,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 02:25:13,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:25:13,218 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:25:13,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:25:13,218 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-09 02:25:13,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:25:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1624518591, now seen corresponding path program 1 times [2024-11-09 02:25:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:25:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151351552] [2024-11-09 02:25:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:25:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:25:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:25:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:25:13,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:25:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151351552] [2024-11-09 02:25:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151351552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:25:13,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:25:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:25:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473221111] [2024-11-09 02:25:13,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:25:13,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:25:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:25:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:25:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:25:13,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2024-11-09 02:25:13,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 02:25:13,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:25:13,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2024-11-09 02:25:13,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:25:27,127 INFO L124 PetriNetUnfolderBase]: 139728/203604 cut-off events. [2024-11-09 02:25:27,128 INFO L125 PetriNetUnfolderBase]: For 29488/29488 co-relation queries the response was YES. [2024-11-09 02:25:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400263 conditions, 203604 events. 139728/203604 cut-off events. For 29488/29488 co-relation queries the response was YES. Maximal size of possible extension queue 6576. Compared 1648239 event pairs, 62178 based on Foata normal form. 0/181297 useless extension candidates. Maximal degree in co-relation 200395. Up to 92709 conditions per place. [2024-11-09 02:25:28,606 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 75 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-11-09 02:25:28,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 402 flow [2024-11-09 02:25:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:25:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:25:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-11-09 02:25:28,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2024-11-09 02:25:28,608 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 156 flow. Second operand 3 states and 134 transitions. [2024-11-09 02:25:28,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 402 flow [2024-11-09 02:25:28,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:25:28,641 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 166 flow [2024-11-09 02:25:28,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-11-09 02:25:28,642 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-09 02:25:28,642 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 166 flow [2024-11-09 02:25:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-09 02:25:28,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:25:28,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:25:28,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:25:28,643 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-09 02:25:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:25:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1870074230, now seen corresponding path program 1 times [2024-11-09 02:25:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:25:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742549058] [2024-11-09 02:25:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:25:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:25:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:25:28,675 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-09 02:25:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:25:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742549058] [2024-11-09 02:25:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742549058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:25:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:25:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:25:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125105338] [2024-11-09 02:25:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:25:28,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:25:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:25:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:25:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:25:28,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2024-11-09 02:25:28,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 166 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-09 02:25:28,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:25:28,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2024-11-09 02:25:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:25:38,667 INFO L124 PetriNetUnfolderBase]: 105993/152467 cut-off events. [2024-11-09 02:25:38,668 INFO L125 PetriNetUnfolderBase]: For 29165/29165 co-relation queries the response was YES.