./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/bench-exp2x3.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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:40:30,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:40:30,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:40:30,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:40:30,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:40:30,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:40:30,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:40:30,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:40:30,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:40:30,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:40:30,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:40:30,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:40:30,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:40:30,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:40:30,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:40:30,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:40:30,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:30,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:40:30,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:40:30,825 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2025-03-13 21:40:31,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:40:31,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:40:31,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:40:31,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:40:31,048 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:40:31,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-03-13 21:40:32,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f413a053a/ef30de74af6c4dc48e3d1c90e1e49ba7/FLAGcb7e25509 [2025-03-13 21:40:32,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:40:32,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-03-13 21:40:32,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f413a053a/ef30de74af6c4dc48e3d1c90e1e49ba7/FLAGcb7e25509 [2025-03-13 21:40:32,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f413a053a/ef30de74af6c4dc48e3d1c90e1e49ba7 [2025-03-13 21:40:32,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:40:32,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:40:32,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:32,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:40:32,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:40:32,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32, skipping insertion in model container [2025-03-13 21:40:32,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:40:32,627 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/bench-exp2x3.wvr.c[2289,2302] [2025-03-13 21:40:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:32,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:40:32,656 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/bench-exp2x3.wvr.c[2289,2302] [2025-03-13 21:40:32,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:32,672 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:40:32,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32 WrapperNode [2025-03-13 21:40:32,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:32,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:32,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:40:32,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:40:32,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,704 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-03-13 21:40:32,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:32,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:40:32,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:40:32,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:40:32,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,728 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-13 21:40:32,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:40:32,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:40:32,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:40:32,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:40:32,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (1/1) ... [2025-03-13 21:40:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:32,770 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-13 21:40:32,772 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-13 21:40:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:40:32,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:40:32,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:40:32,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:40:32,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:40:32,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:40:32,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:40:32,791 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:40:32,852 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:40:32,854 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:40:33,035 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:40:33,035 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:40:33,035 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:40:33,208 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:40:33,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:33 BoogieIcfgContainer [2025-03-13 21:40:33,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:40:33,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:40:33,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:40:33,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:40:33,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:40:32" (1/3) ... [2025-03-13 21:40:33,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbfb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:33, skipping insertion in model container [2025-03-13 21:40:33,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:32" (2/3) ... [2025-03-13 21:40:33,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbfb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:33, skipping insertion in model container [2025-03-13 21:40:33,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:33" (3/3) ... [2025-03-13 21:40:33,215 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-03-13 21:40:33,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:40:33,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:40:33,229 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:40:33,275 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:40:33,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-03-13 21:40:33,326 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:40:33,328 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:40:33,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-13 21:40:33,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-03-13 21:40:33,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-03-13 21:40:33,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:40:33,357 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;@5647c3b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:40:33,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:40:33,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:40:33,372 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-13 21:40:33,373 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:40:33,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:33,373 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-13 21:40:33,373 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-13 21:40:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1247612701, now seen corresponding path program 1 times [2025-03-13 21:40:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244475433] [2025-03-13 21:40:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:33,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:40:33,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:40:33,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:33,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:33,787 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-13 21:40:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244475433] [2025-03-13 21:40:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244475433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:40:33,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003288592] [2025-03-13 21:40:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:33,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:33,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:33,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:33,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:33,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:33,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:33,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:34,081 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-03-13 21:40:34,081 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-13 21:40:34,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5556 event pairs, 123 based on Foata normal form. 1/992 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-03-13 21:40:34,100 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-03-13 21:40:34,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-03-13 21:40:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:40:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:40:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-13 21:40:34,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-13 21:40:34,112 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2025-03-13 21:40:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-03-13 21:40:34,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:40:34,122 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-03-13 21:40:34,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-13 21:40:34,126 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-13 21:40:34,126 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-03-13 21:40:34,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:34,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:34,126 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] [2025-03-13 21:40:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:40:34,126 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-13 21:40:34,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash -696431161, now seen corresponding path program 1 times [2025-03-13 21:40:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97865934] [2025-03-13 21:40:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:34,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:34,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,250 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-13 21:40:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97865934] [2025-03-13 21:40:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97865934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206150098] [2025-03-13 21:40:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:34,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:34,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:34,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:34,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:34,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:34,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:34,516 INFO L124 PetriNetUnfolderBase]: 1587/2032 cut-off events. [2025-03-13 21:40:34,516 INFO L125 PetriNetUnfolderBase]: For 487/487 co-relation queries the response was YES. [2025-03-13 21:40:34,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 2032 events. 1587/2032 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7013 event pairs, 85 based on Foata normal form. 34/2056 useless extension candidates. Maximal degree in co-relation 1261. Up to 839 conditions per place. [2025-03-13 21:40:34,534 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2025-03-13 21:40:34,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 391 flow [2025-03-13 21:40:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-03-13 21:40:34,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-13 21:40:34,536 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 115 transitions. [2025-03-13 21:40:34,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 391 flow [2025-03-13 21:40:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:34,539 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-03-13 21:40:34,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-03-13 21:40:34,539 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-13 21:40:34,539 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-03-13 21:40:34,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:34,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:34,541 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] [2025-03-13 21:40:34,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:40:34,542 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-13 21:40:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash 993171523, now seen corresponding path program 2 times [2025-03-13 21:40:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379487622] [2025-03-13 21:40:34,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:34,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:34,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:34,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:34,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,658 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-13 21:40:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379487622] [2025-03-13 21:40:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379487622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982698922] [2025-03-13 21:40:34,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:34,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:34,662 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-13 21:40:34,663 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-13 21:40:34,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:34,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:34,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:34,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:34,943 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-13 21:40:34,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:35,018 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-13 21:40:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982698922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:35,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077311592] [2025-03-13 21:40:35,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:35,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:35,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:35,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:35,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:35,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-13 21:40:35,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:35,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:35,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:35,296 INFO L124 PetriNetUnfolderBase]: 1502/1957 cut-off events. [2025-03-13 21:40:35,297 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-03-13 21:40:35,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 1957 events. 1502/1957 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7171 event pairs, 291 based on Foata normal form. 61/1982 useless extension candidates. Maximal degree in co-relation 1657. Up to 1066 conditions per place. [2025-03-13 21:40:35,309 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-13 21:40:35,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 80 transitions, 438 flow [2025-03-13 21:40:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-13 21:40:35,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-03-13 21:40:35,312 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 114 transitions. [2025-03-13 21:40:35,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 80 transitions, 438 flow [2025-03-13 21:40:35,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:35,315 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 209 flow [2025-03-13 21:40:35,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-03-13 21:40:35,316 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-03-13 21:40:35,316 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 209 flow [2025-03-13 21:40:35,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-13 21:40:35,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:35,316 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] [2025-03-13 21:40:35,323 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-13 21:40:35,521 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-13 21:40:35,521 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-13 21:40:35,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2013762448, now seen corresponding path program 1 times [2025-03-13 21:40:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-13 21:40:35,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:35,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:35,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:35,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:35,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:35,625 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-13 21:40:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:35,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100754145] [2025-03-13 21:40:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100754145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:35,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079968037] [2025-03-13 21:40:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:35,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:35,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:35,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:35,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:35,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:35,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:35,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:35,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:35,872 INFO L124 PetriNetUnfolderBase]: 1480/1925 cut-off events. [2025-03-13 21:40:35,872 INFO L125 PetriNetUnfolderBase]: For 3004/3004 co-relation queries the response was YES. [2025-03-13 21:40:35,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 1925 events. 1480/1925 cut-off events. For 3004/3004 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6997 event pairs, 94 based on Foata normal form. 46/1961 useless extension candidates. Maximal degree in co-relation 3596. Up to 810 conditions per place. [2025-03-13 21:40:35,882 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 68 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2025-03-13 21:40:35,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 474 flow [2025-03-13 21:40:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-13 21:40:35,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2025-03-13 21:40:35,884 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 209 flow. Second operand 5 states and 113 transitions. [2025-03-13 21:40:35,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 474 flow [2025-03-13 21:40:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 81 transitions, 465 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:35,891 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 214 flow [2025-03-13 21:40:35,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-03-13 21:40:35,891 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-13 21:40:35,892 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 214 flow [2025-03-13 21:40:35,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:35,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:35,892 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] [2025-03-13 21:40:35,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:40:35,892 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-13 21:40:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -531271275, now seen corresponding path program 1 times [2025-03-13 21:40:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505531943] [2025-03-13 21:40:35,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:35,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:35,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:35,970 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-13 21:40:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505531943] [2025-03-13 21:40:35,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505531943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471429272] [2025-03-13 21:40:35,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:35,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:35,973 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-13 21:40:35,974 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-13 21:40:36,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:36,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:36,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:36,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:36,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:36,136 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-13 21:40:36,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:36,177 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-13 21:40:36,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471429272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:36,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:36,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:36,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357397192] [2025-03-13 21:40:36,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:36,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:36,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:36,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:36,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:36,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 21:40:36,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:36,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:36,405 INFO L124 PetriNetUnfolderBase]: 1783/2410 cut-off events. [2025-03-13 21:40:36,405 INFO L125 PetriNetUnfolderBase]: For 6598/6604 co-relation queries the response was YES. [2025-03-13 21:40:36,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 2410 events. 1783/2410 cut-off events. For 6598/6604 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9883 event pairs, 285 based on Foata normal form. 65/2423 useless extension candidates. Maximal degree in co-relation 4719. Up to 1013 conditions per place. [2025-03-13 21:40:36,420 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-03-13 21:40:36,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 104 transitions, 811 flow [2025-03-13 21:40:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-13 21:40:36,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-13 21:40:36,422 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 214 flow. Second operand 5 states and 108 transitions. [2025-03-13 21:40:36,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 104 transitions, 811 flow [2025-03-13 21:40:36,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 104 transitions, 786 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:36,429 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 260 flow [2025-03-13 21:40:36,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-13 21:40:36,430 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-03-13 21:40:36,431 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 260 flow [2025-03-13 21:40:36,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 21:40:36,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:36,431 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] [2025-03-13 21:40:36,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:36,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:36,632 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-13 21:40:36,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1164135569, now seen corresponding path program 2 times [2025-03-13 21:40:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034455894] [2025-03-13 21:40:36,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:36,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:36,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:36,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:36,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,688 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-13 21:40:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034455894] [2025-03-13 21:40:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034455894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072519813] [2025-03-13 21:40:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:36,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:36,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:36,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:36,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:36,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:36,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:36,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:36,888 INFO L124 PetriNetUnfolderBase]: 1610/2155 cut-off events. [2025-03-13 21:40:36,888 INFO L125 PetriNetUnfolderBase]: For 6257/6263 co-relation queries the response was YES. [2025-03-13 21:40:36,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9066 conditions, 2155 events. 1610/2155 cut-off events. For 6257/6263 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8190 event pairs, 91 based on Foata normal form. 32/2159 useless extension candidates. Maximal degree in co-relation 5693. Up to 897 conditions per place. [2025-03-13 21:40:36,904 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2025-03-13 21:40:36,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 864 flow [2025-03-13 21:40:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-13 21:40:36,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-13 21:40:36,905 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 260 flow. Second operand 5 states and 107 transitions. [2025-03-13 21:40:36,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 108 transitions, 864 flow [2025-03-13 21:40:36,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:36,911 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 321 flow [2025-03-13 21:40:36,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-13 21:40:36,911 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-03-13 21:40:36,911 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 321 flow [2025-03-13 21:40:36,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:36,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:36,912 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] [2025-03-13 21:40:36,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:40:36,912 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-13 21:40:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 797692132, now seen corresponding path program 1 times [2025-03-13 21:40:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643878547] [2025-03-13 21:40:36,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:36,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:36,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:36,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,977 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-13 21:40:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643878547] [2025-03-13 21:40:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643878547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186497982] [2025-03-13 21:40:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:36,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:36,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:36,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:36,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:36,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:37,165 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2025-03-13 21:40:37,165 INFO L125 PetriNetUnfolderBase]: For 7111/7117 co-relation queries the response was YES. [2025-03-13 21:40:37,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 2122 events. 1577/2122 cut-off events. For 7111/7117 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8156 event pairs, 71 based on Foata normal form. 34/2128 useless extension candidates. Maximal degree in co-relation 6031. Up to 983 conditions per place. [2025-03-13 21:40:37,181 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2025-03-13 21:40:37,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 873 flow [2025-03-13 21:40:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-13 21:40:37,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-13 21:40:37,184 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 321 flow. Second operand 5 states and 105 transitions. [2025-03-13 21:40:37,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 873 flow [2025-03-13 21:40:37,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 862 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:37,191 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 324 flow [2025-03-13 21:40:37,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-03-13 21:40:37,193 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-03-13 21:40:37,193 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 324 flow [2025-03-13 21:40:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:37,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:37,193 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] [2025-03-13 21:40:37,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:40:37,193 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-13 21:40:37,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1918968894, now seen corresponding path program 2 times [2025-03-13 21:40:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515033382] [2025-03-13 21:40:37,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:37,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:37,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:37,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:37,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:37,258 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-13 21:40:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515033382] [2025-03-13 21:40:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515033382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629825738] [2025-03-13 21:40:37,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:37,262 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-13 21:40:37,263 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-13 21:40:37,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:37,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:37,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:37,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:37,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:37,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:37,448 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-13 21:40:37,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:37,506 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-13 21:40:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629825738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:37,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512930878] [2025-03-13 21:40:37,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:37,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:37,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:37,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:37,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:37,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-13 21:40:37,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:37,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:37,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:37,726 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2025-03-13 21:40:37,726 INFO L125 PetriNetUnfolderBase]: For 7410/7416 co-relation queries the response was YES. [2025-03-13 21:40:37,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2072 events. 1515/2072 cut-off events. For 7410/7416 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8364 event pairs, 258 based on Foata normal form. 63/2095 useless extension candidates. Maximal degree in co-relation 6059. Up to 1124 conditions per place. [2025-03-13 21:40:37,737 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-03-13 21:40:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 893 flow [2025-03-13 21:40:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-13 21:40:37,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-13 21:40:37,738 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 324 flow. Second operand 5 states and 103 transitions. [2025-03-13 21:40:37,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 893 flow [2025-03-13 21:40:37,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 880 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:37,743 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 364 flow [2025-03-13 21:40:37,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-13 21:40:37,744 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2025-03-13 21:40:37,744 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 364 flow [2025-03-13 21:40:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-13 21:40:37,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:37,744 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] [2025-03-13 21:40:37,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:37,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:37,945 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-13 21:40:37,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1522985554, now seen corresponding path program 2 times [2025-03-13 21:40:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166515394] [2025-03-13 21:40:37,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:37,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:37,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:37,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:38,009 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-13 21:40:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166515394] [2025-03-13 21:40:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166515394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952782839] [2025-03-13 21:40:38,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:38,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:38,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:38,013 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-13 21:40:38,013 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-13 21:40:38,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:38,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:38,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:38,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:38,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:38,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:38,134 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-13 21:40:38,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:38,171 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-13 21:40:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952782839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:38,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120495139] [2025-03-13 21:40:38,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:38,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:38,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:38,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:38,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 21:40:38,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:38,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:38,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:38,364 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-03-13 21:40:38,365 INFO L125 PetriNetUnfolderBase]: For 7240/7264 co-relation queries the response was YES. [2025-03-13 21:40:38,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 1987 events. 1447/1987 cut-off events. For 7240/7264 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8233 event pairs, 375 based on Foata normal form. 72/2040 useless extension candidates. Maximal degree in co-relation 8664. Up to 1150 conditions per place. [2025-03-13 21:40:38,375 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-03-13 21:40:38,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1094 flow [2025-03-13 21:40:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-13 21:40:38,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-03-13 21:40:38,376 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 364 flow. Second operand 5 states and 111 transitions. [2025-03-13 21:40:38,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1094 flow [2025-03-13 21:40:38,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-13 21:40:38,383 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2025-03-13 21:40:38,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-13 21:40:38,384 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2025-03-13 21:40:38,384 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2025-03-13 21:40:38,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 21:40:38,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:38,384 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] [2025-03-13 21:40:38,390 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-13 21:40:38,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:38,588 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-13 21:40:38,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1740264672, now seen corresponding path program 1 times [2025-03-13 21:40:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:38,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273561749] [2025-03-13 21:40:38,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:38,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:38,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:38,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:38,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273561749] [2025-03-13 21:40:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273561749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926031125] [2025-03-13 21:40:38,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:38,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:38,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:38,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:38,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:40:39,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:39,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:39,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:40:39,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:01,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926031125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:02,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-13 21:41:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393328281] [2025-03-13 21:41:02,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:02,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:41:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:02,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:41:02,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=168, Unknown=1, NotChecked=0, Total=240 [2025-03-13 21:41:02,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:41:02,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 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-13 21:41:02,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:02,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:41:02,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:10,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:11,997 INFO L124 PetriNetUnfolderBase]: 2703/3713 cut-off events. [2025-03-13 21:41:11,998 INFO L125 PetriNetUnfolderBase]: For 13834/13834 co-relation queries the response was YES. [2025-03-13 21:41:12,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18472 conditions, 3713 events. 2703/3713 cut-off events. For 13834/13834 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16616 event pairs, 286 based on Foata normal form. 15/3713 useless extension candidates. Maximal degree in co-relation 16367. Up to 2092 conditions per place. [2025-03-13 21:41:12,017 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 179 selfloop transitions, 100 changer transitions 20/304 dead transitions. [2025-03-13 21:41:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 304 transitions, 2734 flow [2025-03-13 21:41:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:41:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:41:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 345 transitions. [2025-03-13 21:41:12,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673828125 [2025-03-13 21:41:12,020 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 401 flow. Second operand 16 states and 345 transitions. [2025-03-13 21:41:12,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 304 transitions, 2734 flow [2025-03-13 21:41:12,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 304 transitions, 2645 flow, removed 32 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:12,037 INFO L231 Difference]: Finished difference. Result has 94 places, 153 transitions, 1636 flow [2025-03-13 21:41:12,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1636, PETRI_PLACES=94, PETRI_TRANSITIONS=153} [2025-03-13 21:41:12,038 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2025-03-13 21:41:12,039 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 153 transitions, 1636 flow [2025-03-13 21:41:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 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-13 21:41:12,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:12,039 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] [2025-03-13 21:41:12,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:41:12,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-13 21:41:12,240 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-13 21:41:12,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1613900488, now seen corresponding path program 2 times [2025-03-13 21:41:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824278426] [2025-03-13 21:41:12,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:12,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:41:12,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:12,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:12,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824278426] [2025-03-13 21:41:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824278426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506966567] [2025-03-13 21:41:12,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:12,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:12,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:41:12,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:41:12,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:41:12,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:12,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:12,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:41:12,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:52,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:53,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506966567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:53,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:53,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-13 21:41:53,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095107180] [2025-03-13 21:41:53,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:53,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:41:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:53,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:41:53,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=158, Unknown=1, NotChecked=0, Total=240 [2025-03-13 21:41:53,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:41:53,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 153 transitions, 1636 flow. Second operand has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 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-13 21:41:53,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:53,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:41:53,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:58,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:03,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:07,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:11,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []