./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.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/unroll-cond-2.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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:42,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:42,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:42,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:42,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:42,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:42,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:42,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:42,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:42,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:42,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:42,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:42,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:42,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:42,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:42,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:42,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:42,770 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-04 02:28:43,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:43,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:43,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:43,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:43,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:43,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 02:28:44,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af5229d3/d368e23129fc44a3ab0c29121448d151/FLAGd558f1922 [2025-03-04 02:28:44,472 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:44,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 02:28:44,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af5229d3/d368e23129fc44a3ab0c29121448d151/FLAGd558f1922 [2025-03-04 02:28:44,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af5229d3/d368e23129fc44a3ab0c29121448d151 [2025-03-04 02:28:44,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:44,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:44,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:44,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:44,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:44,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4695c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44, skipping insertion in model container [2025-03-04 02:28:44,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:44,665 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/unroll-cond-2.wvr.c[2500,2513] [2025-03-04 02:28:44,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:44,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:44,699 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/unroll-cond-2.wvr.c[2500,2513] [2025-03-04 02:28:44,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:44,714 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:44,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44 WrapperNode [2025-03-04 02:28:44,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:44,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:44,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:44,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:44,721 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:28:44" (1/1) ... [2025-03-04 02:28:44,731 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:28:44" (1/1) ... [2025-03-04 02:28:44,750 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 125 [2025-03-04 02:28:44,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:44,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:44,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:44,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:44,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,777 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:28:44,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:44,789 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:44,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:44,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:44,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (1/1) ... [2025-03-04 02:28:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:44,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:44,820 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:28:44,823 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:28:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:28:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:28:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:28:44,840 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:28:44,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:44,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:45,190 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:45,190 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:45,392 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:45,392 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:45,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:45 BoogieIcfgContainer [2025-03-04 02:28:45,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:45,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:45,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:45,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:45,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:44" (1/3) ... [2025-03-04 02:28:45,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9bbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:45, skipping insertion in model container [2025-03-04 02:28:45,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:44" (2/3) ... [2025-03-04 02:28:45,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee9bbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:45, skipping insertion in model container [2025-03-04 02:28:45,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:45" (3/3) ... [2025-03-04 02:28:45,402 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-04 02:28:45,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:45,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:28:45,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:45,458 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:28:45,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:28:45,511 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-04 02:28:45,515 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:45,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 02:28:45,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:28:45,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-04 02:28:45,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:45,543 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;@581a006e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:45,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:28:45,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:45,559 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-04 02:28:45,559 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:45,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:45,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:45,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1840295052, now seen corresponding path program 1 times [2025-03-04 02:28:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943777725] [2025-03-04 02:28:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:28:45,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:28:45,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:45,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:45,897 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:28:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943777725] [2025-03-04 02:28:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943777725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:28:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307362574] [2025-03-04 02:28:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:28:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:45,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:28:45,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:28:45,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:45,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:28:45,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:45,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:45,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:45,997 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-03-04 02:28:45,997 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:28:45,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-03-04 02:28:46,000 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-03-04 02:28:46,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-03-04 02:28:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:28:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:28:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-04 02:28:46,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:28:46,015 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-03-04 02:28:46,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-03-04 02:28:46,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:46,022 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-03-04 02:28:46,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-03-04 02:28:46,028 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-04 02:28:46,030 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-03-04 02:28:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:28:46,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:46,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:46,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:46,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1349574716, now seen corresponding path program 1 times [2025-03-04 02:28:46,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853971692] [2025-03-04 02:28:46,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:28:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:28:46,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:46,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,332 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:28:46,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853971692] [2025-03-04 02:28:46,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853971692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:46,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:46,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:46,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668334407] [2025-03-04 02:28:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:46,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:46,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:46,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:46,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:46,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:46,511 INFO L124 PetriNetUnfolderBase]: 67/123 cut-off events. [2025-03-04 02:28:46,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:28:46,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 123 events. 67/123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 335 event pairs, 2 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 249. Up to 77 conditions per place. [2025-03-04 02:28:46,513 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 30 selfloop transitions, 11 changer transitions 2/44 dead transitions. [2025-03-04 02:28:46,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 44 transitions, 194 flow [2025-03-04 02:28:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-04 02:28:46,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 02:28:46,515 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 6 states and 62 transitions. [2025-03-04 02:28:46,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 44 transitions, 194 flow [2025-03-04 02:28:46,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 44 transitions, 190 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:46,516 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 114 flow [2025-03-04 02:28:46,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2025-03-04 02:28:46,517 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-03-04 02:28:46,517 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 114 flow [2025-03-04 02:28:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:46,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:46,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:46,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:46,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash -493281410, now seen corresponding path program 2 times [2025-03-04 02:28:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891640009] [2025-03-04 02:28:46,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:28:46,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-04 02:28:46,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:46,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,727 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:28:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891640009] [2025-03-04 02:28:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891640009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:46,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275558936] [2025-03-04 02:28:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:46,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:46,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:46,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:46,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:46,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:46,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:46,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:46,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:46,842 INFO L124 PetriNetUnfolderBase]: 67/125 cut-off events. [2025-03-04 02:28:46,842 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 02:28:46,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 125 events. 67/125 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 3 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 362. Up to 77 conditions per place. [2025-03-04 02:28:46,844 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 29 selfloop transitions, 15 changer transitions 2/47 dead transitions. [2025-03-04 02:28:46,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 268 flow [2025-03-04 02:28:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:28:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:28:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2025-03-04 02:28:46,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-04 02:28:46,847 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 114 flow. Second operand 7 states and 64 transitions. [2025-03-04 02:28:46,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 268 flow [2025-03-04 02:28:46,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 260 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 02:28:46,848 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 173 flow [2025-03-04 02:28:46,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-04 02:28:46,849 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2025-03-04 02:28:46,849 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 173 flow [2025-03-04 02:28:46,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:46,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:46,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:46,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:28:46,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash -209840974, now seen corresponding path program 3 times [2025-03-04 02:28:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580060583] [2025-03-04 02:28:46,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:28:46,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-04 02:28:46,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:28:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,982 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:28:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580060583] [2025-03-04 02:28:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580060583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:46,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:46,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425052750] [2025-03-04 02:28:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:46,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:28:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:46,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:28:46,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:46,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:46,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:46,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:46,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:46,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:47,088 INFO L124 PetriNetUnfolderBase]: 83/158 cut-off events. [2025-03-04 02:28:47,089 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-03-04 02:28:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 158 events. 83/158 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 6 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 520. Up to 58 conditions per place. [2025-03-04 02:28:47,090 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 35 selfloop transitions, 19 changer transitions 2/57 dead transitions. [2025-03-04 02:28:47,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 368 flow [2025-03-04 02:28:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-03-04 02:28:47,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-04 02:28:47,091 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 173 flow. Second operand 8 states and 76 transitions. [2025-03-04 02:28:47,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 368 flow [2025-03-04 02:28:47,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 341 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:47,096 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 232 flow [2025-03-04 02:28:47,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-03-04 02:28:47,098 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2025-03-04 02:28:47,098 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 232 flow [2025-03-04 02:28:47,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:28:47,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:47,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:28:47,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 664979026, now seen corresponding path program 1 times [2025-03-04 02:28:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511766930] [2025-03-04 02:28:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:47,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:47,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:47,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:47,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:47,388 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:28:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511766930] [2025-03-04 02:28:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511766930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111736066] [2025-03-04 02:28:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:47,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:47,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:47,392 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:28:47,393 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:28:47,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:47,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:47,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:47,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:28:47,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:47,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:28:47,595 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:28:47,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:47,801 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:47,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2025-03-04 02:28:47,862 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:28:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111736066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:47,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:47,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:28:47,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654168940] [2025-03-04 02:28:47,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:47,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:28:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:47,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:28:47,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:28:47,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:47,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 232 flow. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:47,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:47,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:48,178 INFO L124 PetriNetUnfolderBase]: 121/225 cut-off events. [2025-03-04 02:28:48,178 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-03-04 02:28:48,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 225 events. 121/225 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 726 event pairs, 5 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 841. Up to 131 conditions per place. [2025-03-04 02:28:48,182 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 47 selfloop transitions, 22 changer transitions 3/73 dead transitions. [2025-03-04 02:28:48,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 525 flow [2025-03-04 02:28:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:28:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:28:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-03-04 02:28:48,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-04 02:28:48,184 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 232 flow. Second operand 10 states and 94 transitions. [2025-03-04 02:28:48,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 525 flow [2025-03-04 02:28:48,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 492 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:48,187 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 321 flow [2025-03-04 02:28:48,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=321, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-03-04 02:28:48,191 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2025-03-04 02:28:48,192 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 321 flow [2025-03-04 02:28:48,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:48,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:48,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:48,199 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:28:48,393 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:28:48,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1657429743, now seen corresponding path program 1 times [2025-03-04 02:28:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:48,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548947540] [2025-03-04 02:28:48,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:48,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:48,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:48,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:48,509 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:28:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548947540] [2025-03-04 02:28:48,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548947540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411146657] [2025-03-04 02:28:48,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:48,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:48,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:48,511 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:28:48,512 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:28:48,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:28:48,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:48,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 02:28:48,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:48,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:28:48,822 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:28:48,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2025-03-04 02:28:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:48,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-03-04 02:28:49,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-03-04 02:28:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411146657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:49,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2025-03-04 02:28:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816370052] [2025-03-04 02:28:49,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:49,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:28:49,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:49,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:28:49,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:28:49,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:49,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 321 flow. Second operand has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 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:28:49,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:49,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:49,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:51,131 INFO L124 PetriNetUnfolderBase]: 365/652 cut-off events. [2025-03-04 02:28:51,132 INFO L125 PetriNetUnfolderBase]: For 1188/1188 co-relation queries the response was YES. [2025-03-04 02:28:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 652 events. 365/652 cut-off events. For 1188/1188 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2880 event pairs, 25 based on Foata normal form. 13/665 useless extension candidates. Maximal degree in co-relation 2592. Up to 235 conditions per place. [2025-03-04 02:28:51,137 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 81 selfloop transitions, 62 changer transitions 57/201 dead transitions. [2025-03-04 02:28:51,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 201 transitions, 1563 flow [2025-03-04 02:28:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:28:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:28:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 270 transitions. [2025-03-04 02:28:51,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:28:51,143 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 321 flow. Second operand 30 states and 270 transitions. [2025-03-04 02:28:51,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 201 transitions, 1563 flow [2025-03-04 02:28:51,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 201 transitions, 1482 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:51,157 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 817 flow [2025-03-04 02:28:51,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=817, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2025-03-04 02:28:51,158 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2025-03-04 02:28:51,158 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 817 flow [2025-03-04 02:28:51,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 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:28:51,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:51,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:51,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:51,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:28:51,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:51,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1050676446, now seen corresponding path program 2 times [2025-03-04 02:28:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:51,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498258290] [2025-03-04 02:28:51,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:51,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:51,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:51,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:51,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,571 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:28:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498258290] [2025-03-04 02:28:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498258290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406248788] [2025-03-04 02:28:51,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:51,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:51,573 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:28:51,575 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:28:51,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:51,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:51,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:51,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:28:51,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:51,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:28:51,779 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:28:51,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:51,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:51,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 33 [2025-03-04 02:28:51,991 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:28:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406248788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:51,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-04 02:28:51,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693599507] [2025-03-04 02:28:51,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:51,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:28:51,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:51,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:28:51,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:28:51,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:51,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 817 flow. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:28:51,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:51,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:51,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:52,277 INFO L124 PetriNetUnfolderBase]: 253/460 cut-off events. [2025-03-04 02:28:52,277 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2025-03-04 02:28:52,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 460 events. 253/460 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1881 event pairs, 23 based on Foata normal form. 1/459 useless extension candidates. Maximal degree in co-relation 2257. Up to 350 conditions per place. [2025-03-04 02:28:52,282 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 72 selfloop transitions, 41 changer transitions 3/117 dead transitions. [2025-03-04 02:28:52,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 117 transitions, 1188 flow [2025-03-04 02:28:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:28:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:28:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2025-03-04 02:28:52,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2025-03-04 02:28:52,284 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 817 flow. Second operand 11 states and 91 transitions. [2025-03-04 02:28:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 117 transitions, 1188 flow [2025-03-04 02:28:52,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 1060 flow, removed 41 selfloop flow, removed 11 redundant places. [2025-03-04 02:28:52,293 INFO L231 Difference]: Finished difference. Result has 79 places, 95 transitions, 855 flow [2025-03-04 02:28:52,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=855, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2025-03-04 02:28:52,295 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2025-03-04 02:28:52,295 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 855 flow [2025-03-04 02:28:52,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:28:52,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:52,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:52,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:28:52,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:52,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:52,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 743933394, now seen corresponding path program 3 times [2025-03-04 02:28:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997793032] [2025-03-04 02:28:52,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:52,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:52,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:52,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:52,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,726 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:28:52,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997793032] [2025-03-04 02:28:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997793032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107925330] [2025-03-04 02:28:52,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:52,730 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:28:52,731 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:28:52,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:28:52,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:28:52,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:28:52,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:28:52,869 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:28:52,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:52,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:52,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 73 [2025-03-04 02:28:53,045 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:28:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107925330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:53,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 9 [2025-03-04 02:28:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965247244] [2025-03-04 02:28:53,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:53,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:28:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:28:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:28:53,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:53,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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:28:53,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:53,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:53,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:53,200 INFO L124 PetriNetUnfolderBase]: 255/468 cut-off events. [2025-03-04 02:28:53,200 INFO L125 PetriNetUnfolderBase]: For 1536/1536 co-relation queries the response was YES. [2025-03-04 02:28:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 468 events. 255/468 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1915 event pairs, 36 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 2163. Up to 365 conditions per place. [2025-03-04 02:28:53,203 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 74 selfloop transitions, 29 changer transitions 3/107 dead transitions. [2025-03-04 02:28:53,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 1122 flow [2025-03-04 02:28:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:28:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:28:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-03-04 02:28:53,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-04 02:28:53,204 INFO L175 Difference]: Start difference. First operand has 79 places, 95 transitions, 855 flow. Second operand 7 states and 61 transitions. [2025-03-04 02:28:53,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 1122 flow [2025-03-04 02:28:53,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 1037 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:53,214 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 849 flow [2025-03-04 02:28:53,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=849, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2025-03-04 02:28:53,215 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2025-03-04 02:28:53,215 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 849 flow [2025-03-04 02:28:53,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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:28:53,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:53,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:53,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:53,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:53,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2066376821, now seen corresponding path program 2 times [2025-03-04 02:28:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840995032] [2025-03-04 02:28:53,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:53,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:53,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:53,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840995032] [2025-03-04 02:28:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840995032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369517085] [2025-03-04 02:28:53,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:53,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:53,549 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:28:53,551 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:28:53,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:53,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:53,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:53,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:53,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:28:53,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:53,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:28:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369517085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:53,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 02:28:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127693510] [2025-03-04 02:28:53,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:53,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:28:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:53,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:28:53,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:53,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:28:53,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 849 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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:28:53,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:53,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:28:53,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:54,168 INFO L124 PetriNetUnfolderBase]: 303/565 cut-off events. [2025-03-04 02:28:54,168 INFO L125 PetriNetUnfolderBase]: For 1761/1761 co-relation queries the response was YES. [2025-03-04 02:28:54,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 565 events. 303/565 cut-off events. For 1761/1761 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2505 event pairs, 30 based on Foata normal form. 15/580 useless extension candidates. Maximal degree in co-relation 2454. Up to 146 conditions per place. [2025-03-04 02:28:54,173 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 94 selfloop transitions, 70 changer transitions 5/170 dead transitions. [2025-03-04 02:28:54,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1612 flow [2025-03-04 02:28:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:28:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:28:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2025-03-04 02:28:54,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41875 [2025-03-04 02:28:54,174 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 849 flow. Second operand 16 states and 134 transitions. [2025-03-04 02:28:54,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1612 flow [2025-03-04 02:28:54,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 170 transitions, 1551 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:54,183 INFO L231 Difference]: Finished difference. Result has 94 places, 118 transitions, 1182 flow [2025-03-04 02:28:54,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1182, PETRI_PLACES=94, PETRI_TRANSITIONS=118} [2025-03-04 02:28:54,184 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2025-03-04 02:28:54,184 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 118 transitions, 1182 flow [2025-03-04 02:28:54,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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:28:54,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:54,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:54,196 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:28:54,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:54,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:54,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash 19119941, now seen corresponding path program 1 times [2025-03-04 02:28:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338106912] [2025-03-04 02:28:54,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:54,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:54,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:54,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:54,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:28:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338106912] [2025-03-04 02:28:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338106912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:54,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853021201] [2025-03-04 02:28:54,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:54,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:54,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:54,530 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:28:54,532 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:28:54,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:54,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:54,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:54,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:54,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:28:54,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:54,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:28:54,819 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2025-03-04 02:28:54,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 63 [2025-03-04 02:28:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:54,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:55,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 194 [2025-03-04 02:28:55,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:55,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 778 treesize of output 574 [2025-03-04 02:29:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853021201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:03,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 02:29:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682950767] [2025-03-04 02:29:03,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:03,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:03,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:03,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 118 transitions, 1182 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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:29:03,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:03,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:03,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:04,635 INFO L124 PetriNetUnfolderBase]: 360/723 cut-off events. [2025-03-04 02:29:04,635 INFO L125 PetriNetUnfolderBase]: For 3247/3247 co-relation queries the response was YES. [2025-03-04 02:29:04,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3833 conditions, 723 events. 360/723 cut-off events. For 3247/3247 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3738 event pairs, 29 based on Foata normal form. 13/735 useless extension candidates. Maximal degree in co-relation 3538. Up to 201 conditions per place. [2025-03-04 02:29:04,640 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 92 selfloop transitions, 64 changer transitions 73/230 dead transitions. [2025-03-04 02:29:04,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 230 transitions, 2418 flow [2025-03-04 02:29:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:29:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:29:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 247 transitions. [2025-03-04 02:29:04,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44107142857142856 [2025-03-04 02:29:04,643 INFO L175 Difference]: Start difference. First operand has 94 places, 118 transitions, 1182 flow. Second operand 28 states and 247 transitions. [2025-03-04 02:29:04,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 230 transitions, 2418 flow [2025-03-04 02:29:04,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 230 transitions, 2135 flow, removed 123 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:04,655 INFO L231 Difference]: Finished difference. Result has 123 places, 104 transitions, 1053 flow [2025-03-04 02:29:04,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1053, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2025-03-04 02:29:04,657 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 102 predicate places. [2025-03-04 02:29:04,657 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 1053 flow [2025-03-04 02:29:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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:29:04,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:04,657 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:04,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:04,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:04,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1796501523, now seen corresponding path program 3 times [2025-03-04 02:29:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573124432] [2025-03-04 02:29:04,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:04,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:04,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:04,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573124432] [2025-03-04 02:29:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573124432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326459471] [2025-03-04 02:29:04,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:04,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:04,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:04,961 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:29:04,962 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:29:04,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:05,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:05,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:05,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:05,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:05,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326459471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:05,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109237731] [2025-03-04 02:29:05,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:05,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:05,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:05,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:05,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:05,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 104 transitions, 1053 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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:29:05,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:05,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:05,625 INFO L124 PetriNetUnfolderBase]: 313/668 cut-off events. [2025-03-04 02:29:05,625 INFO L125 PetriNetUnfolderBase]: For 2944/2944 co-relation queries the response was YES. [2025-03-04 02:29:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 668 events. 313/668 cut-off events. For 2944/2944 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3508 event pairs, 38 based on Foata normal form. 15/682 useless extension candidates. Maximal degree in co-relation 3165. Up to 173 conditions per place. [2025-03-04 02:29:05,630 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 105 selfloop transitions, 100 changer transitions 0/206 dead transitions. [2025-03-04 02:29:05,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 206 transitions, 2166 flow [2025-03-04 02:29:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:29:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:29:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2025-03-04 02:29:05,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4525 [2025-03-04 02:29:05,632 INFO L175 Difference]: Start difference. First operand has 123 places, 104 transitions, 1053 flow. Second operand 20 states and 181 transitions. [2025-03-04 02:29:05,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 206 transitions, 2166 flow [2025-03-04 02:29:05,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 206 transitions, 1971 flow, removed 58 selfloop flow, removed 17 redundant places. [2025-03-04 02:29:05,644 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 1654 flow [2025-03-04 02:29:05,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1654, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2025-03-04 02:29:05,645 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2025-03-04 02:29:05,645 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 1654 flow [2025-03-04 02:29:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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:29:05,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:05,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:05,651 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:29:05,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:05,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 67466208, now seen corresponding path program 4 times [2025-03-04 02:29:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861890828] [2025-03-04 02:29:05,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:05,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:05,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:05,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:05,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861890828] [2025-03-04 02:29:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861890828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544472932] [2025-03-04 02:29:05,964 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:05,966 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:29:05,967 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:29:06,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:06,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:06,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:06,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:29:06,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:06,144 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:29:06,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2025-03-04 02:29:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:06,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:06,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2025-03-04 02:29:06,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:06,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 298 treesize of output 240 [2025-03-04 02:29:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544472932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:06,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 02:29:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470440952] [2025-03-04 02:29:06,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:06,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:06,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:06,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 1654 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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:29:06,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:06,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:06,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:07,584 INFO L124 PetriNetUnfolderBase]: 373/759 cut-off events. [2025-03-04 02:29:07,584 INFO L125 PetriNetUnfolderBase]: For 3358/3358 co-relation queries the response was YES. [2025-03-04 02:29:07,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 759 events. 373/759 cut-off events. For 3358/3358 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3973 event pairs, 20 based on Foata normal form. 5/763 useless extension candidates. Maximal degree in co-relation 4014. Up to 403 conditions per place. [2025-03-04 02:29:07,590 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 110 selfloop transitions, 69 changer transitions 50/230 dead transitions. [2025-03-04 02:29:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 230 transitions, 2583 flow [2025-03-04 02:29:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:29:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:29:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 216 transitions. [2025-03-04 02:29:07,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:29:07,592 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 1654 flow. Second operand 27 states and 216 transitions. [2025-03-04 02:29:07,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 230 transitions, 2583 flow [2025-03-04 02:29:07,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 230 transitions, 2498 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:07,609 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 1710 flow [2025-03-04 02:29:07,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1710, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-03-04 02:29:07,611 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 133 predicate places. [2025-03-04 02:29:07,611 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 1710 flow [2025-03-04 02:29:07,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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:29:07,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:07,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:07,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:29:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:29:07,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1879618413, now seen corresponding path program 4 times [2025-03-04 02:29:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652997026] [2025-03-04 02:29:07,813 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:07,817 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:07,826 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:07,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652997026] [2025-03-04 02:29:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652997026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940617840] [2025-03-04 02:29:07,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:07,956 INFO L229 MonitoredProcess]: Starting monitored process 10 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:29:07,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:29:08,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:08,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:08,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:08,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:08,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:08,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940617840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:08,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887721900] [2025-03-04 02:29:08,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:08,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:08,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 1710 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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:29:08,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:08,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:08,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:08,522 INFO L124 PetriNetUnfolderBase]: 341/641 cut-off events. [2025-03-04 02:29:08,522 INFO L125 PetriNetUnfolderBase]: For 3709/3709 co-relation queries the response was YES. [2025-03-04 02:29:08,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 641 events. 341/641 cut-off events. For 3709/3709 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2991 event pairs, 45 based on Foata normal form. 18/658 useless extension candidates. Maximal degree in co-relation 3770. Up to 209 conditions per place. [2025-03-04 02:29:08,527 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 105 selfloop transitions, 82 changer transitions 0/188 dead transitions. [2025-03-04 02:29:08,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 2303 flow [2025-03-04 02:29:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:29:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:29:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 143 transitions. [2025-03-04 02:29:08,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-03-04 02:29:08,533 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 1710 flow. Second operand 15 states and 143 transitions. [2025-03-04 02:29:08,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 2303 flow [2025-03-04 02:29:08,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 2090 flow, removed 78 selfloop flow, removed 12 redundant places. [2025-03-04 02:29:08,546 INFO L231 Difference]: Finished difference. Result has 136 places, 148 transitions, 1749 flow [2025-03-04 02:29:08,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1749, PETRI_PLACES=136, PETRI_TRANSITIONS=148} [2025-03-04 02:29:08,546 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 115 predicate places. [2025-03-04 02:29:08,546 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 148 transitions, 1749 flow [2025-03-04 02:29:08,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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:29:08,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:08,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:08,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:29:08,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2129604195, now seen corresponding path program 5 times [2025-03-04 02:29:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832403770] [2025-03-04 02:29:08,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:08,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:08,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:08,764 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:08,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:08,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832403770] [2025-03-04 02:29:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832403770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106362900] [2025-03-04 02:29:08,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:08,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:08,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:08,869 INFO L229 MonitoredProcess]: Starting monitored process 11 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:29:08,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:29:08,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:09,009 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:09,010 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:09,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:09,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:09,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:09,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:09,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106362900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:09,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:09,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:29:09,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823895862] [2025-03-04 02:29:09,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:09,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:29:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:09,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:29:09,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:29:09,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:09,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 148 transitions, 1749 flow. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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:29:09,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:09,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:09,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:09,614 INFO L124 PetriNetUnfolderBase]: 620/1141 cut-off events. [2025-03-04 02:29:09,614 INFO L125 PetriNetUnfolderBase]: For 6390/6390 co-relation queries the response was YES. [2025-03-04 02:29:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6725 conditions, 1141 events. 620/1141 cut-off events. For 6390/6390 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5897 event pairs, 15 based on Foata normal form. 6/1146 useless extension candidates. Maximal degree in co-relation 6663. Up to 263 conditions per place. [2025-03-04 02:29:09,625 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 188 selfloop transitions, 115 changer transitions 1/305 dead transitions. [2025-03-04 02:29:09,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 305 transitions, 4012 flow [2025-03-04 02:29:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:29:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:29:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 171 transitions. [2025-03-04 02:29:09,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-04 02:29:09,627 INFO L175 Difference]: Start difference. First operand has 136 places, 148 transitions, 1749 flow. Second operand 18 states and 171 transitions. [2025-03-04 02:29:09,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 305 transitions, 4012 flow [2025-03-04 02:29:09,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 305 transitions, 3827 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-03-04 02:29:09,655 INFO L231 Difference]: Finished difference. Result has 150 places, 208 transitions, 2718 flow [2025-03-04 02:29:09,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2718, PETRI_PLACES=150, PETRI_TRANSITIONS=208} [2025-03-04 02:29:09,655 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2025-03-04 02:29:09,655 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 208 transitions, 2718 flow [2025-03-04 02:29:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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:29:09,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:09,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:09,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:29:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:29:09,856 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -199675415, now seen corresponding path program 6 times [2025-03-04 02:29:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126394333] [2025-03-04 02:29:09,857 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:09,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:09,871 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:09,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126394333] [2025-03-04 02:29:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126394333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116430645] [2025-03-04 02:29:09,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:09,981 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:09,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:29:10,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:10,073 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:10,073 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:10,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:10,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:10,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:10,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116430645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:10,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:29:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402630432] [2025-03-04 02:29:10,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:29:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:10,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:29:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:29:10,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:10,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 208 transitions, 2718 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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:29:10,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:10,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:10,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:10,803 INFO L124 PetriNetUnfolderBase]: 710/1301 cut-off events. [2025-03-04 02:29:10,803 INFO L125 PetriNetUnfolderBase]: For 10085/10085 co-relation queries the response was YES. [2025-03-04 02:29:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8266 conditions, 1301 events. 710/1301 cut-off events. For 10085/10085 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6825 event pairs, 37 based on Foata normal form. 14/1314 useless extension candidates. Maximal degree in co-relation 8198. Up to 359 conditions per place. [2025-03-04 02:29:10,819 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 152 selfloop transitions, 168 changer transitions 0/321 dead transitions. [2025-03-04 02:29:10,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 321 transitions, 4504 flow [2025-03-04 02:29:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:29:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:29:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 176 transitions. [2025-03-04 02:29:10,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4631578947368421 [2025-03-04 02:29:10,821 INFO L175 Difference]: Start difference. First operand has 150 places, 208 transitions, 2718 flow. Second operand 19 states and 176 transitions. [2025-03-04 02:29:10,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 321 transitions, 4504 flow [2025-03-04 02:29:10,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 321 transitions, 4262 flow, removed 96 selfloop flow, removed 5 redundant places. [2025-03-04 02:29:10,863 INFO L231 Difference]: Finished difference. Result has 170 places, 246 transitions, 3584 flow [2025-03-04 02:29:10,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3584, PETRI_PLACES=170, PETRI_TRANSITIONS=246} [2025-03-04 02:29:10,864 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 149 predicate places. [2025-03-04 02:29:10,864 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 246 transitions, 3584 flow [2025-03-04 02:29:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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:29:10,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:10,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:10,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:29:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:29:11,065 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -276536195, now seen corresponding path program 7 times [2025-03-04 02:29:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648735467] [2025-03-04 02:29:11,066 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:11,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:29:11,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:11,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:11,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:11,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:11,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648735467] [2025-03-04 02:29:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648735467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:11,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436444786] [2025-03-04 02:29:11,203 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:11,207 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29:11,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:29:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:29:11,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:11,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:11,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:11,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436444786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:11,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:29:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495484813] [2025-03-04 02:29:11,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:29:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:11,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:29:11,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:29:11,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:11,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 246 transitions, 3584 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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:29:11,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:11,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:11,844 INFO L124 PetriNetUnfolderBase]: 793/1450 cut-off events. [2025-03-04 02:29:11,844 INFO L125 PetriNetUnfolderBase]: For 15236/15236 co-relation queries the response was YES. [2025-03-04 02:29:11,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10005 conditions, 1450 events. 793/1450 cut-off events. For 15236/15236 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7817 event pairs, 62 based on Foata normal form. 9/1458 useless extension candidates. Maximal degree in co-relation 9933. Up to 512 conditions per place. [2025-03-04 02:29:11,856 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 175 selfloop transitions, 159 changer transitions 0/335 dead transitions. [2025-03-04 02:29:11,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 335 transitions, 5297 flow [2025-03-04 02:29:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:29:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:29:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2025-03-04 02:29:11,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-04 02:29:11,857 INFO L175 Difference]: Start difference. First operand has 170 places, 246 transitions, 3584 flow. Second operand 16 states and 140 transitions. [2025-03-04 02:29:11,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 335 transitions, 5297 flow [2025-03-04 02:29:11,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 335 transitions, 5059 flow, removed 98 selfloop flow, removed 6 redundant places. [2025-03-04 02:29:11,910 INFO L231 Difference]: Finished difference. Result has 186 places, 273 transitions, 4315 flow [2025-03-04 02:29:11,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3404, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4315, PETRI_PLACES=186, PETRI_TRANSITIONS=273} [2025-03-04 02:29:11,911 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 165 predicate places. [2025-03-04 02:29:11,911 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 273 transitions, 4315 flow [2025-03-04 02:29:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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:29:11,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:11,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:11,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:29:12,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:29:12,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -258102169, now seen corresponding path program 8 times [2025-03-04 02:29:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39517960] [2025-03-04 02:29:12,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:12,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:12,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:12,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39517960] [2025-03-04 02:29:12,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39517960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562863806] [2025-03-04 02:29:12,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:12,200 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:12,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:29:12,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:12,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:12,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:12,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:12,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:12,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:12,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562863806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:12,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630300804] [2025-03-04 02:29:12,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:12,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:12,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:12,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:12,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:12,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 273 transitions, 4315 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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:29:12,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:12,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:12,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:12,808 INFO L124 PetriNetUnfolderBase]: 869/1613 cut-off events. [2025-03-04 02:29:12,808 INFO L125 PetriNetUnfolderBase]: For 18428/18428 co-relation queries the response was YES. [2025-03-04 02:29:12,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 1613 events. 869/1613 cut-off events. For 18428/18428 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9074 event pairs, 233 based on Foata normal form. 15/1627 useless extension candidates. Maximal degree in co-relation 11403. Up to 1153 conditions per place. [2025-03-04 02:29:12,819 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 237 selfloop transitions, 113 changer transitions 3/354 dead transitions. [2025-03-04 02:29:12,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 354 transitions, 5946 flow [2025-03-04 02:29:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:29:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:29:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 133 transitions. [2025-03-04 02:29:12,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44333333333333336 [2025-03-04 02:29:12,821 INFO L175 Difference]: Start difference. First operand has 186 places, 273 transitions, 4315 flow. Second operand 15 states and 133 transitions. [2025-03-04 02:29:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 354 transitions, 5946 flow [2025-03-04 02:29:12,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 354 transitions, 5871 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:12,890 INFO L231 Difference]: Finished difference. Result has 201 places, 305 transitions, 5182 flow [2025-03-04 02:29:12,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4223, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5182, PETRI_PLACES=201, PETRI_TRANSITIONS=305} [2025-03-04 02:29:12,890 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 180 predicate places. [2025-03-04 02:29:12,890 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 305 transitions, 5182 flow [2025-03-04 02:29:12,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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:29:12,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:12,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:12,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:13,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:29:13,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -308051378, now seen corresponding path program 5 times [2025-03-04 02:29:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71302589] [2025-03-04 02:29:13,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:13,096 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:13,103 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:13,103 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:13,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71302589] [2025-03-04 02:29:13,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71302589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411543371] [2025-03-04 02:29:13,170 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:13,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:13,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:13,172 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:13,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:29:13,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:13,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:13,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:13,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:29:13,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:13,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411543371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:13,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-03-04 02:29:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735786003] [2025-03-04 02:29:13,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:29:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:29:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:29:13,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:13,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 305 transitions, 5182 flow. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:13,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:13,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:13,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:17,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:29,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:33,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:37,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:41,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:45,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:49,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:53,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:54,036 INFO L124 PetriNetUnfolderBase]: 1034/1908 cut-off events. [2025-03-04 02:29:54,037 INFO L125 PetriNetUnfolderBase]: For 23501/23501 co-relation queries the response was YES. [2025-03-04 02:29:54,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14037 conditions, 1908 events. 1034/1908 cut-off events. For 23501/23501 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11017 event pairs, 74 based on Foata normal form. 54/1961 useless extension candidates. Maximal degree in co-relation 13954. Up to 588 conditions per place. [2025-03-04 02:29:54,050 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 287 selfloop transitions, 127 changer transitions 2/417 dead transitions. [2025-03-04 02:29:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 417 transitions, 7476 flow [2025-03-04 02:29:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:29:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:29:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 140 transitions. [2025-03-04 02:29:54,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:29:54,051 INFO L175 Difference]: Start difference. First operand has 201 places, 305 transitions, 5182 flow. Second operand 14 states and 140 transitions. [2025-03-04 02:29:54,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 417 transitions, 7476 flow [2025-03-04 02:29:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 417 transitions, 7282 flow, removed 77 selfloop flow, removed 8 redundant places. [2025-03-04 02:29:54,131 INFO L231 Difference]: Finished difference. Result has 210 places, 314 transitions, 5570 flow [2025-03-04 02:29:54,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4784, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5570, PETRI_PLACES=210, PETRI_TRANSITIONS=314} [2025-03-04 02:29:54,131 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 189 predicate places. [2025-03-04 02:29:54,131 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 314 transitions, 5570 flow [2025-03-04 02:29:54,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:54,132 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:54,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:29:54,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:54,332 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:54,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1626497579, now seen corresponding path program 2 times [2025-03-04 02:29:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584418083] [2025-03-04 02:29:54,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:54,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:54,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:54,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:54,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584418083] [2025-03-04 02:29:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584418083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995626171] [2025-03-04 02:29:54,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:54,472 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:54,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:29:54,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:54,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:54,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:54,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:54,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995626171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:54,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-03-04 02:29:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199465442] [2025-03-04 02:29:54,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:54,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:29:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:54,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:29:54,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:29:54,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:54,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 314 transitions, 5570 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:54,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:55,173 INFO L124 PetriNetUnfolderBase]: 1020/1851 cut-off events. [2025-03-04 02:29:55,173 INFO L125 PetriNetUnfolderBase]: For 25157/25157 co-relation queries the response was YES. [2025-03-04 02:29:55,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14403 conditions, 1851 events. 1020/1851 cut-off events. For 25157/25157 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10309 event pairs, 170 based on Foata normal form. 19/1869 useless extension candidates. Maximal degree in co-relation 14318. Up to 665 conditions per place. [2025-03-04 02:29:55,190 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 195 selfloop transitions, 154 changer transitions 3/353 dead transitions. [2025-03-04 02:29:55,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 353 transitions, 6622 flow [2025-03-04 02:29:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:29:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:29:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2025-03-04 02:29:55,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.495 [2025-03-04 02:29:55,191 INFO L175 Difference]: Start difference. First operand has 210 places, 314 transitions, 5570 flow. Second operand 10 states and 99 transitions. [2025-03-04 02:29:55,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 353 transitions, 6622 flow [2025-03-04 02:29:55,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 353 transitions, 6235 flow, removed 124 selfloop flow, removed 9 redundant places. [2025-03-04 02:29:55,325 INFO L231 Difference]: Finished difference. Result has 212 places, 315 transitions, 5629 flow [2025-03-04 02:29:55,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5195, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5629, PETRI_PLACES=212, PETRI_TRANSITIONS=315} [2025-03-04 02:29:55,326 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2025-03-04 02:29:55,326 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 315 transitions, 5629 flow [2025-03-04 02:29:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:55,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:55,327 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:55,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:29:55,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:55,527 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 774865558, now seen corresponding path program 6 times [2025-03-04 02:29:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841631956] [2025-03-04 02:29:55,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:55,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:55,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:55,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:55,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841631956] [2025-03-04 02:29:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841631956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493481738] [2025-03-04 02:29:55,616 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:55,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:55,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:55,619 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:55,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:29:55,656 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:55,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:55,692 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:55,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:55,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:29:55,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:55,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493481738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-03-04 02:29:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865064554] [2025-03-04 02:29:55,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:29:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:55,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:29:55,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:29:55,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:55,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 315 transitions, 5629 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:55,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:55,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:55,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:56,409 INFO L124 PetriNetUnfolderBase]: 1015/1835 cut-off events. [2025-03-04 02:29:56,409 INFO L125 PetriNetUnfolderBase]: For 26104/26104 co-relation queries the response was YES. [2025-03-04 02:29:56,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13985 conditions, 1835 events. 1015/1835 cut-off events. For 26104/26104 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10247 event pairs, 55 based on Foata normal form. 2/1836 useless extension candidates. Maximal degree in co-relation 13903. Up to 479 conditions per place. [2025-03-04 02:29:56,426 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 317 selfloop transitions, 148 changer transitions 2/468 dead transitions. [2025-03-04 02:29:56,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 468 transitions, 8826 flow [2025-03-04 02:29:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:29:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:29:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 153 transitions. [2025-03-04 02:29:56,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:29:56,427 INFO L175 Difference]: Start difference. First operand has 212 places, 315 transitions, 5629 flow. Second operand 17 states and 153 transitions. [2025-03-04 02:29:56,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 468 transitions, 8826 flow [2025-03-04 02:29:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 468 transitions, 8607 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-03-04 02:29:56,544 INFO L231 Difference]: Finished difference. Result has 219 places, 321 transitions, 5857 flow [2025-03-04 02:29:56,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5857, PETRI_PLACES=219, PETRI_TRANSITIONS=321} [2025-03-04 02:29:56,545 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 198 predicate places. [2025-03-04 02:29:56,545 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 321 transitions, 5857 flow [2025-03-04 02:29:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:56,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:56,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:56,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:29:56,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:56,746 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -275041784, now seen corresponding path program 7 times [2025-03-04 02:29:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219919616] [2025-03-04 02:29:56,747 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:56,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:29:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219919616] [2025-03-04 02:29:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219919616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198565221] [2025-03-04 02:29:56,843 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:56,846 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:56,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:29:56,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:29:56,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:56,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:56,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:56,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:29:56,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:56,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198565221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:57,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-04 02:29:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859491382] [2025-03-04 02:29:57,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:57,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:29:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:57,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:29:57,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:29:57,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:57,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 321 transitions, 5857 flow. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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:29:57,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:57,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:57,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:57,862 INFO L124 PetriNetUnfolderBase]: 1190/2244 cut-off events. [2025-03-04 02:29:57,862 INFO L125 PetriNetUnfolderBase]: For 31511/31511 co-relation queries the response was YES. [2025-03-04 02:29:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16733 conditions, 2244 events. 1190/2244 cut-off events. For 31511/31511 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13560 event pairs, 201 based on Foata normal form. 15/2258 useless extension candidates. Maximal degree in co-relation 16653. Up to 1141 conditions per place. [2025-03-04 02:29:57,879 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 278 selfloop transitions, 171 changer transitions 2/452 dead transitions. [2025-03-04 02:29:57,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 452 transitions, 8563 flow [2025-03-04 02:29:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:29:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:29:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2025-03-04 02:29:57,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4676470588235294 [2025-03-04 02:29:57,880 INFO L175 Difference]: Start difference. First operand has 219 places, 321 transitions, 5857 flow. Second operand 17 states and 159 transitions. [2025-03-04 02:29:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 452 transitions, 8563 flow [2025-03-04 02:29:57,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 452 transitions, 8361 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-03-04 02:29:57,995 INFO L231 Difference]: Finished difference. Result has 234 places, 382 transitions, 7506 flow [2025-03-04 02:29:57,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5692, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7506, PETRI_PLACES=234, PETRI_TRANSITIONS=382} [2025-03-04 02:29:57,995 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2025-03-04 02:29:57,995 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 382 transitions, 7506 flow [2025-03-04 02:29:57,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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:29:57,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:57,996 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:58,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:58,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1519568056, now seen corresponding path program 8 times [2025-03-04 02:29:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204995591] [2025-03-04 02:29:58,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:58,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:58,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:58,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:58,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204995591] [2025-03-04 02:29:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204995591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100419313] [2025-03-04 02:29:58,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:58,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:58,318 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29:58,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:29:58,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:58,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:58,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:58,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:58,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:29:58,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:58,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100419313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:58,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:58,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-04 02:29:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684944964] [2025-03-04 02:29:58,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:58,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:29:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:29:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:29:58,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:58,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 382 transitions, 7506 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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:29:58,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:58,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:58,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:59,298 INFO L124 PetriNetUnfolderBase]: 1183/2218 cut-off events. [2025-03-04 02:29:59,298 INFO L125 PetriNetUnfolderBase]: For 37151/37151 co-relation queries the response was YES. [2025-03-04 02:29:59,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17840 conditions, 2218 events. 1183/2218 cut-off events. For 37151/37151 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13297 event pairs, 218 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 17753. Up to 923 conditions per place. [2025-03-04 02:29:59,313 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 309 selfloop transitions, 122 changer transitions 2/434 dead transitions. [2025-03-04 02:29:59,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 434 transitions, 9054 flow [2025-03-04 02:29:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:29:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:29:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2025-03-04 02:29:59,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2025-03-04 02:29:59,314 INFO L175 Difference]: Start difference. First operand has 234 places, 382 transitions, 7506 flow. Second operand 12 states and 101 transitions. [2025-03-04 02:29:59,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 434 transitions, 9054 flow [2025-03-04 02:29:59,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 434 transitions, 8874 flow, removed 69 selfloop flow, removed 7 redundant places. [2025-03-04 02:29:59,444 INFO L231 Difference]: Finished difference. Result has 238 places, 381 transitions, 7560 flow [2025-03-04 02:29:59,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7310, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7560, PETRI_PLACES=238, PETRI_TRANSITIONS=381} [2025-03-04 02:29:59,445 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2025-03-04 02:29:59,445 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 381 transitions, 7560 flow [2025-03-04 02:29:59,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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:29:59,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:59,445 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:59,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:59,647 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2057622854, now seen corresponding path program 9 times [2025-03-04 02:29:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414400587] [2025-03-04 02:29:59,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:59,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:59,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:59,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:59,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414400587] [2025-03-04 02:29:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414400587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010056843] [2025-03-04 02:29:59,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:59,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:59,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:59,731 INFO L229 MonitoredProcess]: Starting monitored process 20 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:29:59,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:29:59,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:29:59,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:59,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:59,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:59,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:29:59,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:59,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:00,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010056843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:00,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:30:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587623080] [2025-03-04 02:30:00,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:00,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:00,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:00,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:00,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:00,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 381 transitions, 7560 flow. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:30:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:00,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:00,700 INFO L124 PetriNetUnfolderBase]: 1234/2368 cut-off events. [2025-03-04 02:30:00,700 INFO L125 PetriNetUnfolderBase]: For 38828/38828 co-relation queries the response was YES. [2025-03-04 02:30:00,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18930 conditions, 2368 events. 1234/2368 cut-off events. For 38828/38828 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14818 event pairs, 247 based on Foata normal form. 15/2382 useless extension candidates. Maximal degree in co-relation 18844. Up to 1452 conditions per place. [2025-03-04 02:30:00,717 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 310 selfloop transitions, 160 changer transitions 2/473 dead transitions. [2025-03-04 02:30:00,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 473 transitions, 9648 flow [2025-03-04 02:30:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:30:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:30:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2025-03-04 02:30:00,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2025-03-04 02:30:00,719 INFO L175 Difference]: Start difference. First operand has 238 places, 381 transitions, 7560 flow. Second operand 18 states and 159 transitions. [2025-03-04 02:30:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 473 transitions, 9648 flow [2025-03-04 02:30:00,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 473 transitions, 9498 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-04 02:30:00,842 INFO L231 Difference]: Finished difference. Result has 254 places, 409 transitions, 8540 flow [2025-03-04 02:30:00,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7393, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8540, PETRI_PLACES=254, PETRI_TRANSITIONS=409} [2025-03-04 02:30:00,842 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 233 predicate places. [2025-03-04 02:30:00,842 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 409 transitions, 8540 flow [2025-03-04 02:30:00,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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:30:00,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:00,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:00,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 02:30:01,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:01,043 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:01,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -127115660, now seen corresponding path program 10 times [2025-03-04 02:30:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:01,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951637318] [2025-03-04 02:30:01,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:01,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:01,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:01,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951637318] [2025-03-04 02:30:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951637318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412604882] [2025-03-04 02:30:01,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:01,146 INFO L229 MonitoredProcess]: Starting monitored process 21 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:30:01,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:30:01,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:01,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:01,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:01,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:30:01,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:01,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412604882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:01,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-04 02:30:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398432955] [2025-03-04 02:30:01,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:30:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:30:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:30:01,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:01,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 409 transitions, 8540 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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:30:01,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:01,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:01,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:01,842 INFO L124 PetriNetUnfolderBase]: 1221/2328 cut-off events. [2025-03-04 02:30:01,843 INFO L125 PetriNetUnfolderBase]: For 42374/42374 co-relation queries the response was YES. [2025-03-04 02:30:01,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19813 conditions, 2328 events. 1221/2328 cut-off events. For 42374/42374 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14376 event pairs, 250 based on Foata normal form. 6/2333 useless extension candidates. Maximal degree in co-relation 19723. Up to 1190 conditions per place. [2025-03-04 02:30:01,858 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 350 selfloop transitions, 91 changer transitions 7/449 dead transitions. [2025-03-04 02:30:01,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 449 transitions, 9974 flow [2025-03-04 02:30:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:30:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:30:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2025-03-04 02:30:01,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-03-04 02:30:01,859 INFO L175 Difference]: Start difference. First operand has 254 places, 409 transitions, 8540 flow. Second operand 9 states and 71 transitions. [2025-03-04 02:30:01,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 449 transitions, 9974 flow [2025-03-04 02:30:01,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 449 transitions, 9775 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-04 02:30:02,004 INFO L231 Difference]: Finished difference. Result has 257 places, 403 transitions, 8373 flow [2025-03-04 02:30:02,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8307, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8373, PETRI_PLACES=257, PETRI_TRANSITIONS=403} [2025-03-04 02:30:02,004 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 236 predicate places. [2025-03-04 02:30:02,004 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 403 transitions, 8373 flow [2025-03-04 02:30:02,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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:30:02,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:02,005 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:02,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 02:30:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:30:02,205 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2057423634, now seen corresponding path program 11 times [2025-03-04 02:30:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400674332] [2025-03-04 02:30:02,206 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:02,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:02,213 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:02,213 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:02,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400674332] [2025-03-04 02:30:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400674332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519484389] [2025-03-04 02:30:02,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:02,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:02,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:02,274 INFO L229 MonitoredProcess]: Starting monitored process 22 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:30:02,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:30:02,311 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:02,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:02,341 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:02,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:02,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:30:02,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519484389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:02,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 02:30:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795776774] [2025-03-04 02:30:02,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:02,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:30:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:02,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:30:02,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:30:02,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:02,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 403 transitions, 8373 flow. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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:30:02,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:02,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:02,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:03,022 INFO L124 PetriNetUnfolderBase]: 1216/2308 cut-off events. [2025-03-04 02:30:03,022 INFO L125 PetriNetUnfolderBase]: For 43832/43832 co-relation queries the response was YES. [2025-03-04 02:30:03,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19812 conditions, 2308 events. 1216/2308 cut-off events. For 43832/43832 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14126 event pairs, 250 based on Foata normal form. 2/2309 useless extension candidates. Maximal degree in co-relation 19721. Up to 1193 conditions per place. [2025-03-04 02:30:03,041 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 350 selfloop transitions, 98 changer transitions 2/451 dead transitions. [2025-03-04 02:30:03,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 451 transitions, 9851 flow [2025-03-04 02:30:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:30:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:30:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2025-03-04 02:30:03,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-04 02:30:03,042 INFO L175 Difference]: Start difference. First operand has 257 places, 403 transitions, 8373 flow. Second operand 15 states and 109 transitions. [2025-03-04 02:30:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 451 transitions, 9851 flow [2025-03-04 02:30:03,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 451 transitions, 9786 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:03,208 INFO L231 Difference]: Finished difference. Result has 260 places, 401 transitions, 8463 flow [2025-03-04 02:30:03,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8268, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8463, PETRI_PLACES=260, PETRI_TRANSITIONS=401} [2025-03-04 02:30:03,208 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 239 predicate places. [2025-03-04 02:30:03,208 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 401 transitions, 8463 flow [2025-03-04 02:30:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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:30:03,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:03,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:03,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 02:30:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 02:30:03,409 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:03,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1030384068, now seen corresponding path program 3 times [2025-03-04 02:30:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770266444] [2025-03-04 02:30:03,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:03,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:03,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:03,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:03,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770266444] [2025-03-04 02:30:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770266444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343152029] [2025-03-04 02:30:03,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:30:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:03,579 INFO L229 MonitoredProcess]: Starting monitored process 23 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:30:03,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:30:03,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:03,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:03,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:30:03,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:03,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:30:03,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:03,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343152029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:03,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:03,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-04 02:30:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026248066] [2025-03-04 02:30:03,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:03,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:30:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:03,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:30:03,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:30:03,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:03,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 401 transitions, 8463 flow. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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:30:03,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:03,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:03,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:08,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:30:12,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:30:13,167 INFO L124 PetriNetUnfolderBase]: 1506/2872 cut-off events. [2025-03-04 02:30:13,167 INFO L125 PetriNetUnfolderBase]: For 59805/59805 co-relation queries the response was YES. [2025-03-04 02:30:13,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25160 conditions, 2872 events. 1506/2872 cut-off events. For 59805/59805 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18496 event pairs, 118 based on Foata normal form. 12/2883 useless extension candidates. Maximal degree in co-relation 25071. Up to 774 conditions per place. [2025-03-04 02:30:13,188 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 349 selfloop transitions, 271 changer transitions 10/631 dead transitions. [2025-03-04 02:30:13,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 631 transitions, 13687 flow [2025-03-04 02:30:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:30:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:30:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 205 transitions. [2025-03-04 02:30:13,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41 [2025-03-04 02:30:13,189 INFO L175 Difference]: Start difference. First operand has 260 places, 401 transitions, 8463 flow. Second operand 25 states and 205 transitions. [2025-03-04 02:30:13,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 631 transitions, 13687 flow [2025-03-04 02:30:13,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 631 transitions, 13252 flow, removed 81 selfloop flow, removed 14 redundant places. [2025-03-04 02:30:13,361 INFO L231 Difference]: Finished difference. Result has 275 places, 472 transitions, 10275 flow [2025-03-04 02:30:13,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8033, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=10275, PETRI_PLACES=275, PETRI_TRANSITIONS=472} [2025-03-04 02:30:13,361 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 254 predicate places. [2025-03-04 02:30:13,361 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 472 transitions, 10275 flow [2025-03-04 02:30:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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:30:13,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:13,362 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 02:30:13,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:30:13,562 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:13,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 978017025, now seen corresponding path program 4 times [2025-03-04 02:30:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587657797] [2025-03-04 02:30:13,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:13,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:13,590 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:13,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:13,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587657797] [2025-03-04 02:30:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587657797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078557911] [2025-03-04 02:30:14,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:14,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:14,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:14,205 INFO L229 MonitoredProcess]: Starting monitored process 24 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:30:14,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:30:14,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:14,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:14,256 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:14,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:30:14,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:14,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:30:14,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-04 02:30:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:14,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:14,714 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-04 02:30:14,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-03-04 02:30:14,785 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-04 02:30:14,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2025-03-04 02:30:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078557911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:14,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 25 [2025-03-04 02:30:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341137203] [2025-03-04 02:30:14,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:14,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:30:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:14,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:30:14,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:30:14,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 472 transitions, 10275 flow. Second operand has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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:30:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:16,298 INFO L124 PetriNetUnfolderBase]: 1583/3003 cut-off events. [2025-03-04 02:30:16,299 INFO L125 PetriNetUnfolderBase]: For 64416/64416 co-relation queries the response was YES. [2025-03-04 02:30:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27339 conditions, 3003 events. 1583/3003 cut-off events. For 64416/64416 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19295 event pairs, 91 based on Foata normal form. 2/3003 useless extension candidates. Maximal degree in co-relation 27169. Up to 2630 conditions per place. [2025-03-04 02:30:16,329 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 464 selfloop transitions, 108 changer transitions 6/579 dead transitions. [2025-03-04 02:30:16,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 579 transitions, 12899 flow [2025-03-04 02:30:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:30:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:30:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 204 transitions. [2025-03-04 02:30:16,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:30:16,331 INFO L175 Difference]: Start difference. First operand has 275 places, 472 transitions, 10275 flow. Second operand 24 states and 204 transitions. [2025-03-04 02:30:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 579 transitions, 12899 flow [2025-03-04 02:30:16,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 579 transitions, 11930 flow, removed 216 selfloop flow, removed 14 redundant places. [2025-03-04 02:30:16,569 INFO L231 Difference]: Finished difference. Result has 286 places, 517 transitions, 10668 flow [2025-03-04 02:30:16,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=9456, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=10668, PETRI_PLACES=286, PETRI_TRANSITIONS=517} [2025-03-04 02:30:16,569 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 265 predicate places. [2025-03-04 02:30:16,569 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 517 transitions, 10668 flow [2025-03-04 02:30:16,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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:30:16,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:16,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:16,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 02:30:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:16,770 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1425831679, now seen corresponding path program 5 times [2025-03-04 02:30:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52076616] [2025-03-04 02:30:16,771 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:16,775 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:16,786 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:16,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52076616] [2025-03-04 02:30:17,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52076616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699377929] [2025-03-04 02:30:17,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:17,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:17,052 INFO L229 MonitoredProcess]: Starting monitored process 25 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:30:17,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 02:30:17,090 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:17,105 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:17,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:17,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:30:17,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:17,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:30:17,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-04 02:30:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:17,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:17,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:30:17,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 152 [2025-03-04 02:30:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699377929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:17,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2025-03-04 02:30:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638875714] [2025-03-04 02:30:17,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:30:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:30:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:30:17,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:17,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 517 transitions, 10668 flow. Second operand has 26 states, 26 states have (on average 4.730769230769231) internal successors, (123), 26 states have internal predecessors, (123), 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:30:17,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:17,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:17,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:19,031 INFO L124 PetriNetUnfolderBase]: 1595/3027 cut-off events. [2025-03-04 02:30:19,031 INFO L125 PetriNetUnfolderBase]: For 58675/58675 co-relation queries the response was YES. [2025-03-04 02:30:19,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26520 conditions, 3027 events. 1595/3027 cut-off events. For 58675/58675 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19549 event pairs, 88 based on Foata normal form. 6/3031 useless extension candidates. Maximal degree in co-relation 26358. Up to 2540 conditions per place. [2025-03-04 02:30:19,059 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 448 selfloop transitions, 125 changer transitions 8/582 dead transitions. [2025-03-04 02:30:19,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 582 transitions, 12627 flow [2025-03-04 02:30:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:30:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:30:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 146 transitions. [2025-03-04 02:30:19,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45625 [2025-03-04 02:30:19,060 INFO L175 Difference]: Start difference. First operand has 286 places, 517 transitions, 10668 flow. Second operand 16 states and 146 transitions. [2025-03-04 02:30:19,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 582 transitions, 12627 flow [2025-03-04 02:30:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 582 transitions, 12395 flow, removed 106 selfloop flow, removed 5 redundant places. [2025-03-04 02:30:19,353 INFO L231 Difference]: Finished difference. Result has 302 places, 535 transitions, 11241 flow [2025-03-04 02:30:19,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=10466, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11241, PETRI_PLACES=302, PETRI_TRANSITIONS=535} [2025-03-04 02:30:19,353 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2025-03-04 02:30:19,353 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 535 transitions, 11241 flow [2025-03-04 02:30:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.730769230769231) internal successors, (123), 26 states have internal predecessors, (123), 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:30:19,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:19,354 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:19,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 02:30:19,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 02:30:19,554 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1054877805, now seen corresponding path program 6 times [2025-03-04 02:30:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:19,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504789427] [2025-03-04 02:30:19,555 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:30:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:19,559 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:30:19,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:30:19,573 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:30:19,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat