./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-context1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:46:38,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:46:38,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:46:38,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:46:38,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:46:38,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:46:38,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:46:38,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:46:38,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:46:38,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:46:38,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:46:38,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:46:38,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:46:38,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:46:38,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:46:38,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:46:38,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:46:38,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:46:38,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:38,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:46:38,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:46:38,793 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-03-17 06:46:39,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:46:39,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:46:39,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:46:39,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:46:39,034 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:46:39,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-17 06:46:40,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14033724/2937befa865e4742b5dcc34466904634/FLAGace3132ba [2025-03-17 06:46:40,343 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:46:40,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-17 06:46:40,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14033724/2937befa865e4742b5dcc34466904634/FLAGace3132ba [2025-03-17 06:46:40,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14033724/2937befa865e4742b5dcc34466904634 [2025-03-17 06:46:40,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:46:40,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:46:40,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:40,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:46:40,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:46:40,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538ff698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40, skipping insertion in model container [2025-03-17 06:46:40,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:46:40,839 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/test-context1.wvr.c[2459,2472] [2025-03-17 06:46:40,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:40,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:46:40,872 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/test-context1.wvr.c[2459,2472] [2025-03-17 06:46:40,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:46:40,889 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:46:40,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40 WrapperNode [2025-03-17 06:46:40,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:46:40,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:40,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:46:40,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:46:40,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,919 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-03-17 06:46:40,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:46:40,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:46:40,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:46:40,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:46:40,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,951 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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-17 06:46:40,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:46:40,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:46:40,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:46:40,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:46:40,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (1/1) ... [2025-03-17 06:46:40,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:46:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:40,985 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-17 06:46:40,987 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-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:46:41,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:46:41,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:46:41,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:46:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:46:41,003 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:46:41,073 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:46:41,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:46:41,245 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:46:41,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:46:41,389 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:46:41,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:46:41,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:41 BoogieIcfgContainer [2025-03-17 06:46:41,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:46:41,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:46:41,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:46:41,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:46:41,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:46:40" (1/3) ... [2025-03-17 06:46:41,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9f635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:41, skipping insertion in model container [2025-03-17 06:46:41,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:46:40" (2/3) ... [2025-03-17 06:46:41,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9f635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:46:41, skipping insertion in model container [2025-03-17 06:46:41,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:46:41" (3/3) ... [2025-03-17 06:46:41,398 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-03-17 06:46:41,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:46:41,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-17 06:46:41,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:46:41,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:46:41,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-03-17 06:46:41,509 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-17 06:46:41,513 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:46:41,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-17 06:46:41,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-03-17 06:46:41,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-03-17 06:46:41,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:46:41,538 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;@548a71fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:46:41,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 06:46:41,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:46:41,552 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-03-17 06:46:41,552 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:46:41,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:41,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:41,553 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-17 06:46:41,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -217712492, now seen corresponding path program 1 times [2025-03-17 06:46:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012866852] [2025-03-17 06:46:41,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:41,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:46:41,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:46:41,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:41,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:41,689 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-17 06:46:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012866852] [2025-03-17 06:46:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012866852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:46:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133651065] [2025-03-17 06:46:41,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:41,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:46:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:46:41,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:46:41,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:41,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-17 06:46:41,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:41,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:41,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:41,793 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-03-17 06:46:41,793 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 06:46:41,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 706 event pairs, 94 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-03-17 06:46:41,798 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-03-17 06:46:41,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-03-17 06:46:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:46:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 06:46:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-03-17 06:46:41,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-17 06:46:41,809 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-03-17 06:46:41,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-03-17 06:46:41,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 06:46:41,814 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-03-17 06:46:41,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-03-17 06:46:41,818 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-03-17 06:46:41,818 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-03-17 06:46:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-17 06:46:41,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:41,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:41,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:46:41,819 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-17 06:46:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -734864719, now seen corresponding path program 1 times [2025-03-17 06:46:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81779627] [2025-03-17 06:46:41,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:41,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:46:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:46:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:41,950 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-17 06:46:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81779627] [2025-03-17 06:46:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81779627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:46:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146359881] [2025-03-17 06:46:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:46:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:41,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:46:41,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:46:41,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:41,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 06:46:41,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:41,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:41,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:42,044 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-03-17 06:46:42,045 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 06:46:42,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1261 event pairs, 82 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-03-17 06:46:42,047 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-03-17 06:46:42,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-03-17 06:46:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:46:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:46:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-17 06:46:42,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-17 06:46:42,048 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-03-17 06:46:42,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-03-17 06:46:42,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:42,050 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-03-17 06:46:42,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-17 06:46:42,051 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-17 06:46:42,051 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-03-17 06:46:42,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 06:46:42,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:42,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:42,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:46:42,051 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-17 06:46:42,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1845090846, now seen corresponding path program 1 times [2025-03-17 06:46:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567834913] [2025-03-17 06:46:42,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:42,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 06:46:42,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 06:46:42,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:42,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:42,148 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-17 06:46:42,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567834913] [2025-03-17 06:46:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567834913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:42,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:46:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130700046] [2025-03-17 06:46:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:46:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:42,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:46:42,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:46:42,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:42,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 06:46:42,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:42,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:42,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:42,222 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-03-17 06:46:42,222 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-17 06:46:42,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1675 event pairs, 113 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-03-17 06:46:42,224 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-03-17 06:46:42,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-03-17 06:46:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:46:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:46:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-17 06:46:42,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-17 06:46:42,225 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-03-17 06:46:42,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-03-17 06:46:42,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:42,226 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-03-17 06:46:42,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-17 06:46:42,227 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-03-17 06:46:42,227 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-03-17 06:46:42,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 06:46:42,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:42,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:46:42,227 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-17 06:46:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 418410670, now seen corresponding path program 1 times [2025-03-17 06:46:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773687041] [2025-03-17 06:46:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:42,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 06:46:42,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 06:46:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:42,372 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-17 06:46:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773687041] [2025-03-17 06:46:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773687041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:42,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:42,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504518795] [2025-03-17 06:46:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:42,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:42,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:42,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:42,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:42,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-17 06:46:42,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:42,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:42,480 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-03-17 06:46:42,481 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-17 06:46:42,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2459 event pairs, 285 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-03-17 06:46:42,485 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-03-17 06:46:42,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-03-17 06:46:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-17 06:46:42,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-17 06:46:42,486 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-03-17 06:46:42,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-03-17 06:46:42,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:46:42,487 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-03-17 06:46:42,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-03-17 06:46:42,488 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-17 06:46:42,488 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-03-17 06:46:42,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-17 06:46:42,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:42,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:46:42,488 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-17 06:46:42,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1752251909, now seen corresponding path program 1 times [2025-03-17 06:46:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877504770] [2025-03-17 06:46:42,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:46:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:46:42,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:46:42,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:42,732 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-17 06:46:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877504770] [2025-03-17 06:46:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877504770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:46:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998564599] [2025-03-17 06:46:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:42,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:46:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:42,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:46:42,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:46:42,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:42,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 06:46:42,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:42,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:42,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:42,938 INFO L124 PetriNetUnfolderBase]: 331/583 cut-off events. [2025-03-17 06:46:42,938 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-17 06:46:42,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 583 events. 331/583 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2176 event pairs, 68 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1281. Up to 157 conditions per place. [2025-03-17 06:46:42,943 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 44 selfloop transitions, 5 changer transitions 12/64 dead transitions. [2025-03-17 06:46:42,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 295 flow [2025-03-17 06:46:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:46:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:46:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-17 06:46:42,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-17 06:46:42,944 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 6 states and 91 transitions. [2025-03-17 06:46:42,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 295 flow [2025-03-17 06:46:42,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 289 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 06:46:42,946 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 98 flow [2025-03-17 06:46:42,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-17 06:46:42,946 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2025-03-17 06:46:42,946 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 98 flow [2025-03-17 06:46:42,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 06:46:42,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:42,946 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:46:42,947 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-17 06:46:42,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash -526005896, now seen corresponding path program 2 times [2025-03-17 06:46:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868022673] [2025-03-17 06:46:42,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:42,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 06:46:42,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 06:46:42,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:42,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868022673] [2025-03-17 06:46:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868022673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:46:43,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:46:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:46:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565476528] [2025-03-17 06:46:43,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:46:43,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:46:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:43,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:46:43,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:46:43,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:43,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:43,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:43,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:43,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:43,126 INFO L124 PetriNetUnfolderBase]: 719/1265 cut-off events. [2025-03-17 06:46:43,126 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-17 06:46:43,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1265 events. 719/1265 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5621 event pairs, 280 based on Foata normal form. 22/1090 useless extension candidates. Maximal degree in co-relation 2837. Up to 462 conditions per place. [2025-03-17 06:46:43,131 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-17 06:46:43,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 312 flow [2025-03-17 06:46:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:46:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:46:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-03-17 06:46:43,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-17 06:46:43,132 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 98 flow. Second operand 4 states and 72 transitions. [2025-03-17 06:46:43,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 312 flow [2025-03-17 06:46:43,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 06:46:43,134 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 152 flow [2025-03-17 06:46:43,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-17 06:46:43,134 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-03-17 06:46:43,135 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 152 flow [2025-03-17 06:46:43,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:46:43,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:43,135 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:46:43,135 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-17 06:46:43,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1477515784, now seen corresponding path program 3 times [2025-03-17 06:46:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858452669] [2025-03-17 06:46:43,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:43,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:46:43,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:46:43,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:43,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858452669] [2025-03-17 06:46:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858452669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128081813] [2025-03-17 06:46:43,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:43,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:43,284 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-17 06:46:43,286 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-17 06:46:43,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-17 06:46:43,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 06:46:43,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:46:43,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:43,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:46:43,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:43,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:46:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128081813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:43,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 06:46:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937762727] [2025-03-17 06:46:43,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:43,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:46:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:43,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:46:43,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:46:43,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:43,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-17 06:46:43,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:43,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:43,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:43,987 INFO L124 PetriNetUnfolderBase]: 1255/2228 cut-off events. [2025-03-17 06:46:43,988 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-03-17 06:46:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2228 events. 1255/2228 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11613 event pairs, 404 based on Foata normal form. 33/1909 useless extension candidates. Maximal degree in co-relation 5321. Up to 1122 conditions per place. [2025-03-17 06:46:43,997 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 65/105 dead transitions. [2025-03-17 06:46:43,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 574 flow [2025-03-17 06:46:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:46:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:46:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-03-17 06:46:44,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-17 06:46:44,000 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 152 flow. Second operand 9 states and 138 transitions. [2025-03-17 06:46:44,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 574 flow [2025-03-17 06:46:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 564 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:44,003 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 180 flow [2025-03-17 06:46:44,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-17 06:46:44,004 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-03-17 06:46:44,004 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 180 flow [2025-03-17 06:46:44,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-17 06:46:44,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:44,004 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:44,011 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-17 06:46:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:44,209 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-17 06:46:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 580815253, now seen corresponding path program 4 times [2025-03-17 06:46:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643858054] [2025-03-17 06:46:44,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:44,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 06:46:44,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:46:44,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:46:44,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:46:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643858054] [2025-03-17 06:46:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643858054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:44,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520527591] [2025-03-17 06:46:44,409 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:46:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:44,411 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-17 06:46:44,413 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-17 06:46:44,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-17 06:46:44,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:46:44,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:46:44,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:44,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 06:46:44,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:46:44,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:44,775 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:46:44,775 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 28 treesize of output 11 [2025-03-17 06:46:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:46:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520527591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:44,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:44,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-03-17 06:46:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764360579] [2025-03-17 06:46:44,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:44,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:46:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:44,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:46:44,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:46:44,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:44,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 180 flow. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-17 06:46:44,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:44,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:44,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:45,632 INFO L124 PetriNetUnfolderBase]: 1998/3447 cut-off events. [2025-03-17 06:46:45,632 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2025-03-17 06:46:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 3447 events. 1998/3447 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 18236 event pairs, 104 based on Foata normal form. 24/2935 useless extension candidates. Maximal degree in co-relation 8723. Up to 625 conditions per place. [2025-03-17 06:46:45,644 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 139 selfloop transitions, 37 changer transitions 90/269 dead transitions. [2025-03-17 06:46:45,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 269 transitions, 1452 flow [2025-03-17 06:46:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 06:46:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 06:46:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 381 transitions. [2025-03-17 06:46:45,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185064935064936 [2025-03-17 06:46:45,646 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 180 flow. Second operand 22 states and 381 transitions. [2025-03-17 06:46:45,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 269 transitions, 1452 flow [2025-03-17 06:46:45,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 269 transitions, 1422 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-17 06:46:45,657 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 604 flow [2025-03-17 06:46:45,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=604, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-03-17 06:46:45,658 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 45 predicate places. [2025-03-17 06:46:45,658 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 604 flow [2025-03-17 06:46:45,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-17 06:46:45,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:45,659 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:45,665 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-17 06:46:45,859 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,SelfDestructingSolverStorable7 [2025-03-17 06:46:45,860 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-17 06:46:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 669385594, now seen corresponding path program 5 times [2025-03-17 06:46:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961797423] [2025-03-17 06:46:45,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:45,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-17 06:46:45,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 06:46:45,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 06:46:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 06:46:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961797423] [2025-03-17 06:46:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961797423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683176130] [2025-03-17 06:46:46,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:46:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:46,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:46,011 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-17 06:46:46,012 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-17 06:46:46,051 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-17 06:46:46,076 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 06:46:46,076 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 06:46:46,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:46,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:46:46,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 06:46:46,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 06:46:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683176130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:46,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:46,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-17 06:46:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035157362] [2025-03-17 06:46:46,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:46,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 06:46:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:46,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 06:46:46,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:46:46,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:46,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 604 flow. Second operand has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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-17 06:46:46,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:46,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:46,898 INFO L124 PetriNetUnfolderBase]: 2573/4505 cut-off events. [2025-03-17 06:46:46,898 INFO L125 PetriNetUnfolderBase]: For 7404/7404 co-relation queries the response was YES. [2025-03-17 06:46:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 4505 events. 2573/4505 cut-off events. For 7404/7404 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 26431 event pairs, 1832 based on Foata normal form. 52/3848 useless extension candidates. Maximal degree in co-relation 11866. Up to 3442 conditions per place. [2025-03-17 06:46:46,915 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 59 selfloop transitions, 4 changer transitions 81/147 dead transitions. [2025-03-17 06:46:46,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 147 transitions, 1149 flow [2025-03-17 06:46:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:46:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:46:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-03-17 06:46:46,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-17 06:46:46,916 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 604 flow. Second operand 11 states and 161 transitions. [2025-03-17 06:46:46,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 147 transitions, 1149 flow [2025-03-17 06:46:46,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 895 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-03-17 06:46:46,937 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 416 flow [2025-03-17 06:46:46,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-17 06:46:46,937 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-03-17 06:46:46,939 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 416 flow [2025-03-17 06:46:46,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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-17 06:46:46,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:46,939 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:46,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:47,140 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-17 06:46:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -708795319, now seen corresponding path program 6 times [2025-03-17 06:46:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793439821] [2025-03-17 06:46:47,141 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:46:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:47,149 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-17 06:46:47,172 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:46:47,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 06:46:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:46:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793439821] [2025-03-17 06:46:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793439821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637985255] [2025-03-17 06:46:47,468 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:46:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:47,470 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-17 06:46:47,472 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-17 06:46:47,515 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-03-17 06:46:47,536 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:46:47,537 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 06:46:47,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:47,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 06:46:47,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:47,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:47,675 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:46:47,675 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 28 treesize of output 11 [2025-03-17 06:46:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 06:46:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637985255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:47,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-03-17 06:46:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614975743] [2025-03-17 06:46:47,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:46:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:47,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:46:47,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:46:47,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:47,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 416 flow. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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-17 06:46:47,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:47,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:47,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:48,819 INFO L124 PetriNetUnfolderBase]: 3206/5541 cut-off events. [2025-03-17 06:46:48,820 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2025-03-17 06:46:48,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 5541 events. 3206/5541 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32067 event pairs, 510 based on Foata normal form. 3/4686 useless extension candidates. Maximal degree in co-relation 13164. Up to 1000 conditions per place. [2025-03-17 06:46:48,841 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 144 selfloop transitions, 60 changer transitions 90/297 dead transitions. [2025-03-17 06:46:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 297 transitions, 1649 flow [2025-03-17 06:46:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:46:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 06:46:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 375 transitions. [2025-03-17 06:46:48,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822981366459627 [2025-03-17 06:46:48,843 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 416 flow. Second operand 23 states and 375 transitions. [2025-03-17 06:46:48,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 297 transitions, 1649 flow [2025-03-17 06:46:48,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 1593 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-17 06:46:48,857 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 688 flow [2025-03-17 06:46:48,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=688, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-17 06:46:48,857 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2025-03-17 06:46:48,857 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 688 flow [2025-03-17 06:46:48,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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-17 06:46:48,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:48,858 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:48,864 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-17 06:46:49,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:49,062 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-17 06:46:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -602796691, now seen corresponding path program 7 times [2025-03-17 06:46:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496267077] [2025-03-17 06:46:49,063 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:46:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:49,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 06:46:49,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 06:46:49,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:49,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 06:46:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496267077] [2025-03-17 06:46:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496267077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916419772] [2025-03-17 06:46:49,156 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:46:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:49,158 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-17 06:46:49,159 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-17 06:46:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 06:46:49,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 06:46:49,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:46:49,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:49,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:46:49,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 06:46:49,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 06:46:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916419772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:49,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:49,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 06:46:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330056840] [2025-03-17 06:46:49,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:46:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:49,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:46:49,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:46:49,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:49,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-17 06:46:49,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:49,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:49,915 INFO L124 PetriNetUnfolderBase]: 5593/9636 cut-off events. [2025-03-17 06:46:49,915 INFO L125 PetriNetUnfolderBase]: For 8502/8502 co-relation queries the response was YES. [2025-03-17 06:46:49,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23745 conditions, 9636 events. 5593/9636 cut-off events. For 8502/8502 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 60242 event pairs, 1470 based on Foata normal form. 33/8175 useless extension candidates. Maximal degree in co-relation 23716. Up to 2498 conditions per place. [2025-03-17 06:46:49,945 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 104 selfloop transitions, 81 changer transitions 0/188 dead transitions. [2025-03-17 06:46:49,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1677 flow [2025-03-17 06:46:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:46:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:46:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-17 06:46:49,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-17 06:46:49,947 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 688 flow. Second operand 6 states and 114 transitions. [2025-03-17 06:46:49,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1677 flow [2025-03-17 06:46:49,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 188 transitions, 1610 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-17 06:46:49,978 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1356 flow [2025-03-17 06:46:49,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1356, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2025-03-17 06:46:49,978 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2025-03-17 06:46:49,978 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1356 flow [2025-03-17 06:46:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-17 06:46:49,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:49,978 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:49,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:46:50,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 06:46:50,179 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-17 06:46:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -622175800, now seen corresponding path program 8 times [2025-03-17 06:46:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670297750] [2025-03-17 06:46:50,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:50,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 06:46:50,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:46:50,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 06:46:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670297750] [2025-03-17 06:46:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670297750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833072629] [2025-03-17 06:46:50,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:46:50,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:50,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:50,375 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-17 06:46:50,377 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-17 06:46:50,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 06:46:50,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 06:46:50,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:46:50,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:50,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 06:46:50,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 06:46:50,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 06:46:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833072629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:50,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-17 06:46:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455542534] [2025-03-17 06:46:50,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 06:46:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:50,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 06:46:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:46:50,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:50,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1356 flow. Second operand has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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-17 06:46:50,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:50,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:50,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:46:52,427 INFO L124 PetriNetUnfolderBase]: 11029/19216 cut-off events. [2025-03-17 06:46:52,427 INFO L125 PetriNetUnfolderBase]: For 29938/29938 co-relation queries the response was YES. [2025-03-17 06:46:52,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49586 conditions, 19216 events. 11029/19216 cut-off events. For 29938/29938 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 141365 event pairs, 3417 based on Foata normal form. 451/16621 useless extension candidates. Maximal degree in co-relation 49553. Up to 7523 conditions per place. [2025-03-17 06:46:52,501 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 108 selfloop transitions, 6 changer transitions 187/304 dead transitions. [2025-03-17 06:46:52,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 304 transitions, 3086 flow [2025-03-17 06:46:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:46:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 06:46:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2025-03-17 06:46:52,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2025-03-17 06:46:52,504 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1356 flow. Second operand 13 states and 186 transitions. [2025-03-17 06:46:52,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 304 transitions, 3086 flow [2025-03-17 06:46:52,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 304 transitions, 3064 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-17 06:46:52,639 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 1273 flow [2025-03-17 06:46:52,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1273, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-03-17 06:46:52,640 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2025-03-17 06:46:52,640 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 1273 flow [2025-03-17 06:46:52,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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-17 06:46:52,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:46:52,641 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:46:52,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 06:46:52,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:52,842 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-17 06:46:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:46:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1132565483, now seen corresponding path program 9 times [2025-03-17 06:46:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:46:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357012746] [2025-03-17 06:46:52,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:46:52,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-17 06:46:52,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 06:46:52,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 06:46:52,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 06:46:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:46:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357012746] [2025-03-17 06:46:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357012746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:46:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635539528] [2025-03-17 06:46:53,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:46:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:46:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:46:53,324 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-17 06:46:53,326 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-17 06:46:53,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-03-17 06:46:53,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 06:46:53,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 06:46:53,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:46:53,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:46:53,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:46:53,499 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 19 treesize of output 1 [2025-03-17 06:46:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 06:46:53,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:46:54,406 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 42 treesize of output 38 [2025-03-17 06:46:54,414 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:46:54,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 45 [2025-03-17 06:46:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 06:46:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635539528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:46:54,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:46:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-17 06:46:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378214904] [2025-03-17 06:46:54,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:46:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 06:46:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:46:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 06:46:54,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-03-17 06:46:54,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:46:54,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 1273 flow. Second operand has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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-17 06:46:54,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:46:54,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:46:54,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:00,219 INFO L124 PetriNetUnfolderBase]: 29067/49753 cut-off events. [2025-03-17 06:47:00,220 INFO L125 PetriNetUnfolderBase]: For 121731/121731 co-relation queries the response was YES. [2025-03-17 06:47:00,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140880 conditions, 49753 events. 29067/49753 cut-off events. For 121731/121731 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 392734 event pairs, 6995 based on Foata normal form. 36/42060 useless extension candidates. Maximal degree in co-relation 140842. Up to 9175 conditions per place. [2025-03-17 06:47:00,564 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 557 selfloop transitions, 297 changer transitions 120/977 dead transitions. [2025-03-17 06:47:00,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 977 transitions, 11113 flow [2025-03-17 06:47:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 06:47:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-17 06:47:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 615 transitions. [2025-03-17 06:47:00,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5936293436293436 [2025-03-17 06:47:00,567 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 1273 flow. Second operand 37 states and 615 transitions. [2025-03-17 06:47:00,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 977 transitions, 11113 flow [2025-03-17 06:47:01,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 977 transitions, 8581 flow, removed 788 selfloop flow, removed 19 redundant places. [2025-03-17 06:47:01,482 INFO L231 Difference]: Finished difference. Result has 139 places, 434 transitions, 5580 flow [2025-03-17 06:47:01,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5580, PETRI_PLACES=139, PETRI_TRANSITIONS=434} [2025-03-17 06:47:01,484 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 112 predicate places. [2025-03-17 06:47:01,484 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 434 transitions, 5580 flow [2025-03-17 06:47:01,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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-17 06:47:01,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:01,484 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:01,490 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-17 06:47:01,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:47:01,685 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-17 06:47:01,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2106891364, now seen corresponding path program 10 times [2025-03-17 06:47:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841235538] [2025-03-17 06:47:01,686 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:47:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:01,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-17 06:47:01,702 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 06:47:01,702 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:47:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 06:47:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841235538] [2025-03-17 06:47:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841235538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:47:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755421343] [2025-03-17 06:47:01,962 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:47:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:47:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:47:01,964 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-17 06:47:01,965 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-17 06:47:02,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-17 06:47:02,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 06:47:02,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:47:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 06:47:02,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:47:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:47:02,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:47:02,375 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:47:02,376 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 28 treesize of output 11 [2025-03-17 06:47:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 06:47:02,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755421343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:47:02,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:47:02,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 10] total 30 [2025-03-17 06:47:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430261654] [2025-03-17 06:47:02,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:47:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 06:47:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:02,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 06:47:02,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2025-03-17 06:47:02,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:47:02,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 434 transitions, 5580 flow. Second operand has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 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-17 06:47:02,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:02,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:47:02,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:16,597 INFO L124 PetriNetUnfolderBase]: 70999/121141 cut-off events. [2025-03-17 06:47:16,597 INFO L125 PetriNetUnfolderBase]: For 381889/381889 co-relation queries the response was YES. [2025-03-17 06:47:17,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354449 conditions, 121141 events. 70999/121141 cut-off events. For 381889/381889 co-relation queries the response was YES. Maximal size of possible extension queue 2145. Compared 1062370 event pairs, 4076 based on Foata normal form. 140/102521 useless extension candidates. Maximal degree in co-relation 354400. Up to 22300 conditions per place. [2025-03-17 06:47:17,662 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 498 selfloop transitions, 973 changer transitions 171/1645 dead transitions. [2025-03-17 06:47:17,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1645 transitions, 19663 flow [2025-03-17 06:47:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-17 06:47:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-17 06:47:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 1051 transitions. [2025-03-17 06:47:17,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6361985472154964 [2025-03-17 06:47:17,665 INFO L175 Difference]: Start difference. First operand has 139 places, 434 transitions, 5580 flow. Second operand 59 states and 1051 transitions. [2025-03-17 06:47:17,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1645 transitions, 19663 flow [2025-03-17 06:47:21,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1645 transitions, 18411 flow, removed 622 selfloop flow, removed 4 redundant places. [2025-03-17 06:47:21,590 INFO L231 Difference]: Finished difference. Result has 222 places, 1039 transitions, 16851 flow [2025-03-17 06:47:21,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5230, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=16851, PETRI_PLACES=222, PETRI_TRANSITIONS=1039} [2025-03-17 06:47:21,591 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 195 predicate places. [2025-03-17 06:47:21,591 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 1039 transitions, 16851 flow [2025-03-17 06:47:21,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 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-17 06:47:21,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:21,591 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:21,598 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-17 06:47:21,792 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,SelfDestructingSolverStorable13 [2025-03-17 06:47:21,792 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-17 06:47:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 379670, now seen corresponding path program 11 times [2025-03-17 06:47:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765561713] [2025-03-17 06:47:21,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:47:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:21,799 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-03-17 06:47:21,820 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 06:47:21,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 06:47:21,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:47:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765561713] [2025-03-17 06:47:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765561713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:47:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177143371] [2025-03-17 06:47:22,231 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:47:22,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:47:22,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:47:22,234 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-17 06:47:22,235 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-17 06:47:22,278 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-03-17 06:47:22,310 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 06:47:22,310 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 06:47:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:22,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 06:47:22,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:47:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 06:47:22,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:47:22,606 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:47:22,606 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 28 treesize of output 11 [2025-03-17 06:47:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 06:47:22,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177143371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:47:22,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:47:22,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 29 [2025-03-17 06:47:22,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450385360] [2025-03-17 06:47:22,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:47:22,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 06:47:22,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:22,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 06:47:22,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-17 06:47:22,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-17 06:47:22,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1039 transitions, 16851 flow. Second operand has 30 states, 30 states have (on average 8.566666666666666) internal successors, (257), 30 states have internal predecessors, (257), 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-17 06:47:22,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:22,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-17 06:47:22,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand