./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:24:54,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:24:54,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:24:54,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:24:54,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:24:54,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:24:54,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:24:54,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:24:54,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:24:54,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:24:54,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:24:54,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:24:54,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:24:54,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:24:54,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:24:54,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:24:54,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:24:54,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:24:54,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:24:54,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:24:54,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:24:54,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:24:54,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:24:54,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:24:54,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:24:54,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:24:54,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:24:54,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:24:54,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:24:54,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:24:54,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:24:54,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:24:54,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:24:54,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:24:54,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:24:54,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:24:54,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:24:54,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:24:54,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:24:54,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:24:54,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:24:54,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:24:54,771 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-clean/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-clean/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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2024-10-11 14:24:55,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:24:55,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:24:55,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:24:55,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:24:55,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:24:55,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2024-10-11 14:24:56,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:24:56,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:24:56,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2024-10-11 14:24:56,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/819d70fcf/8596ad7f9b0f4fb6aa2236e0d4d3d8f6/FLAG1f5a1a868 [2024-10-11 14:24:56,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/819d70fcf/8596ad7f9b0f4fb6aa2236e0d4d3d8f6 [2024-10-11 14:24:56,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:24:56,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:24:56,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:24:56,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:24:56,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:24:56,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:56" (1/1) ... [2024-10-11 14:24:56,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:56, skipping insertion in model container [2024-10-11 14:24:56,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:56" (1/1) ... [2024-10-11 14:24:56,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:24:57,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-10-11 14:24:57,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:24:57,048 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:24:57,068 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-10-11 14:24:57,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:24:57,087 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:24:57,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57 WrapperNode [2024-10-11 14:24:57,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:24:57,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:24:57,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:24:57,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:24:57,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,129 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-10-11 14:24:57,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:24:57,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:24:57,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:24:57,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:24:57,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,175 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 14:24:57,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:24:57,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:24:57,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:24:57,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:24:57,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (1/1) ... [2024-10-11 14:24:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:24:57,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:24:57,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:24:57,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:24:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:24:57,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:24:57,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:24:57,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:24:57,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:24:57,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:24:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:24:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 14:24:57,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 14:24:57,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:24:57,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:24:57,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:24:57,313 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:24:57,420 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:24:57,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:24:57,676 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:24:57,676 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:24:57,833 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:24:57,833 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 14:24:57,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:57 BoogieIcfgContainer [2024-10-11 14:24:57,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:24:57,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:24:57,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:24:57,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:24:57,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:24:56" (1/3) ... [2024-10-11 14:24:57,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb5d924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:57, skipping insertion in model container [2024-10-11 14:24:57,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:57" (2/3) ... [2024-10-11 14:24:57,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb5d924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:57, skipping insertion in model container [2024-10-11 14:24:57,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:57" (3/3) ... [2024-10-11 14:24:57,844 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-10-11 14:24:57,863 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:24:57,863 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:24:57,863 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:24:57,924 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 14:24:57,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-10-11 14:24:58,008 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-10-11 14:24:58,008 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:24:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-10-11 14:24:58,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-10-11 14:24:58,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2024-10-11 14:24:58,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:24:58,036 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;@7b9299aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:24:58,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:24:58,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:24:58,057 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-11 14:24:58,058 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 14:24:58,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:24:58,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:24:58,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:24:58,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:24:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash -739026557, now seen corresponding path program 1 times [2024-10-11 14:24:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:24:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170444026] [2024-10-11 14:24:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:24:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:24:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:24:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:24:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:24:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170444026] [2024-10-11 14:24:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170444026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:24:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:24:58,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:24:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972222149] [2024-10-11 14:24:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:24:58,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:24:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:24:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:24:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:24:58,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:24:58,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 14:24:58,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:24:58,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:24:58,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:24:59,146 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2024-10-11 14:24:59,146 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-10-11 14:24:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5585 event pairs, 123 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2024-10-11 14:24:59,169 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2024-10-11 14:24:59,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2024-10-11 14:24:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:24:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:24:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-10-11 14:24:59,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-11 14:24:59,186 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2024-10-11 14:24:59,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2024-10-11 14:24:59,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 14:24:59,197 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2024-10-11 14:24:59,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2024-10-11 14:24:59,205 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-10-11 14:24:59,207 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2024-10-11 14:24:59,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 14:24:59,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:24:59,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:24:59,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:24:59,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:24:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:24:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 738834492, now seen corresponding path program 1 times [2024-10-11 14:24:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:24:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898427766] [2024-10-11 14:24:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:24:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:24:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:24:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:24:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:24:59,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898427766] [2024-10-11 14:24:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898427766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:24:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:24:59,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:24:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070558884] [2024-10-11 14:24:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:24:59,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:24:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:24:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:24:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:24:59,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:24:59,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:24:59,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:24:59,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:24:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:24:59,698 INFO L124 PetriNetUnfolderBase]: 1593/2038 cut-off events. [2024-10-11 14:24:59,698 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2024-10-11 14:24:59,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2038 events. 1593/2038 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7034 event pairs, 113 based on Foata normal form. 34/2060 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2024-10-11 14:24:59,714 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-10-11 14:24:59,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 391 flow [2024-10-11 14:24:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:24:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:24:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-10-11 14:24:59,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-11 14:24:59,717 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 115 transitions. [2024-10-11 14:24:59,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 391 flow [2024-10-11 14:24:59,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:24:59,724 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2024-10-11 14:24:59,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2024-10-11 14:24:59,725 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2024-10-11 14:24:59,725 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2024-10-11 14:24:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:24:59,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:24:59,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:24:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:24:59,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:24:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:24:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 443074054, now seen corresponding path program 1 times [2024-10-11 14:24:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:24:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078897383] [2024-10-11 14:24:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:24:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:24:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:24:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:24:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:24:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078897383] [2024-10-11 14:24:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078897383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:24:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:24:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:24:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775318124] [2024-10-11 14:24:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:24:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:24:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:24:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:24:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:24:59,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:24:59,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:24:59,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:24:59,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:24:59,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:00,208 INFO L124 PetriNetUnfolderBase]: 1921/2549 cut-off events. [2024-10-11 14:25:00,209 INFO L125 PetriNetUnfolderBase]: For 3334/3334 co-relation queries the response was YES. [2024-10-11 14:25:00,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 2549 events. 1921/2549 cut-off events. For 3334/3334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10112 event pairs, 288 based on Foata normal form. 64/2541 useless extension candidates. Maximal degree in co-relation 3126. Up to 1063 conditions per place. [2024-10-11 14:25:00,230 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-10-11 14:25:00,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2024-10-11 14:25:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-10-11 14:25:00,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-11 14:25:00,233 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 108 transitions. [2024-10-11 14:25:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2024-10-11 14:25:00,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:25:00,238 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2024-10-11 14:25:00,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-10-11 14:25:00,239 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-10-11 14:25:00,239 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2024-10-11 14:25:00,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:00,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:00,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:25:00,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash -936143522, now seen corresponding path program 2 times [2024-10-11 14:25:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916483679] [2024-10-11 14:25:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916483679] [2024-10-11 14:25:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916483679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377269551] [2024-10-11 14:25:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:00,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:00,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:00,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:00,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:00,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:00,664 INFO L124 PetriNetUnfolderBase]: 1835/2445 cut-off events. [2024-10-11 14:25:00,665 INFO L125 PetriNetUnfolderBase]: For 4078/4078 co-relation queries the response was YES. [2024-10-11 14:25:00,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9087 conditions, 2445 events. 1835/2445 cut-off events. For 4078/4078 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9926 event pairs, 348 based on Foata normal form. 90/2505 useless extension candidates. Maximal degree in co-relation 4692. Up to 1412 conditions per place. [2024-10-11 14:25:00,688 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 83 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2024-10-11 14:25:00,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 649 flow [2024-10-11 14:25:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-10-11 14:25:00,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-10-11 14:25:00,692 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 114 transitions. [2024-10-11 14:25:00,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 649 flow [2024-10-11 14:25:00,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:25:00,705 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 264 flow [2024-10-11 14:25:00,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-10-11 14:25:00,707 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-10-11 14:25:00,707 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 264 flow [2024-10-11 14:25:00,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:00,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:00,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:00,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:25:00,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1180704031, now seen corresponding path program 1 times [2024-10-11 14:25:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641617629] [2024-10-11 14:25:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641617629] [2024-10-11 14:25:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641617629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378570437] [2024-10-11 14:25:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:00,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:00,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:00,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:00,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:00,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:00,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:01,125 INFO L124 PetriNetUnfolderBase]: 1783/2380 cut-off events. [2024-10-11 14:25:01,126 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2024-10-11 14:25:01,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 2380 events. 1783/2380 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9700 event pairs, 131 based on Foata normal form. 52/2423 useless extension candidates. Maximal degree in co-relation 5285. Up to 1057 conditions per place. [2024-10-11 14:25:01,148 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 84 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2024-10-11 14:25:01,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 673 flow [2024-10-11 14:25:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-10-11 14:25:01,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-10-11 14:25:01,150 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 264 flow. Second operand 5 states and 113 transitions. [2024-10-11 14:25:01,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 673 flow [2024-10-11 14:25:01,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 664 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:01,163 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 269 flow [2024-10-11 14:25:01,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-10-11 14:25:01,164 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2024-10-11 14:25:01,164 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 269 flow [2024-10-11 14:25:01,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:01,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:01,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:25:01,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1435152238, now seen corresponding path program 2 times [2024-10-11 14:25:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704671359] [2024-10-11 14:25:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704671359] [2024-10-11 14:25:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704671359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926792682] [2024-10-11 14:25:01,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:01,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:01,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:01,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:01,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:01,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:01,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:01,571 INFO L124 PetriNetUnfolderBase]: 1610/2155 cut-off events. [2024-10-11 14:25:01,571 INFO L125 PetriNetUnfolderBase]: For 6944/6944 co-relation queries the response was YES. [2024-10-11 14:25:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 2155 events. 1610/2155 cut-off events. For 6944/6944 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8179 event pairs, 91 based on Foata normal form. 31/2140 useless extension candidates. Maximal degree in co-relation 5267. Up to 897 conditions per place. [2024-10-11 14:25:01,594 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2024-10-11 14:25:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 889 flow [2024-10-11 14:25:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-10-11 14:25:01,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-10-11 14:25:01,596 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 269 flow. Second operand 5 states and 107 transitions. [2024-10-11 14:25:01,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 889 flow [2024-10-11 14:25:01,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 864 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:01,605 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 321 flow [2024-10-11 14:25:01,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-10-11 14:25:01,608 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-10-11 14:25:01,609 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 321 flow [2024-10-11 14:25:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:01,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:01,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:25:01,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1624832805, now seen corresponding path program 1 times [2024-10-11 14:25:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674294217] [2024-10-11 14:25:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674294217] [2024-10-11 14:25:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674294217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531212041] [2024-10-11 14:25:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:01,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:01,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:01,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:01,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:01,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:01,993 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2024-10-11 14:25:01,993 INFO L125 PetriNetUnfolderBase]: For 7108/7108 co-relation queries the response was YES. [2024-10-11 14:25:01,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 2122 events. 1577/2122 cut-off events. For 7108/7108 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8146 event pairs, 71 based on Foata normal form. 33/2109 useless extension candidates. Maximal degree in co-relation 6031. Up to 983 conditions per place. [2024-10-11 14:25:02,016 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2024-10-11 14:25:02,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 873 flow [2024-10-11 14:25:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-10-11 14:25:02,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-10-11 14:25:02,018 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 321 flow. Second operand 5 states and 105 transitions. [2024-10-11 14:25:02,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 873 flow [2024-10-11 14:25:02,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 862 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:02,028 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 324 flow [2024-10-11 14:25:02,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-10-11 14:25:02,031 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2024-10-11 14:25:02,031 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 324 flow [2024-10-11 14:25:02,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:02,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:02,031 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:02,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:25:02,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:02,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1713705335, now seen corresponding path program 2 times [2024-10-11 14:25:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:02,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438623885] [2024-10-11 14:25:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438623885] [2024-10-11 14:25:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438623885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366422583] [2024-10-11 14:25:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:02,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:02,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:02,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:02,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:02,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:02,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:02,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:02,399 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2024-10-11 14:25:02,399 INFO L125 PetriNetUnfolderBase]: For 7421/7421 co-relation queries the response was YES. [2024-10-11 14:25:02,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2072 events. 1515/2072 cut-off events. For 7421/7421 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8404 event pairs, 258 based on Foata normal form. 62/2076 useless extension candidates. Maximal degree in co-relation 6059. Up to 1124 conditions per place. [2024-10-11 14:25:02,418 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-10-11 14:25:02,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 893 flow [2024-10-11 14:25:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-10-11 14:25:02,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-10-11 14:25:02,420 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 324 flow. Second operand 5 states and 103 transitions. [2024-10-11 14:25:02,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 893 flow [2024-10-11 14:25:02,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 880 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-11 14:25:02,430 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 364 flow [2024-10-11 14:25:02,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-10-11 14:25:02,432 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2024-10-11 14:25:02,432 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 364 flow [2024-10-11 14:25:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:02,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:02,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:02,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:25:02,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:02,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 27765697, now seen corresponding path program 2 times [2024-10-11 14:25:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:02,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959354239] [2024-10-11 14:25:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959354239] [2024-10-11 14:25:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959354239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:25:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:25:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:25:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497431447] [2024-10-11 14:25:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:25:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:25:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:25:02,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:25:02,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:25:02,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:25:02,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:02,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:25:02,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:25:02,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:25:02,786 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2024-10-11 14:25:02,786 INFO L125 PetriNetUnfolderBase]: For 7054/7054 co-relation queries the response was YES. [2024-10-11 14:25:02,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 1987 events. 1447/1987 cut-off events. For 7054/7054 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8130 event pairs, 375 based on Foata normal form. 68/2029 useless extension candidates. Maximal degree in co-relation 8664. Up to 1150 conditions per place. [2024-10-11 14:25:02,807 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2024-10-11 14:25:02,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1094 flow [2024-10-11 14:25:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:25:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:25:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-10-11 14:25:02,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-10-11 14:25:02,809 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 364 flow. Second operand 5 states and 111 transitions. [2024-10-11 14:25:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1094 flow [2024-10-11 14:25:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-10-11 14:25:02,824 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2024-10-11 14:25:02,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-10-11 14:25:02,825 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-10-11 14:25:02,825 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2024-10-11 14:25:02,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 14:25:02,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:25:02,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:25:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:25:02,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:25:02,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:25:02,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1581203672, now seen corresponding path program 1 times [2024-10-11 14:25:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:25:02,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821367335] [2024-10-11 14:25:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:25:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:25:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:25:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821367335] [2024-10-11 14:25:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821367335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:25:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161781501] [2024-10-11 14:25:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:25:03,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:25:03,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:25:03,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:25:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:25:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:25:04,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:25:04,362 INFO L278 TraceCheckSpWp]: Computing forward predicates...