./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:24:03,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:24:03,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:24:03,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:24:03,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:24:03,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:24:03,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:24:03,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:24:03,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:24:03,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:24:03,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:24:03,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:24:03,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:24:03,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:24:03,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:24:03,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:24:03,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:24:03,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:24:03,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:24:03,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:24:03,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:24:03,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:24:03,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:24:03,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:03,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:24:03,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:24:03,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:24:03,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:24:03,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:24:03,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:24:03,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:24:03,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:24:03,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:24:03,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:24:03,491 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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-03-04 02:24:03,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:24:03,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:24:03,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:24:03,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:24:03,788 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:24:03,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 02:24:05,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73b1f902/bbe5bafec6ec4259961e36f33beac023/FLAG8d1f33922 [2025-03-04 02:24:05,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:24:05,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 02:24:05,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73b1f902/bbe5bafec6ec4259961e36f33beac023/FLAG8d1f33922 [2025-03-04 02:24:05,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73b1f902/bbe5bafec6ec4259961e36f33beac023 [2025-03-04 02:24:05,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:24:05,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:24:05,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:05,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:24:05,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:24:05,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba3c927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05, skipping insertion in model container [2025-03-04 02:24:05,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:24:05,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-03-04 02:24:05,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:05,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:24:05,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-03-04 02:24:05,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:05,795 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:24:05,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05 WrapperNode [2025-03-04 02:24:05,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:05,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:05,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:24:05,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:24:05,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,824 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2025-03-04 02:24:05,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:05,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:24:05,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:24:05,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:24:05,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,856 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:24:05,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:24:05,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:24:05,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:24:05,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:24:05,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (1/1) ... [2025-03-04 02:24:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:05,894 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-04 02:24:05,896 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-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:24:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:24:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:24:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:24:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:24:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:24:05,913 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:24:05,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:24:05,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:24:06,222 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:24:06,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:24:06,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:24:06,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:24:06,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:06 BoogieIcfgContainer [2025-03-04 02:24:06,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:24:06,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:24:06,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:24:06,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:24:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:24:05" (1/3) ... [2025-03-04 02:24:06,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379c72e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:06, skipping insertion in model container [2025-03-04 02:24:06,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:05" (2/3) ... [2025-03-04 02:24:06,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379c72e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:06, skipping insertion in model container [2025-03-04 02:24:06,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:06" (3/3) ... [2025-03-04 02:24:06,413 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-03-04 02:24:06,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:24:06,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:24:06,425 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:24:06,498 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:24:06,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-04 02:24:06,545 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-04 02:24:06,548 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:24:06,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 02:24:06,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-04 02:24:06,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-04 02:24:06,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:24:06,565 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;@5a2e10ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:24:06,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:24:06,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:24:06,574 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-04 02:24:06,574 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:24:06,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:06,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:06,575 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 1 more)] === [2025-03-04 02:24:06,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 798047629, now seen corresponding path program 1 times [2025-03-04 02:24:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197856860] [2025-03-04 02:24:06,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:06,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:24:06,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:24:06,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:06,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:06,914 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-04 02:24:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197856860] [2025-03-04 02:24:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197856860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:24:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624269757] [2025-03-04 02:24:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:24:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:06,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:24:06,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:24:06,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 02:24:06,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04 02:24:06,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:06,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 02:24:06,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:07,129 INFO L124 PetriNetUnfolderBase]: 617/956 cut-off events. [2025-03-04 02:24:07,129 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-04 02:24:07,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 956 events. 617/956 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3850 event pairs, 126 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 1717. Up to 677 conditions per place. [2025-03-04 02:24:07,136 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-04 02:24:07,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-04 02:24:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:24:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:24:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 02:24:07,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-04 02:24:07,148 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-04 02:24:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-04 02:24:07,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:24:07,158 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-04 02:24:07,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-04 02:24:07,162 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-04 02:24:07,163 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-04 02:24:07,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04 02:24:07,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:07,163 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] [2025-03-04 02:24:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:24:07,163 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 1 more)] === [2025-03-04 02:24:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1287002738, now seen corresponding path program 1 times [2025-03-04 02:24:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059918111] [2025-03-04 02:24:07,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:07,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:24:07,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:24:07,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:07,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:07,335 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-04 02:24:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059918111] [2025-03-04 02:24:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059918111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505893197] [2025-03-04 02:24:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:07,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:07,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:07,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:24:07,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:07,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:24:07,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:07,600 INFO L124 PetriNetUnfolderBase]: 1206/1894 cut-off events. [2025-03-04 02:24:07,600 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-03-04 02:24:07,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 1894 events. 1206/1894 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9229 event pairs, 745 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 1088. Up to 1120 conditions per place. [2025-03-04 02:24:07,609 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 63 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-03-04 02:24:07,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 71 transitions, 334 flow [2025-03-04 02:24:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-04 02:24:07,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5575757575757576 [2025-03-04 02:24:07,611 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 5 states and 92 transitions. [2025-03-04 02:24:07,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 71 transitions, 334 flow [2025-03-04 02:24:07,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 71 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:07,613 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 122 flow [2025-03-04 02:24:07,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-03-04 02:24:07,613 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-04 02:24:07,613 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 122 flow [2025-03-04 02:24:07,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:07,614 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] [2025-03-04 02:24:07,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:24:07,614 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 1 more)] === [2025-03-04 02:24:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1391260711, now seen corresponding path program 1 times [2025-03-04 02:24:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493018135] [2025-03-04 02:24:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:07,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:24:07,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:24:07,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:07,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:07,761 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-04 02:24:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493018135] [2025-03-04 02:24:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493018135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:07,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138260895] [2025-03-04 02:24:07,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:07,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:07,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:24:07,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:07,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:24:07,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:07,974 INFO L124 PetriNetUnfolderBase]: 1047/1641 cut-off events. [2025-03-04 02:24:07,974 INFO L125 PetriNetUnfolderBase]: For 677/755 co-relation queries the response was YES. [2025-03-04 02:24:07,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1641 events. 1047/1641 cut-off events. For 677/755 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7555 event pairs, 686 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 2766. Up to 1133 conditions per place. [2025-03-04 02:24:07,983 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 56 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-04 02:24:07,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 326 flow [2025-03-04 02:24:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-04 02:24:07,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-04 02:24:07,985 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 122 flow. Second operand 5 states and 87 transitions. [2025-03-04 02:24:07,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 326 flow [2025-03-04 02:24:07,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 322 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:07,987 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 143 flow [2025-03-04 02:24:07,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-04 02:24:07,988 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-03-04 02:24:07,988 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 143 flow [2025-03-04 02:24:07,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:07,989 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] [2025-03-04 02:24:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:24:07,989 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 1 more)] === [2025-03-04 02:24:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1437167876, now seen corresponding path program 1 times [2025-03-04 02:24:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067705613] [2025-03-04 02:24:07,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:07,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:24:08,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:24:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:08,102 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-04 02:24:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067705613] [2025-03-04 02:24:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067705613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117973851] [2025-03-04 02:24:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:08,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:08,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:08,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:24:08,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:08,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:08,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:24:08,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:08,289 INFO L124 PetriNetUnfolderBase]: 882/1337 cut-off events. [2025-03-04 02:24:08,289 INFO L125 PetriNetUnfolderBase]: For 784/921 co-relation queries the response was YES. [2025-03-04 02:24:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1337 events. 882/1337 cut-off events. For 784/921 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5569 event pairs, 601 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 2827. Up to 1095 conditions per place. [2025-03-04 02:24:08,298 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 2 changer transitions 23/56 dead transitions. [2025-03-04 02:24:08,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 309 flow [2025-03-04 02:24:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-04 02:24:08,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-04 02:24:08,300 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 143 flow. Second operand 5 states and 81 transitions. [2025-03-04 02:24:08,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 309 flow [2025-03-04 02:24:08,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:08,302 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 116 flow [2025-03-04 02:24:08,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-03-04 02:24:08,304 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2025-03-04 02:24:08,304 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 116 flow [2025-03-04 02:24:08,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:08,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:08,304 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-04 02:24:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:24:08,305 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 1 more)] === [2025-03-04 02:24:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -315886043, now seen corresponding path program 1 times [2025-03-04 02:24:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703379231] [2025-03-04 02:24:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:08,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:08,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:08,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:08,430 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-04 02:24:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703379231] [2025-03-04 02:24:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703379231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087836346] [2025-03-04 02:24:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:08,434 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-04 02:24:08,435 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-04 02:24:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:08,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:08,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:08,611 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-04 02:24:08,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:08,670 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-04 02:24:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087836346] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-04 02:24:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440401885] [2025-03-04 02:24:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:08,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:08,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:08,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:24:08,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:24:08,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:08,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:08,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:24:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:09,051 INFO L124 PetriNetUnfolderBase]: 1468/2122 cut-off events. [2025-03-04 02:24:09,052 INFO L125 PetriNetUnfolderBase]: For 843/993 co-relation queries the response was YES. [2025-03-04 02:24:09,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 2122 events. 1468/2122 cut-off events. For 843/993 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9238 event pairs, 293 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 5688. Up to 668 conditions per place. [2025-03-04 02:24:09,063 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2025-03-04 02:24:09,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 104 transitions, 559 flow [2025-03-04 02:24:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:24:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:24:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-03-04 02:24:09,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4612794612794613 [2025-03-04 02:24:09,064 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 116 flow. Second operand 9 states and 137 transitions. [2025-03-04 02:24:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 104 transitions, 559 flow [2025-03-04 02:24:09,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 489 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-03-04 02:24:09,071 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 178 flow [2025-03-04 02:24:09,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 02:24:09,071 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2025-03-04 02:24:09,071 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 178 flow [2025-03-04 02:24:09,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:09,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:09,072 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-04 02:24:09,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:24:09,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:09,276 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 1 more)] === [2025-03-04 02:24:09,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash -842556523, now seen corresponding path program 2 times [2025-03-04 02:24:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467841484] [2025-03-04 02:24:09,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:09,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:09,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-04 02:24:09,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:24:09,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467841484] [2025-03-04 02:24:09,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467841484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:09,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:09,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:24:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437702699] [2025-03-04 02:24:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:24:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:09,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:24:09,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:24:09,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:24:09,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-04 02:24:09,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:09,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:24:09,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:09,893 INFO L124 PetriNetUnfolderBase]: 3201/4657 cut-off events. [2025-03-04 02:24:09,894 INFO L125 PetriNetUnfolderBase]: For 3504/3504 co-relation queries the response was YES. [2025-03-04 02:24:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 4657 events. 3201/4657 cut-off events. For 3504/3504 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24168 event pairs, 327 based on Foata normal form. 13/4411 useless extension candidates. Maximal degree in co-relation 13119. Up to 1405 conditions per place. [2025-03-04 02:24:09,916 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 196 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2025-03-04 02:24:09,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 221 transitions, 1373 flow [2025-03-04 02:24:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:24:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:24:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:24:09,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5316804407713499 [2025-03-04 02:24:09,917 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 178 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:24:09,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 221 transitions, 1373 flow [2025-03-04 02:24:09,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 221 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:09,936 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 405 flow [2025-03-04 02:24:09,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=405, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2025-03-04 02:24:09,938 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2025-03-04 02:24:09,938 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 405 flow [2025-03-04 02:24:09,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-04 02:24:09,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:09,939 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-04 02:24:09,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:24:09,939 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 1 more)] === [2025-03-04 02:24:09,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1637086117, now seen corresponding path program 3 times [2025-03-04 02:24:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799760247] [2025-03-04 02:24:09,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:09,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:09,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:09,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799760247] [2025-03-04 02:24:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799760247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616048694] [2025-03-04 02:24:10,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:10,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:10,042 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-04 02:24:10,043 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-04 02:24:10,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:10,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:10,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:10,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:10,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:10,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:10,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616048694] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:10,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:24:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401549687] [2025-03-04 02:24:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:10,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:10,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:24:10,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:24:10,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:10,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:10,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:24:10,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:10,837 INFO L124 PetriNetUnfolderBase]: 4339/6263 cut-off events. [2025-03-04 02:24:10,837 INFO L125 PetriNetUnfolderBase]: For 12931/13294 co-relation queries the response was YES. [2025-03-04 02:24:10,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22272 conditions, 6263 events. 4339/6263 cut-off events. For 12931/13294 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 32858 event pairs, 759 based on Foata normal form. 184/6442 useless extension candidates. Maximal degree in co-relation 22241. Up to 1980 conditions per place. [2025-03-04 02:24:10,869 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 40 changer transitions 0/168 dead transitions. [2025-03-04 02:24:10,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 168 transitions, 1272 flow [2025-03-04 02:24:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:24:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:24:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 02:24:10,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-04 02:24:10,870 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 405 flow. Second operand 9 states and 144 transitions. [2025-03-04 02:24:10,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 168 transitions, 1272 flow [2025-03-04 02:24:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 168 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:10,913 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 681 flow [2025-03-04 02:24:10,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=681, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2025-03-04 02:24:10,914 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2025-03-04 02:24:10,914 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 681 flow [2025-03-04 02:24:10,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:10,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:10,914 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-04 02:24:10,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:24:11,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:24:11,115 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 1 more)] === [2025-03-04 02:24:11,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1166765793, now seen corresponding path program 4 times [2025-03-04 02:24:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632249290] [2025-03-04 02:24:11,116 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:11,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:11,125 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-04 02:24:11,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:24:11,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632249290] [2025-03-04 02:24:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632249290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:24:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957699638] [2025-03-04 02:24:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:11,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:11,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:24:11,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:24:11,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 681 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:11,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:11,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:24:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:12,524 INFO L124 PetriNetUnfolderBase]: 8944/12548 cut-off events. [2025-03-04 02:24:12,525 INFO L125 PetriNetUnfolderBase]: For 50159/50159 co-relation queries the response was YES. [2025-03-04 02:24:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52961 conditions, 12548 events. 8944/12548 cut-off events. For 50159/50159 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 65772 event pairs, 958 based on Foata normal form. 24/12115 useless extension candidates. Maximal degree in co-relation 52923. Up to 3364 conditions per place. [2025-03-04 02:24:12,593 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 243 selfloop transitions, 162 changer transitions 0/406 dead transitions. [2025-03-04 02:24:12,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 406 transitions, 3914 flow [2025-03-04 02:24:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:24:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:24:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 269 transitions. [2025-03-04 02:24:12,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45286195286195285 [2025-03-04 02:24:12,595 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 681 flow. Second operand 18 states and 269 transitions. [2025-03-04 02:24:12,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 406 transitions, 3914 flow [2025-03-04 02:24:12,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 406 transitions, 3749 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:12,770 INFO L231 Difference]: Finished difference. Result has 103 places, 223 transitions, 2598 flow [2025-03-04 02:24:12,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2598, PETRI_PLACES=103, PETRI_TRANSITIONS=223} [2025-03-04 02:24:12,770 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2025-03-04 02:24:12,771 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 223 transitions, 2598 flow [2025-03-04 02:24:12,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:12,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:12,771 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-04 02:24:12,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:24:12,771 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 1 more)] === [2025-03-04 02:24:12,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2122204577, now seen corresponding path program 5 times [2025-03-04 02:24:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939101611] [2025-03-04 02:24:12,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:12,777 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:12,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:12,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:12,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939101611] [2025-03-04 02:24:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939101611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64765666] [2025-03-04 02:24:12,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:12,883 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-04 02:24:12,885 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-04 02:24:12,931 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:12,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:12,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:12,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:12,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:24:12,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:13,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64765666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:13,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-04 02:24:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211653439] [2025-03-04 02:24:13,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:13,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:24:13,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:13,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:24:13,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:24:13,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:24:13,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 223 transitions, 2598 flow. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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-04 02:24:13,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:13,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:24:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:15,942 INFO L124 PetriNetUnfolderBase]: 15903/22433 cut-off events. [2025-03-04 02:24:15,942 INFO L125 PetriNetUnfolderBase]: For 163556/163556 co-relation queries the response was YES. [2025-03-04 02:24:16,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115271 conditions, 22433 events. 15903/22433 cut-off events. For 163556/163556 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 129219 event pairs, 1556 based on Foata normal form. 62/22494 useless extension candidates. Maximal degree in co-relation 115218. Up to 5067 conditions per place. [2025-03-04 02:24:16,083 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 419 selfloop transitions, 413 changer transitions 1/834 dead transitions. [2025-03-04 02:24:16,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 834 transitions, 9852 flow [2025-03-04 02:24:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:24:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:24:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 435 transitions. [2025-03-04 02:24:16,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:24:16,085 INFO L175 Difference]: Start difference. First operand has 103 places, 223 transitions, 2598 flow. Second operand 30 states and 435 transitions. [2025-03-04 02:24:16,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 834 transitions, 9852 flow [2025-03-04 02:24:17,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 834 transitions, 9576 flow, removed 138 selfloop flow, removed 0 redundant places. [2025-03-04 02:24:17,630 INFO L231 Difference]: Finished difference. Result has 141 places, 509 transitions, 7194 flow [2025-03-04 02:24:17,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7194, PETRI_PLACES=141, PETRI_TRANSITIONS=509} [2025-03-04 02:24:17,631 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 106 predicate places. [2025-03-04 02:24:17,631 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 509 transitions, 7194 flow [2025-03-04 02:24:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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-04 02:24:17,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:17,631 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-04 02:24:17,637 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-04 02:24:17,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:17,835 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 1 more)] === [2025-03-04 02:24:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1623356617, now seen corresponding path program 6 times [2025-03-04 02:24:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584886726] [2025-03-04 02:24:17,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:24:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:17,847 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:17,852 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-04 02:24:17,852 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:24:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584886726] [2025-03-04 02:24:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584886726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:24:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141533905] [2025-03-04 02:24:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:17,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:24:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:17,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:24:17,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:24:17,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:24:17,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 509 transitions, 7194 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-04 02:24:17,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:17,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:24:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:21,254 INFO L124 PetriNetUnfolderBase]: 19750/27758 cut-off events. [2025-03-04 02:24:21,254 INFO L125 PetriNetUnfolderBase]: For 264777/264777 co-relation queries the response was YES. [2025-03-04 02:24:21,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157140 conditions, 27758 events. 19750/27758 cut-off events. For 264777/264777 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 165309 event pairs, 5136 based on Foata normal form. 16/27774 useless extension candidates. Maximal degree in co-relation 157074. Up to 17364 conditions per place. [2025-03-04 02:24:21,669 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 891 selfloop transitions, 254 changer transitions 0/1146 dead transitions. [2025-03-04 02:24:21,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1146 transitions, 17944 flow [2025-03-04 02:24:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:24:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:24:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2025-03-04 02:24:21,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-03-04 02:24:21,671 INFO L175 Difference]: Start difference. First operand has 141 places, 509 transitions, 7194 flow. Second operand 12 states and 210 transitions. [2025-03-04 02:24:21,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1146 transitions, 17944 flow [2025-03-04 02:24:25,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 1146 transitions, 16721 flow, removed 550 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:25,279 INFO L231 Difference]: Finished difference. Result has 158 places, 708 transitions, 10697 flow [2025-03-04 02:24:25,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6733, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10697, PETRI_PLACES=158, PETRI_TRANSITIONS=708} [2025-03-04 02:24:25,279 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 123 predicate places. [2025-03-04 02:24:25,279 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 708 transitions, 10697 flow [2025-03-04 02:24:25,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-04 02:24:25,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:25,280 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-04 02:24:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:24:25,280 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 1 more)] === [2025-03-04 02:24:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -582138042, now seen corresponding path program 1 times [2025-03-04 02:24:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850432133] [2025-03-04 02:24:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:25,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:25,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:25,352 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-04 02:24:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850432133] [2025-03-04 02:24:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850432133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812234543] [2025-03-04 02:24:25,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:25,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:25,354 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-04 02:24:25,356 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-04 02:24:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:25,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:25,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:25,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:25,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:24:25,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:25,436 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-04 02:24:25,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:25,463 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-04 02:24:25,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812234543] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:25,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:25,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:24:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504864462] [2025-03-04 02:24:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:25,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:25,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:24:25,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 02:24:25,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 708 transitions, 10697 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:25,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:25,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 02:24:25,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:28,947 INFO L124 PetriNetUnfolderBase]: 15765/22593 cut-off events. [2025-03-04 02:24:28,947 INFO L125 PetriNetUnfolderBase]: For 273879/276394 co-relation queries the response was YES. [2025-03-04 02:24:29,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133555 conditions, 22593 events. 15765/22593 cut-off events. For 273879/276394 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 142636 event pairs, 3076 based on Foata normal form. 1152/23184 useless extension candidates. Maximal degree in co-relation 133482. Up to 11223 conditions per place. [2025-03-04 02:24:29,200 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 693 selfloop transitions, 43 changer transitions 0/874 dead transitions. [2025-03-04 02:24:29,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 874 transitions, 14979 flow [2025-03-04 02:24:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-04 02:24:29,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-04 02:24:29,201 INFO L175 Difference]: Start difference. First operand has 158 places, 708 transitions, 10697 flow. Second operand 5 states and 72 transitions. [2025-03-04 02:24:29,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 874 transitions, 14979 flow [2025-03-04 02:24:31,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 874 transitions, 14773 flow, removed 90 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:31,781 INFO L231 Difference]: Finished difference. Result has 161 places, 683 transitions, 10306 flow [2025-03-04 02:24:31,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10220, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10306, PETRI_PLACES=161, PETRI_TRANSITIONS=683} [2025-03-04 02:24:31,782 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 126 predicate places. [2025-03-04 02:24:31,782 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 683 transitions, 10306 flow [2025-03-04 02:24:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:31,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:31,782 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-04 02:24:31,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:24:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:31,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1545178559, now seen corresponding path program 7 times [2025-03-04 02:24:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352985341] [2025-03-04 02:24:31,984 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:24:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:31,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:32,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:32,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:32,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:32,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352985341] [2025-03-04 02:24:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352985341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:32,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997204710] [2025-03-04 02:24:32,086 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:24:32,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:32,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:32,089 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-04 02:24:32,090 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-04 02:24:32,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:32,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:32,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:32,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:32,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:32,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:32,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:32,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997204710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:32,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-03-04 02:24:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055666853] [2025-03-04 02:24:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:32,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:24:32,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:24:32,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 683 transitions, 10306 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:32,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:32,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:24:32,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:35,746 INFO L124 PetriNetUnfolderBase]: 18488/26249 cut-off events. [2025-03-04 02:24:35,746 INFO L125 PetriNetUnfolderBase]: For 275798/276927 co-relation queries the response was YES. [2025-03-04 02:24:35,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153807 conditions, 26249 events. 18488/26249 cut-off events. For 275798/276927 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 161818 event pairs, 2604 based on Foata normal form. 421/26513 useless extension candidates. Maximal degree in co-relation 153731. Up to 9185 conditions per place. [2025-03-04 02:24:36,004 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 636 selfloop transitions, 386 changer transitions 0/1031 dead transitions. [2025-03-04 02:24:36,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1031 transitions, 16933 flow [2025-03-04 02:24:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:24:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:24:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-03-04 02:24:36,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-04 02:24:36,005 INFO L175 Difference]: Start difference. First operand has 161 places, 683 transitions, 10306 flow. Second operand 9 states and 143 transitions. [2025-03-04 02:24:36,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1031 transitions, 16933 flow [2025-03-04 02:24:39,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1031 transitions, 16831 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:39,538 INFO L231 Difference]: Finished difference. Result has 170 places, 809 transitions, 13831 flow [2025-03-04 02:24:39,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10250, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13831, PETRI_PLACES=170, PETRI_TRANSITIONS=809} [2025-03-04 02:24:39,539 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 135 predicate places. [2025-03-04 02:24:39,539 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 809 transitions, 13831 flow [2025-03-04 02:24:39,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:39,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:39,539 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-04 02:24:39,546 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-04 02:24:39,739 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,SelfDestructingSolverStorable11 [2025-03-04 02:24:39,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1096939565, now seen corresponding path program 8 times [2025-03-04 02:24:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599939722] [2025-03-04 02:24:39,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:39,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:39,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 23 statements. [2025-03-04 02:24:39,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:24:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599939722] [2025-03-04 02:24:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599939722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:24:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745752771] [2025-03-04 02:24:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:39,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:24:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:39,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:24:39,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:24:39,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:24:39,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 809 transitions, 13831 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-04 02:24:39,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:39,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:24:39,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:45,270 INFO L124 PetriNetUnfolderBase]: 21421/30001 cut-off events. [2025-03-04 02:24:45,271 INFO L125 PetriNetUnfolderBase]: For 406304/406304 co-relation queries the response was YES. [2025-03-04 02:24:45,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188380 conditions, 30001 events. 21421/30001 cut-off events. For 406304/406304 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 180247 event pairs, 2263 based on Foata normal form. 28/30029 useless extension candidates. Maximal degree in co-relation 188299. Up to 13092 conditions per place. [2025-03-04 02:24:45,660 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1138 selfloop transitions, 337 changer transitions 0/1476 dead transitions. [2025-03-04 02:24:45,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1476 transitions, 26995 flow [2025-03-04 02:24:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:24:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:24:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-03-04 02:24:45,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104895104895105 [2025-03-04 02:24:45,665 INFO L175 Difference]: Start difference. First operand has 170 places, 809 transitions, 13831 flow. Second operand 13 states and 219 transitions. [2025-03-04 02:24:45,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1476 transitions, 26995 flow [2025-03-04 02:24:50,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1476 transitions, 26642 flow, removed 175 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:50,078 INFO L231 Difference]: Finished difference. Result has 188 places, 902 transitions, 16761 flow [2025-03-04 02:24:50,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13696, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16761, PETRI_PLACES=188, PETRI_TRANSITIONS=902} [2025-03-04 02:24:50,079 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 153 predicate places. [2025-03-04 02:24:50,079 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 902 transitions, 16761 flow [2025-03-04 02:24:50,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-04 02:24:50,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:50,080 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-04 02:24:50,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:24:50,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:50,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 601447453, now seen corresponding path program 9 times [2025-03-04 02:24:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542644389] [2025-03-04 02:24:50,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:50,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:50,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:50,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:50,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542644389] [2025-03-04 02:24:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542644389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071881406] [2025-03-04 02:24:50,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:50,155 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-04 02:24:50,156 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-04 02:24:50,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:24:50,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:50,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:50,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:50,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:50,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071881406] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-03-04 02:24:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27046730] [2025-03-04 02:24:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:50,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:50,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:50,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:24:50,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:24:50,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 902 transitions, 16761 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:50,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:50,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:24:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:54,816 INFO L124 PetriNetUnfolderBase]: 19115/27267 cut-off events. [2025-03-04 02:24:54,816 INFO L125 PetriNetUnfolderBase]: For 403508/404571 co-relation queries the response was YES. [2025-03-04 02:24:55,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176401 conditions, 27267 events. 19115/27267 cut-off events. For 403508/404571 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 170276 event pairs, 1929 based on Foata normal form. 402/27512 useless extension candidates. Maximal degree in co-relation 176313. Up to 11878 conditions per place. [2025-03-04 02:24:55,366 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 426 selfloop transitions, 604 changer transitions 0/1039 dead transitions. [2025-03-04 02:24:55,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 1039 transitions, 20569 flow [2025-03-04 02:24:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:24:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:24:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-03-04 02:24:55,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-03-04 02:24:55,367 INFO L175 Difference]: Start difference. First operand has 188 places, 902 transitions, 16761 flow. Second operand 8 states and 123 transitions. [2025-03-04 02:24:55,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 1039 transitions, 20569 flow [2025-03-04 02:25:00,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1039 transitions, 20405 flow, removed 48 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:00,133 INFO L231 Difference]: Finished difference. Result has 196 places, 947 transitions, 19556 flow [2025-03-04 02:25:00,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=16617, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=559, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19556, PETRI_PLACES=196, PETRI_TRANSITIONS=947} [2025-03-04 02:25:00,135 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 161 predicate places. [2025-03-04 02:25:00,135 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 947 transitions, 19556 flow [2025-03-04 02:25:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:00,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:00,135 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-04 02:25:00,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:25:00,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:00,339 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:00,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1623394721, now seen corresponding path program 10 times [2025-03-04 02:25:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295176847] [2025-03-04 02:25:00,340 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:00,349 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:25:00,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-04 02:25:00,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:25:00,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:00,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:00,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295176847] [2025-03-04 02:25:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295176847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:00,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491218569] [2025-03-04 02:25:00,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:00,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:00,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:25:00,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:25:00,481 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-04 02:25:00,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:25:00,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:00,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:25:00,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:00,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491218569] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:25:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 12 [2025-03-04 02:25:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12698542] [2025-03-04 02:25:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:00,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:25:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:00,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:25:00,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:25:00,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:25:00,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 947 transitions, 19556 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:00,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:00,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:25:00,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:07,514 INFO L124 PetriNetUnfolderBase]: 22584/31940 cut-off events. [2025-03-04 02:25:07,515 INFO L125 PetriNetUnfolderBase]: For 559386/559386 co-relation queries the response was YES. [2025-03-04 02:25:07,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220941 conditions, 31940 events. 22584/31940 cut-off events. For 559386/559386 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 195767 event pairs, 3144 based on Foata normal form. 22/31962 useless extension candidates. Maximal degree in co-relation 220848. Up to 7529 conditions per place. [2025-03-04 02:25:07,997 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 627 selfloop transitions, 622 changer transitions 0/1250 dead transitions. [2025-03-04 02:25:07,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1250 transitions, 26826 flow [2025-03-04 02:25:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:25:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:25:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2025-03-04 02:25:07,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43356643356643354 [2025-03-04 02:25:07,998 INFO L175 Difference]: Start difference. First operand has 196 places, 947 transitions, 19556 flow. Second operand 13 states and 186 transitions. [2025-03-04 02:25:07,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1250 transitions, 26826 flow [2025-03-04 02:25:14,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1250 transitions, 26483 flow, removed 58 selfloop flow, removed 3 redundant places. [2025-03-04 02:25:14,228 INFO L231 Difference]: Finished difference. Result has 211 places, 1105 transitions, 23792 flow [2025-03-04 02:25:14,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=19290, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23792, PETRI_PLACES=211, PETRI_TRANSITIONS=1105} [2025-03-04 02:25:14,229 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 176 predicate places. [2025-03-04 02:25:14,229 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 1105 transitions, 23792 flow [2025-03-04 02:25:14,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:14,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:14,229 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-04 02:25:14,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:25:14,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:14,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:14,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1432136681, now seen corresponding path program 11 times [2025-03-04 02:25:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:14,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081833383] [2025-03-04 02:25:14,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:14,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:25:14,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:14,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:14,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081833383] [2025-03-04 02:25:14,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081833383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380361392] [2025-03-04 02:25:14,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:14,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:14,515 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:14,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:25:14,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:25:14,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:14,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:14,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:25:14,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:14,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380361392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:14,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:14,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:25:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116759456] [2025-03-04 02:25:14,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:14,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:25:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:14,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:25:14,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:25:14,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-04 02:25:14,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 1105 transitions, 23792 flow. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-04 02:25:14,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:14,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-04 02:25:14,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand