./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/popl20-counter-determinism.wvr.c -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 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:05:36,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:05:36,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:05:36,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:05:36,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:05:36,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:05:36,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:05:36,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:05:36,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:05:36,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:05:36,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:05:36,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:05:36,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:05:36,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:05:36,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:05:36,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:36,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:05:36,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-03-14 01:05:36,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:05:36,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:05:36,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:05:36,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:05:36,937 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:05:36,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-14 01:05:38,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e7adec/183b49ec24fa49b6b4075117fb4b0062/FLAG17cbe79ef [2025-03-14 01:05:38,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:05:38,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-14 01:05:38,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e7adec/183b49ec24fa49b6b4075117fb4b0062/FLAG17cbe79ef [2025-03-14 01:05:38,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e7adec/183b49ec24fa49b6b4075117fb4b0062 [2025-03-14 01:05:38,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:05:38,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:05:38,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:38,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:05:38,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:05:38,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38, skipping insertion in model container [2025-03-14 01:05:38,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:05:38,776 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/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-03-14 01:05:38,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:38,785 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:05:38,802 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/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-03-14 01:05:38,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:38,816 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:05:38,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38 WrapperNode [2025-03-14 01:05:38,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:38,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:38,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:05:38,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:05:38,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,841 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2025-03-14 01:05:38,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:38,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:05:38,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:05:38,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:05:38,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,859 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]. [2025-03-14 01:05:38,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:05:38,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:05:38,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:05:38,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:05:38,874 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (1/1) ... [2025-03-14 01:05:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:38,905 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) [2025-03-14 01:05:38,907 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 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:05:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:05:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:05:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:05:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:05:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:05:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:05:38,927 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:05:38,995 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:05:38,997 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:05:39,179 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:05:39,180 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:05:39,180 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:05:39,281 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:05:39,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:39 BoogieIcfgContainer [2025-03-14 01:05:39,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:05:39,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:05:39,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:05:39,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:05:39,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:05:38" (1/3) ... [2025-03-14 01:05:39,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7072e1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:39, skipping insertion in model container [2025-03-14 01:05:39,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:38" (2/3) ... [2025-03-14 01:05:39,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7072e1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:39, skipping insertion in model container [2025-03-14 01:05:39,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:39" (3/3) ... [2025-03-14 01:05:39,289 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-03-14 01:05:39,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:05:39,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 37 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 01:05:39,302 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:05:39,358 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:05:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 108 flow [2025-03-14 01:05:39,424 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-14 01:05:39,428 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:05:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 4/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-14 01:05:39,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 108 flow [2025-03-14 01:05:39,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 94 flow [2025-03-14 01:05:39,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:05:39,454 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;@3a97fd54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:05:39,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 01:05:39,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:05:39,471 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-14 01:05:39,471 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:05:39,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:39,472 INFO L206 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] [2025-03-14 01:05:39,473 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)] === [2025-03-14 01:05:39,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1384190007, now seen corresponding path program 1 times [2025-03-14 01:05:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317307362] [2025-03-14 01:05:39,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:05:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:05:39,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317307362] [2025-03-14 01:05:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317307362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:05:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104176113] [2025-03-14 01:05:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:39,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:05:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:05:39,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:05:39,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:05:39,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:39,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:39,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:05:39,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:40,249 INFO L124 PetriNetUnfolderBase]: 4206/5681 cut-off events. [2025-03-14 01:05:40,249 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2025-03-14 01:05:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 5681 events. 4206/5681 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23985 event pairs, 1080 based on Foata normal form. 1/5291 useless extension candidates. Maximal degree in co-relation 10306. Up to 4714 conditions per place. [2025-03-14 01:05:40,288 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2025-03-14 01:05:40,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 263 flow [2025-03-14 01:05:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:05:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:05:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-14 01:05:40,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-03-14 01:05:40,305 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 94 flow. Second operand 3 states and 77 transitions. [2025-03-14 01:05:40,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 263 flow [2025-03-14 01:05:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 233 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:05:40,319 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-03-14 01:05:40,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-14 01:05:40,325 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-14 01:05:40,325 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-03-14 01:05:40,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:40,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:40,326 INFO L206 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, 1] [2025-03-14 01:05:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:05:40,327 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)] === [2025-03-14 01:05:40,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -633679508, now seen corresponding path program 1 times [2025-03-14 01:05:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-14 01:05:40,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:40,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:05:40,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-14 01:05:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279464482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:05:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718469209] [2025-03-14 01:05:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:40,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:40,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:40,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:40,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:40,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:40,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:41,371 INFO L124 PetriNetUnfolderBase]: 9567/12493 cut-off events. [2025-03-14 01:05:41,372 INFO L125 PetriNetUnfolderBase]: For 1519/1534 co-relation queries the response was YES. [2025-03-14 01:05:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27903 conditions, 12493 events. 9567/12493 cut-off events. For 1519/1534 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 58550 event pairs, 2918 based on Foata normal form. 0/11821 useless extension candidates. Maximal degree in co-relation 4319. Up to 6920 conditions per place. [2025-03-14 01:05:41,430 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 94 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2025-03-14 01:05:41,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 106 transitions, 491 flow [2025-03-14 01:05:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-14 01:05:41,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-14 01:05:41,433 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 5 states and 128 transitions. [2025-03-14 01:05:41,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 106 transitions, 491 flow [2025-03-14 01:05:41,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 106 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:41,436 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 161 flow [2025-03-14 01:05:41,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-03-14 01:05:41,437 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-03-14 01:05:41,437 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 161 flow [2025-03-14 01:05:41,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:41,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:41,437 INFO L206 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, 1] [2025-03-14 01:05:41,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:05:41,437 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)] === [2025-03-14 01:05:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1402862136, now seen corresponding path program 2 times [2025-03-14 01:05:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585056896] [2025-03-14 01:05:41,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:41,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:41,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:41,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:05:41,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:41,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585056896] [2025-03-14 01:05:41,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585056896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494829266] [2025-03-14 01:05:41,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:41,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:41,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:41,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:05:41,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:41,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:41,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:05:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:41,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:05:41,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:41,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494829266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:41,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-14 01:05:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505531943] [2025-03-14 01:05:41,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:41,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:05:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:41,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:05:41,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:05:41,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:41,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:41,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:41,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:41,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:42,876 INFO L124 PetriNetUnfolderBase]: 13384/17569 cut-off events. [2025-03-14 01:05:42,877 INFO L125 PetriNetUnfolderBase]: For 6402/6402 co-relation queries the response was YES. [2025-03-14 01:05:42,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45668 conditions, 17569 events. 13384/17569 cut-off events. For 6402/6402 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 87618 event pairs, 1029 based on Foata normal form. 332/17895 useless extension candidates. Maximal degree in co-relation 25863. Up to 3569 conditions per place. [2025-03-14 01:05:42,979 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 239 selfloop transitions, 36 changer transitions 0/277 dead transitions. [2025-03-14 01:05:42,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 277 transitions, 1362 flow [2025-03-14 01:05:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:05:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:05:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 346 transitions. [2025-03-14 01:05:42,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6178571428571429 [2025-03-14 01:05:42,983 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 161 flow. Second operand 14 states and 346 transitions. [2025-03-14 01:05:42,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 277 transitions, 1362 flow [2025-03-14 01:05:42,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 277 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:05:42,991 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 411 flow [2025-03-14 01:05:42,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2025-03-14 01:05:42,992 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-03-14 01:05:42,992 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 411 flow [2025-03-14 01:05:42,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:42,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:42,993 INFO L206 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, 1] [2025-03-14 01:05:43,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:05:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:43,194 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)] === [2025-03-14 01:05:43,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1013562230, now seen corresponding path program 1 times [2025-03-14 01:05:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769531017] [2025-03-14 01:05:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:05:43,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:43,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:43,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769531017] [2025-03-14 01:05:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769531017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:43,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:05:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038578938] [2025-03-14 01:05:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:43,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:43,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:43,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:43,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:43,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:43,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:43,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:44,695 INFO L124 PetriNetUnfolderBase]: 21370/28214 cut-off events. [2025-03-14 01:05:44,696 INFO L125 PetriNetUnfolderBase]: For 32385/32385 co-relation queries the response was YES. [2025-03-14 01:05:44,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85224 conditions, 28214 events. 21370/28214 cut-off events. For 32385/32385 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 146053 event pairs, 6342 based on Foata normal form. 0/26830 useless extension candidates. Maximal degree in co-relation 66902. Up to 12488 conditions per place. [2025-03-14 01:05:44,853 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 137 selfloop transitions, 19 changer transitions 2/162 dead transitions. [2025-03-14 01:05:44,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 162 transitions, 1100 flow [2025-03-14 01:05:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-14 01:05:44,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-03-14 01:05:44,854 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 411 flow. Second operand 5 states and 127 transitions. [2025-03-14 01:05:44,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 162 transitions, 1100 flow [2025-03-14 01:05:45,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 1053 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:45,020 INFO L231 Difference]: Finished difference. Result has 70 places, 82 transitions, 500 flow [2025-03-14 01:05:45,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2025-03-14 01:05:45,021 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-14 01:05:45,021 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 82 transitions, 500 flow [2025-03-14 01:05:45,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:45,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:45,021 INFO L206 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, 1] [2025-03-14 01:05:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:05:45,021 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)] === [2025-03-14 01:05:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash -851360294, now seen corresponding path program 3 times [2025-03-14 01:05:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:45,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031014470] [2025-03-14 01:05:45,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:05:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:45,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:45,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:45,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:05:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031014470] [2025-03-14 01:05:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031014470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:05:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186497982] [2025-03-14 01:05:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:45,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:45,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:45,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:45,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:45,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 82 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:45,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:45,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:45,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:46,651 INFO L124 PetriNetUnfolderBase]: 23392/30994 cut-off events. [2025-03-14 01:05:46,651 INFO L125 PetriNetUnfolderBase]: For 55714/57117 co-relation queries the response was YES. [2025-03-14 01:05:46,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101647 conditions, 30994 events. 23392/30994 cut-off events. For 55714/57117 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 165141 event pairs, 7705 based on Foata normal form. 32/31001 useless extension candidates. Maximal degree in co-relation 88909. Up to 17519 conditions per place. [2025-03-14 01:05:46,875 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 138 selfloop transitions, 35 changer transitions 4/179 dead transitions. [2025-03-14 01:05:46,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 179 transitions, 1442 flow [2025-03-14 01:05:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-14 01:05:46,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-14 01:05:46,876 INFO L175 Difference]: Start difference. First operand has 70 places, 82 transitions, 500 flow. Second operand 5 states and 125 transitions. [2025-03-14 01:05:46,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 179 transitions, 1442 flow [2025-03-14 01:05:47,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 1381 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:47,366 INFO L231 Difference]: Finished difference. Result has 76 places, 104 transitions, 747 flow [2025-03-14 01:05:47,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=76, PETRI_TRANSITIONS=104} [2025-03-14 01:05:47,367 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2025-03-14 01:05:47,367 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 104 transitions, 747 flow [2025-03-14 01:05:47,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:47,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:47,368 INFO L206 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, 1] [2025-03-14 01:05:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:05:47,368 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)] === [2025-03-14 01:05:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1283275840, now seen corresponding path program 4 times [2025-03-14 01:05:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515033382] [2025-03-14 01:05:47,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:47,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:47,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-14 01:05:47,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:05:47,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515033382] [2025-03-14 01:05:47,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515033382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629825738] [2025-03-14 01:05:47,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:47,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:47,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:05:47,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:47,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-14 01:05:47,477 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:05:47,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:47,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:05:47,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:47,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629825738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:47,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-14 01:05:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501026457] [2025-03-14 01:05:47,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:05:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:47,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:05:47,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:05:47,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:47,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 104 transitions, 747 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:47,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:47,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:47,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:49,272 INFO L124 PetriNetUnfolderBase]: 25372/33270 cut-off events. [2025-03-14 01:05:49,272 INFO L125 PetriNetUnfolderBase]: For 73270/75160 co-relation queries the response was YES. [2025-03-14 01:05:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117074 conditions, 33270 events. 25372/33270 cut-off events. For 73270/75160 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 173451 event pairs, 5968 based on Foata normal form. 396/33657 useless extension candidates. Maximal degree in co-relation 101207. Up to 12180 conditions per place. [2025-03-14 01:05:49,468 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 223 selfloop transitions, 49 changer transitions 1/275 dead transitions. [2025-03-14 01:05:49,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 275 transitions, 2103 flow [2025-03-14 01:05:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:05:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:05:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2025-03-14 01:05:49,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-14 01:05:49,469 INFO L175 Difference]: Start difference. First operand has 76 places, 104 transitions, 747 flow. Second operand 9 states and 225 transitions. [2025-03-14 01:05:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 275 transitions, 2103 flow [2025-03-14 01:05:49,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 275 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:49,605 INFO L231 Difference]: Finished difference. Result has 88 places, 126 transitions, 1061 flow [2025-03-14 01:05:49,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1061, PETRI_PLACES=88, PETRI_TRANSITIONS=126} [2025-03-14 01:05:49,606 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2025-03-14 01:05:49,606 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 126 transitions, 1061 flow [2025-03-14 01:05:49,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:49,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:49,606 INFO L206 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, 1] [2025-03-14 01:05:49,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:05:49,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-14 01:05:49,807 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)] === [2025-03-14 01:05:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1471030394, now seen corresponding path program 5 times [2025-03-14 01:05:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:49,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751651785] [2025-03-14 01:05:49,807 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:05:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:49,812 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:49,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:49,816 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:05:49,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751651785] [2025-03-14 01:05:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751651785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:49,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:05:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193169110] [2025-03-14 01:05:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:49,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:49,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:49,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:49,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 126 transitions, 1061 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:49,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:49,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:52,195 INFO L124 PetriNetUnfolderBase]: 25476/33519 cut-off events. [2025-03-14 01:05:52,196 INFO L125 PetriNetUnfolderBase]: For 95292/97097 co-relation queries the response was YES. [2025-03-14 01:05:52,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126248 conditions, 33519 events. 25476/33519 cut-off events. For 95292/97097 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 176630 event pairs, 7238 based on Foata normal form. 78/33588 useless extension candidates. Maximal degree in co-relation 121295. Up to 16697 conditions per place. [2025-03-14 01:05:52,369 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 182 selfloop transitions, 22 changer transitions 6/212 dead transitions. [2025-03-14 01:05:52,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 212 transitions, 1926 flow [2025-03-14 01:05:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-14 01:05:52,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-03-14 01:05:52,370 INFO L175 Difference]: Start difference. First operand has 88 places, 126 transitions, 1061 flow. Second operand 5 states and 127 transitions. [2025-03-14 01:05:52,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 212 transitions, 1926 flow [2025-03-14 01:05:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 212 transitions, 1884 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:52,680 INFO L231 Difference]: Finished difference. Result has 93 places, 128 transitions, 1100 flow [2025-03-14 01:05:52,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1100, PETRI_PLACES=93, PETRI_TRANSITIONS=128} [2025-03-14 01:05:52,681 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2025-03-14 01:05:52,682 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 128 transitions, 1100 flow [2025-03-14 01:05:52,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:52,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:52,682 INFO L206 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, 1] [2025-03-14 01:05:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:05:52,683 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)] === [2025-03-14 01:05:52,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 951134518, now seen corresponding path program 2 times [2025-03-14 01:05:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-03-14 01:05:52,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:52,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:05:52,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:52,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:05:52,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-03-14 01:05:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120495139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:05:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105328894] [2025-03-14 01:05:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:05:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:05:52,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:05:52,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 128 transitions, 1100 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:55,049 INFO L124 PetriNetUnfolderBase]: 27858/36866 cut-off events. [2025-03-14 01:05:55,050 INFO L125 PetriNetUnfolderBase]: For 113264/113612 co-relation queries the response was YES. [2025-03-14 01:05:55,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140251 conditions, 36866 events. 27858/36866 cut-off events. For 113264/113612 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 199575 event pairs, 8636 based on Foata normal form. 80/36840 useless extension candidates. Maximal degree in co-relation 135353. Up to 17596 conditions per place. [2025-03-14 01:05:55,375 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 130 selfloop transitions, 38 changer transitions 19/193 dead transitions. [2025-03-14 01:05:55,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 193 transitions, 1757 flow [2025-03-14 01:05:55,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-14 01:05:55,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-03-14 01:05:55,376 INFO L175 Difference]: Start difference. First operand has 93 places, 128 transitions, 1100 flow. Second operand 5 states and 126 transitions. [2025-03-14 01:05:55,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 193 transitions, 1757 flow [2025-03-14 01:05:55,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 193 transitions, 1708 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:56,001 INFO L231 Difference]: Finished difference. Result has 97 places, 128 transitions, 1160 flow [2025-03-14 01:05:56,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1160, PETRI_PLACES=97, PETRI_TRANSITIONS=128} [2025-03-14 01:05:56,001 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-03-14 01:05:56,002 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 128 transitions, 1160 flow [2025-03-14 01:05:56,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:05:56,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:56,002 INFO L206 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, 1] [2025-03-14 01:05:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:05:56,002 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)] === [2025-03-14 01:05:56,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash -309263340, now seen corresponding path program 6 times [2025-03-14 01:05:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579343589] [2025-03-14 01:05:56,003 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:05:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:56,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:56,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:56,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:05:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579343589] [2025-03-14 01:05:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579343589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171561676] [2025-03-14 01:05:56,066 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:05:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:56,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:56,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:05:56,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:05:56,122 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:05:56,122 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:05:56,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:56,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:05:56,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:56,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:56,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171561676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:56,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:56,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-14 01:05:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982934153] [2025-03-14 01:05:56,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:56,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:05:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:56,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:05:56,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:05:56,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:05:56,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 128 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:56,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:05:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:59,109 INFO L124 PetriNetUnfolderBase]: 28146/37076 cut-off events. [2025-03-14 01:05:59,109 INFO L125 PetriNetUnfolderBase]: For 115327/119247 co-relation queries the response was YES. [2025-03-14 01:05:59,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141343 conditions, 37076 events. 28146/37076 cut-off events. For 115327/119247 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 202609 event pairs, 2448 based on Foata normal form. 492/37553 useless extension candidates. Maximal degree in co-relation 136145. Up to 7515 conditions per place. [2025-03-14 01:05:59,379 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 279 selfloop transitions, 88 changer transitions 1/370 dead transitions. [2025-03-14 01:05:59,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 370 transitions, 2837 flow [2025-03-14 01:05:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:05:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:05:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 382 transitions. [2025-03-14 01:05:59,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366666666666667 [2025-03-14 01:05:59,381 INFO L175 Difference]: Start difference. First operand has 97 places, 128 transitions, 1160 flow. Second operand 15 states and 382 transitions. [2025-03-14 01:05:59,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 370 transitions, 2837 flow [2025-03-14 01:06:00,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 370 transitions, 2730 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-14 01:06:00,010 INFO L231 Difference]: Finished difference. Result has 113 places, 140 transitions, 1451 flow [2025-03-14 01:06:00,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1451, PETRI_PLACES=113, PETRI_TRANSITIONS=140} [2025-03-14 01:06:00,011 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2025-03-14 01:06:00,011 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1451 flow [2025-03-14 01:06:00,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:00,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:00,011 INFO L206 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, 1] [2025-03-14 01:06:00,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:06:00,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:00,212 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)] === [2025-03-14 01:06:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash -981566080, now seen corresponding path program 3 times [2025-03-14 01:06:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465462514] [2025-03-14 01:06:00,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:06:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:00,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:06:00,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:06:00,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:06:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465462514] [2025-03-14 01:06:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465462514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:06:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258058880] [2025-03-14 01:06:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:00,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:06:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:00,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:06:00,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:06:00,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-14 01:06:00,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1451 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:00,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:00,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-14 01:06:00,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:04,313 INFO L124 PetriNetUnfolderBase]: 51788/67406 cut-off events. [2025-03-14 01:06:04,313 INFO L125 PetriNetUnfolderBase]: For 263406/263406 co-relation queries the response was YES. [2025-03-14 01:06:04,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264486 conditions, 67406 events. 51788/67406 cut-off events. For 263406/263406 co-relation queries the response was YES. Maximal size of possible extension queue 1831. Compared 362086 event pairs, 20771 based on Foata normal form. 412/67818 useless extension candidates. Maximal degree in co-relation 254762. Up to 42916 conditions per place. [2025-03-14 01:06:04,970 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 272 selfloop transitions, 37 changer transitions 1/311 dead transitions. [2025-03-14 01:06:04,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 311 transitions, 3747 flow [2025-03-14 01:06:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:06:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:06:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-14 01:06:04,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-03-14 01:06:04,971 INFO L175 Difference]: Start difference. First operand has 113 places, 140 transitions, 1451 flow. Second operand 5 states and 123 transitions. [2025-03-14 01:06:04,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 311 transitions, 3747 flow [2025-03-14 01:06:06,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 311 transitions, 3655 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-03-14 01:06:06,433 INFO L231 Difference]: Finished difference. Result has 119 places, 169 transitions, 1958 flow [2025-03-14 01:06:06,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1958, PETRI_PLACES=119, PETRI_TRANSITIONS=169} [2025-03-14 01:06:06,434 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places. [2025-03-14 01:06:06,434 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 169 transitions, 1958 flow [2025-03-14 01:06:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:06,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:06,434 INFO L206 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, 1] [2025-03-14 01:06:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:06:06,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:06:06,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -716682956, now seen corresponding path program 4 times [2025-03-14 01:06:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142906] [2025-03-14 01:06:06,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:06:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:06,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:06:06,441 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-14 01:06:06,441 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:06:06,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:06,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142906] [2025-03-14 01:06:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:06:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052465258] [2025-03-14 01:06:06,476 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:06:06,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:06:06,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:06:06,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:06:06,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:06:06,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-14 01:06:06,531 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:06:06,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:06,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:06:06,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:06:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:06,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:06:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052465258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:06:06,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:06:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-14 01:06:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247067942] [2025-03-14 01:06:06,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:06:06,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:06:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:06:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:06:06,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-14 01:06:06,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 169 transitions, 1958 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:06,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:06,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-14 01:06:06,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:12,246 INFO L124 PetriNetUnfolderBase]: 63376/82952 cut-off events. [2025-03-14 01:06:12,246 INFO L125 PetriNetUnfolderBase]: For 392063/392063 co-relation queries the response was YES. [2025-03-14 01:06:12,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348850 conditions, 82952 events. 63376/82952 cut-off events. For 392063/392063 co-relation queries the response was YES. Maximal size of possible extension queue 2329. Compared 467533 event pairs, 7713 based on Foata normal form. 768/83720 useless extension candidates. Maximal degree in co-relation 329562. Up to 23087 conditions per place. [2025-03-14 01:06:13,140 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 495 selfloop transitions, 134 changer transitions 15/645 dead transitions. [2025-03-14 01:06:13,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 645 transitions, 7949 flow [2025-03-14 01:06:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:06:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:06:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-03-14 01:06:13,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2025-03-14 01:06:13,141 INFO L175 Difference]: Start difference. First operand has 119 places, 169 transitions, 1958 flow. Second operand 11 states and 255 transitions. [2025-03-14 01:06:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 645 transitions, 7949 flow [2025-03-14 01:06:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 645 transitions, 7915 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-03-14 01:06:15,592 INFO L231 Difference]: Finished difference. Result has 135 places, 260 transitions, 3611 flow [2025-03-14 01:06:15,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3611, PETRI_PLACES=135, PETRI_TRANSITIONS=260} [2025-03-14 01:06:15,592 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2025-03-14 01:06:15,592 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 260 transitions, 3611 flow [2025-03-14 01:06:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:06:15,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:06:15,593 INFO L206 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, 1] [2025-03-14 01:06:15,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:06:15,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:06:15,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:06:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:06:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1519592250, now seen corresponding path program 5 times [2025-03-14 01:06:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:06:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-14 01:06:15,794 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:06:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:06:15,798 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:06:15,800 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:06:15,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:06:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:06:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:06:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:06:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-14 01:06:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451999072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:06:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:06:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:06:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354244986] [2025-03-14 01:06:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:06:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:06:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:06:15,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:06:15,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:06:15,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:06:15,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 260 transitions, 3611 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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) [2025-03-14 01:06:15,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:06:15,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:06:15,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand