./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.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 d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:27:06,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:27:06,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:27:06,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:27:06,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:27:06,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:27:06,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:27:06,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:27:06,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:27:06,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:27:06,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:27:06,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:27:06,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:27:06,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:27:06,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:27:06,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:27:06,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:27:06,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:27:06,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:06,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:27:06,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:27:06,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:27:06,247 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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 [2025-03-04 02:27:06,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:27:06,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:27:06,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:27:06,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:27:06,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:27:06,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-04 02:27:07,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d189c052c/a01fd0a2767543a0ae6e414eb55cd3e7/FLAG811d1488e [2025-03-04 02:27:07,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:27:07,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-04 02:27:07,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d189c052c/a01fd0a2767543a0ae6e414eb55cd3e7/FLAG811d1488e [2025-03-04 02:27:07,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d189c052c/a01fd0a2767543a0ae6e414eb55cd3e7 [2025-03-04 02:27:07,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:27:07,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:27:07,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:07,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:27:07,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:27:07,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:07" (1/1) ... [2025-03-04 02:27:07,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bfd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:07, skipping insertion in model container [2025-03-04 02:27:07,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:07" (1/1) ... [2025-03-04 02:27:07,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:27:08,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-04 02:27:08,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:08,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:27:08,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-03-04 02:27:08,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:08,110 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:27:08,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08 WrapperNode [2025-03-04 02:27:08,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:08,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:08,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:27:08,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:27:08,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,136 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 134 [2025-03-04 02:27:08,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:08,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:27:08,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:27:08,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:27:08,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,163 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:27:08,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:27:08,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:27:08,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:27:08,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:27:08,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (1/1) ... [2025-03-04 02:27:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:08,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:27:08,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:27:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:27:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:27:08,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:27:08,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:27:08,218 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:27:08,287 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:27:08,289 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:27:08,516 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:27:08,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:27:08,674 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:27:08,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:27:08,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:08 BoogieIcfgContainer [2025-03-04 02:27:08,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:27:08,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:27:08,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:27:08,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:27:08,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:27:07" (1/3) ... [2025-03-04 02:27:08,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f530281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:08, skipping insertion in model container [2025-03-04 02:27:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:08" (2/3) ... [2025-03-04 02:27:08,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f530281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:08, skipping insertion in model container [2025-03-04 02:27:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:08" (3/3) ... [2025-03-04 02:27:08,684 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-03-04 02:27:08,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:27:08,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:27:08,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:27:08,749 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:27:08,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 78 flow [2025-03-04 02:27:08,805 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2025-03-04 02:27:08,806 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:08,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-04 02:27:08,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 78 flow [2025-03-04 02:27:08,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 70 flow [2025-03-04 02:27:08,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:27:08,827 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;@1e20a974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:27:08,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:27:08,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:27:08,840 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-04 02:27:08,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:27:08,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:08,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:08,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 751023947, now seen corresponding path program 1 times [2025-03-04 02:27:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839715012] [2025-03-04 02:27:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:08,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:27:08,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:27:08,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:09,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839715012] [2025-03-04 02:27:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839715012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:09,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:09,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622450629] [2025-03-04 02:27:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:27:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:27:09,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:27:09,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:09,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:09,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,137 INFO L124 PetriNetUnfolderBase]: 158/290 cut-off events. [2025-03-04 02:27:09,137 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 02:27:09,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 290 events. 158/290 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1057 event pairs, 116 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 513. Up to 253 conditions per place. [2025-03-04 02:27:09,145 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-03-04 02:27:09,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 110 flow [2025-03-04 02:27:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:27:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:27:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2025-03-04 02:27:09,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 02:27:09,157 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2025-03-04 02:27:09,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 110 flow [2025-03-04 02:27:09,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:09,163 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 58 flow [2025-03-04 02:27:09,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-03-04 02:27:09,168 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-03-04 02:27:09,170 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 58 flow [2025-03-04 02:27:09,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,170 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-04 02:27:09,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:27:09,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -608041511, now seen corresponding path program 1 times [2025-03-04 02:27:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008791958] [2025-03-04 02:27:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:27:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:27:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008791958] [2025-03-04 02:27:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008791958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320342979] [2025-03-04 02:27:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:09,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:09,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:09,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:09,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,381 INFO L124 PetriNetUnfolderBase]: 256/457 cut-off events. [2025-03-04 02:27:09,381 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 02:27:09,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 457 events. 256/457 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1868 event pairs, 96 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 893. Up to 228 conditions per place. [2025-03-04 02:27:09,386 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 34 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2025-03-04 02:27:09,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 44 transitions, 173 flow [2025-03-04 02:27:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 02:27:09,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-03-04 02:27:09,389 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 58 flow. Second operand 3 states and 61 transitions. [2025-03-04 02:27:09,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 44 transitions, 173 flow [2025-03-04 02:27:09,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:09,392 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 70 flow [2025-03-04 02:27:09,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2025-03-04 02:27:09,392 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-03-04 02:27:09,392 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 70 flow [2025-03-04 02:27:09,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,394 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-04 02:27:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:27:09,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1415089255, now seen corresponding path program 1 times [2025-03-04 02:27:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699031499] [2025-03-04 02:27:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:09,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699031499] [2025-03-04 02:27:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699031499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:27:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275351684] [2025-03-04 02:27:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:09,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:09,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:09,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:09,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,614 INFO L124 PetriNetUnfolderBase]: 287/534 cut-off events. [2025-03-04 02:27:09,614 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 02:27:09,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 534 events. 287/534 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2147 event pairs, 126 based on Foata normal form. 14/459 useless extension candidates. Maximal degree in co-relation 1051. Up to 318 conditions per place. [2025-03-04 02:27:09,617 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 27 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2025-03-04 02:27:09,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 170 flow [2025-03-04 02:27:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-04 02:27:09,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 02:27:09,618 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 70 flow. Second operand 3 states and 57 transitions. [2025-03-04 02:27:09,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 170 flow [2025-03-04 02:27:09,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:09,619 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 87 flow [2025-03-04 02:27:09,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-04 02:27:09,620 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-03-04 02:27:09,620 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 87 flow [2025-03-04 02:27:09,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,620 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, 1] [2025-03-04 02:27:09,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:27:09,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2118032949, now seen corresponding path program 1 times [2025-03-04 02:27:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005925167] [2025-03-04 02:27:09,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:27:09,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:27:09,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005925167] [2025-03-04 02:27:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005925167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:09,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:09,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694581347] [2025-03-04 02:27:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:09,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:09,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:09,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:09,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:09,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:09,897 INFO L124 PetriNetUnfolderBase]: 355/668 cut-off events. [2025-03-04 02:27:09,897 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-04 02:27:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 668 events. 355/668 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2884 event pairs, 289 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 1416. Up to 480 conditions per place. [2025-03-04 02:27:09,902 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 2 changer transitions 15/46 dead transitions. [2025-03-04 02:27:09,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 205 flow [2025-03-04 02:27:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 02:27:09,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-03-04 02:27:09,903 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 87 flow. Second operand 4 states and 67 transitions. [2025-03-04 02:27:09,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 205 flow [2025-03-04 02:27:09,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:09,905 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 98 flow [2025-03-04 02:27:09,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-03-04 02:27:09,905 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-03-04 02:27:09,905 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 98 flow [2025-03-04 02:27:09,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:09,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:09,906 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, 1, 1] [2025-03-04 02:27:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:27:09,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:09,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 931827086, now seen corresponding path program 1 times [2025-03-04 02:27:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925308605] [2025-03-04 02:27:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:09,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:27:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:10,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925308605] [2025-03-04 02:27:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925308605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891213484] [2025-03-04 02:27:10,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:10,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:10,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:27:10,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:27:10,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:10,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:10,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:10,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 02:27:10,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:10,627 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 23 treesize of output 1 [2025-03-04 02:27:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:10,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:11,241 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 61 treesize of output 55 [2025-03-04 02:27:11,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:11,258 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 78 treesize of output 68 [2025-03-04 02:27:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891213484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:11,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 02:27:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894702308] [2025-03-04 02:27:11,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:27:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:11,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:27:11,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:27:11,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:11,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 98 flow. Second operand has 19 states, 19 states have (on average 10.31578947368421) internal successors, (196), 19 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:11,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:11,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:11,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:12,412 INFO L124 PetriNetUnfolderBase]: 1327/2516 cut-off events. [2025-03-04 02:27:12,413 INFO L125 PetriNetUnfolderBase]: For 532/532 co-relation queries the response was YES. [2025-03-04 02:27:12,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 2516 events. 1327/2516 cut-off events. For 532/532 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15168 event pairs, 322 based on Foata normal form. 3/2240 useless extension candidates. Maximal degree in co-relation 5373. Up to 501 conditions per place. [2025-03-04 02:27:12,428 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 122 selfloop transitions, 33 changer transitions 49/209 dead transitions. [2025-03-04 02:27:12,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 209 transitions, 997 flow [2025-03-04 02:27:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:27:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:27:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 328 transitions. [2025-03-04 02:27:12,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-04 02:27:12,430 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 98 flow. Second operand 18 states and 328 transitions. [2025-03-04 02:27:12,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 209 transitions, 997 flow [2025-03-04 02:27:12,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 209 transitions, 971 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:12,436 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 364 flow [2025-03-04 02:27:12,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2025-03-04 02:27:12,437 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2025-03-04 02:27:12,437 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 364 flow [2025-03-04 02:27:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.31578947368421) internal successors, (196), 19 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:12,438 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, 1, 1] [2025-03-04 02:27:12,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:12,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:12,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:12,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 132865454, now seen corresponding path program 1 times [2025-03-04 02:27:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799532438] [2025-03-04 02:27:12,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:12,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:27:12,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:27:12,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:12,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799532438] [2025-03-04 02:27:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799532438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939731531] [2025-03-04 02:27:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:12,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:27:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:12,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:27:12,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:27:12,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-03-04 02:27:12,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:12,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-03-04 02:27:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:12,933 INFO L124 PetriNetUnfolderBase]: 1592/2828 cut-off events. [2025-03-04 02:27:12,935 INFO L125 PetriNetUnfolderBase]: For 2951/2951 co-relation queries the response was YES. [2025-03-04 02:27:12,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7307 conditions, 2828 events. 1592/2828 cut-off events. For 2951/2951 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16096 event pairs, 886 based on Foata normal form. 44/2675 useless extension candidates. Maximal degree in co-relation 7291. Up to 2031 conditions per place. [2025-03-04 02:27:12,952 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 65 selfloop transitions, 2 changer transitions 3/73 dead transitions. [2025-03-04 02:27:12,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 528 flow [2025-03-04 02:27:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:27:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:27:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 02:27:12,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:27:12,954 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 364 flow. Second operand 3 states and 54 transitions. [2025-03-04 02:27:12,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 528 flow [2025-03-04 02:27:12,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 481 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:12,972 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 268 flow [2025-03-04 02:27:12,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-04 02:27:12,973 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2025-03-04 02:27:12,974 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 268 flow [2025-03-04 02:27:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:12,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:12,974 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, 1, 1] [2025-03-04 02:27:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:27:12,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:12,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash 82914128, now seen corresponding path program 2 times [2025-03-04 02:27:12,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:12,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932544467] [2025-03-04 02:27:12,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:12,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:12,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:12,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:12,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932544467] [2025-03-04 02:27:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932544467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75119832] [2025-03-04 02:27:13,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:13,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:13,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:13,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:27:13,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:27:13,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:27:13,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:13,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:13,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:27:13,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:13,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75119832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:13,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-04 02:27:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575741144] [2025-03-04 02:27:13,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:27:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:27:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:27:13,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:13,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 268 flow. Second operand has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:13,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:13,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:13,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:13,824 INFO L124 PetriNetUnfolderBase]: 1136/2184 cut-off events. [2025-03-04 02:27:13,824 INFO L125 PetriNetUnfolderBase]: For 2338/2338 co-relation queries the response was YES. [2025-03-04 02:27:13,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 2184 events. 1136/2184 cut-off events. For 2338/2338 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13033 event pairs, 652 based on Foata normal form. 26/2059 useless extension candidates. Maximal degree in co-relation 5601. Up to 1171 conditions per place. [2025-03-04 02:27:13,834 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 3 changer transitions 60/102 dead transitions. [2025-03-04 02:27:13,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 590 flow [2025-03-04 02:27:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:27:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:27:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2025-03-04 02:27:13,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-03-04 02:27:13,835 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 268 flow. Second operand 9 states and 145 transitions. [2025-03-04 02:27:13,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 590 flow [2025-03-04 02:27:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 575 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:13,843 INFO L231 Difference]: Finished difference. Result has 68 places, 42 transitions, 198 flow [2025-03-04 02:27:13,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=68, PETRI_TRANSITIONS=42} [2025-03-04 02:27:13,844 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-03-04 02:27:13,844 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 198 flow [2025-03-04 02:27:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:13,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:13,844 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:13,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:14,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:27:14,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:14,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1958607337, now seen corresponding path program 3 times [2025-03-04 02:27:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:14,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422184061] [2025-03-04 02:27:14,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:14,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-03-04 02:27:14,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 02:27:14,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:27:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:27:14,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422184061] [2025-03-04 02:27:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422184061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:14,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174344081] [2025-03-04 02:27:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:27:14,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:14,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:27:14,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:27:14,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:14,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 42 transitions, 198 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-04 02:27:14,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:14,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:14,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:14,341 INFO L124 PetriNetUnfolderBase]: 782/1457 cut-off events. [2025-03-04 02:27:14,341 INFO L125 PetriNetUnfolderBase]: For 2532/2536 co-relation queries the response was YES. [2025-03-04 02:27:14,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 1457 events. 782/1457 cut-off events. For 2532/2536 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7649 event pairs, 246 based on Foata normal form. 1/1355 useless extension candidates. Maximal degree in co-relation 4027. Up to 486 conditions per place. [2025-03-04 02:27:14,347 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 8 changer transitions 10/80 dead transitions. [2025-03-04 02:27:14,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 498 flow [2025-03-04 02:27:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:27:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:27:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-04 02:27:14,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-03-04 02:27:14,348 INFO L175 Difference]: Start difference. First operand has 68 places, 42 transitions, 198 flow. Second operand 5 states and 98 transitions. [2025-03-04 02:27:14,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 498 flow [2025-03-04 02:27:14,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 422 flow, removed 35 selfloop flow, removed 11 redundant places. [2025-03-04 02:27:14,354 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 198 flow [2025-03-04 02:27:14,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-03-04 02:27:14,355 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-04 02:27:14,355 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 198 flow [2025-03-04 02:27:14,355 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-04 02:27:14,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:14,355 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:27:14,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:14,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash -400422933, now seen corresponding path program 4 times [2025-03-04 02:27:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:14,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147090472] [2025-03-04 02:27:14,356 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:14,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:27:14,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:14,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147090472] [2025-03-04 02:27:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147090472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923828039] [2025-03-04 02:27:14,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:14,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:14,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:27:14,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:27:14,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:14,474 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:27:14,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:14,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923828039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:14,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:14,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-03-04 02:27:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700479201] [2025-03-04 02:27:14,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:14,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:27:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:14,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:27:14,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:27:14,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:14,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:14,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:14,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:14,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:14,793 INFO L124 PetriNetUnfolderBase]: 1433/2730 cut-off events. [2025-03-04 02:27:14,794 INFO L125 PetriNetUnfolderBase]: For 1885/1885 co-relation queries the response was YES. [2025-03-04 02:27:14,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6555 conditions, 2730 events. 1433/2730 cut-off events. For 1885/1885 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15526 event pairs, 561 based on Foata normal form. 30/2584 useless extension candidates. Maximal degree in co-relation 6543. Up to 882 conditions per place. [2025-03-04 02:27:14,805 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 57 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2025-03-04 02:27:14,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 477 flow [2025-03-04 02:27:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 02:27:14,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 02:27:14,807 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 198 flow. Second operand 4 states and 80 transitions. [2025-03-04 02:27:14,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 477 flow [2025-03-04 02:27:14,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 455 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:14,811 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 312 flow [2025-03-04 02:27:14,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-04 02:27:14,811 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-03-04 02:27:14,811 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 312 flow [2025-03-04 02:27:14,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:14,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:14,812 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:14,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:15,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 421275287, now seen corresponding path program 5 times [2025-03-04 02:27:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979602649] [2025-03-04 02:27:15,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:15,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:27:15,045 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:15,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:27:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:27:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979602649] [2025-03-04 02:27:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979602649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:27:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847079828] [2025-03-04 02:27:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:15,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2025-03-04 02:27:15,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:15,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:15,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2025-03-04 02:27:15,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:15,442 INFO L124 PetriNetUnfolderBase]: 2506/4353 cut-off events. [2025-03-04 02:27:15,443 INFO L125 PetriNetUnfolderBase]: For 4168/4168 co-relation queries the response was YES. [2025-03-04 02:27:15,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11498 conditions, 4353 events. 2506/4353 cut-off events. For 4168/4168 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23493 event pairs, 437 based on Foata normal form. 220/4244 useless extension candidates. Maximal degree in co-relation 11484. Up to 2213 conditions per place. [2025-03-04 02:27:15,460 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 72 selfloop transitions, 4 changer transitions 3/81 dead transitions. [2025-03-04 02:27:15,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 645 flow [2025-03-04 02:27:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-04 02:27:15,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2025-03-04 02:27:15,461 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 312 flow. Second operand 4 states and 63 transitions. [2025-03-04 02:27:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 645 flow [2025-03-04 02:27:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 633 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:15,465 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 327 flow [2025-03-04 02:27:15,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-04 02:27:15,466 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-03-04 02:27:15,466 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 327 flow [2025-03-04 02:27:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:15,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:15,466 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, 1, 1, 1, 1] [2025-03-04 02:27:15,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:27:15,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1697821155, now seen corresponding path program 1 times [2025-03-04 02:27:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549627350] [2025-03-04 02:27:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 02:27:15,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:15,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:15,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549627350] [2025-03-04 02:27:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549627350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587262595] [2025-03-04 02:27:16,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:16,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:16,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:16,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:16,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:27:16,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 02:27:16,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:16,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:16,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:16,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:27:16,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:16,394 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 23 treesize of output 1 [2025-03-04 02:27:16,719 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-04 02:27:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-03-04 02:27:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:16,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:17,473 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 116 treesize of output 104 [2025-03-04 02:27:17,503 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-03-04 02:27:17,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 196 [2025-03-04 02:27:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587262595] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:18,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 02:27:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232456907] [2025-03-04 02:27:18,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 02:27:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:18,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 02:27:18,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2025-03-04 02:27:18,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:18,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 327 flow. Second operand has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:18,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:18,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:18,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:20,878 INFO L124 PetriNetUnfolderBase]: 5110/9692 cut-off events. [2025-03-04 02:27:20,878 INFO L125 PetriNetUnfolderBase]: For 11827/11831 co-relation queries the response was YES. [2025-03-04 02:27:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26052 conditions, 9692 events. 5110/9692 cut-off events. For 11827/11831 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 66608 event pairs, 1199 based on Foata normal form. 62/9073 useless extension candidates. Maximal degree in co-relation 26035. Up to 2144 conditions per place. [2025-03-04 02:27:20,920 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 242 selfloop transitions, 80 changer transitions 63/392 dead transitions. [2025-03-04 02:27:20,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 392 transitions, 2443 flow [2025-03-04 02:27:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:27:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:27:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 585 transitions. [2025-03-04 02:27:20,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5539772727272727 [2025-03-04 02:27:20,923 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 327 flow. Second operand 33 states and 585 transitions. [2025-03-04 02:27:20,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 392 transitions, 2443 flow [2025-03-04 02:27:20,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 392 transitions, 2437 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:20,938 INFO L231 Difference]: Finished difference. Result has 106 places, 131 transitions, 1308 flow [2025-03-04 02:27:20,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1308, PETRI_PLACES=106, PETRI_TRANSITIONS=131} [2025-03-04 02:27:20,939 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2025-03-04 02:27:20,940 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 131 transitions, 1308 flow [2025-03-04 02:27:20,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.612903225806452) internal successors, (298), 31 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:20,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:20,941 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, 1, 1, 1, 1] [2025-03-04 02:27:20,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:27:21,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:21,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:21,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1068804843, now seen corresponding path program 2 times [2025-03-04 02:27:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235346706] [2025-03-04 02:27:21,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:21,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 02:27:21,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:21,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:21,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235346706] [2025-03-04 02:27:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235346706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747349446] [2025-03-04 02:27:21,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:21,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:21,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:27:21,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 02:27:21,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:21,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:21,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:21,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:27:21,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:22,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:22,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:22,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-04 02:27:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747349446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:22,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-04 02:27:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045043059] [2025-03-04 02:27:22,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:27:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:22,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:27:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:27:22,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:22,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 131 transitions, 1308 flow. Second operand has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:22,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:22,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:22,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:25,201 INFO L124 PetriNetUnfolderBase]: 9117/17295 cut-off events. [2025-03-04 02:27:25,202 INFO L125 PetriNetUnfolderBase]: For 90087/90095 co-relation queries the response was YES. [2025-03-04 02:27:25,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58560 conditions, 17295 events. 9117/17295 cut-off events. For 90087/90095 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 134106 event pairs, 2573 based on Foata normal form. 41/16163 useless extension candidates. Maximal degree in co-relation 58526. Up to 5340 conditions per place. [2025-03-04 02:27:25,287 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 234 selfloop transitions, 65 changer transitions 182/488 dead transitions. [2025-03-04 02:27:25,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 488 transitions, 4320 flow [2025-03-04 02:27:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:27:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:27:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 550 transitions. [2025-03-04 02:27:25,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-04 02:27:25,289 INFO L175 Difference]: Start difference. First operand has 106 places, 131 transitions, 1308 flow. Second operand 30 states and 550 transitions. [2025-03-04 02:27:25,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 488 transitions, 4320 flow [2025-03-04 02:27:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 488 transitions, 3872 flow, removed 217 selfloop flow, removed 5 redundant places. [2025-03-04 02:27:25,369 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1333 flow [2025-03-04 02:27:25,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1333, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2025-03-04 02:27:25,372 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2025-03-04 02:27:25,372 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1333 flow [2025-03-04 02:27:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.89655172413793) internal successors, (287), 29 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:25,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:25,372 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, 1, 1, 1, 1] [2025-03-04 02:27:25,379 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-04 02:27:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:27:25,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1070163123, now seen corresponding path program 3 times [2025-03-04 02:27:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371274664] [2025-03-04 02:27:25,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:25,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:27:25,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:25,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:27:25,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371274664] [2025-03-04 02:27:26,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371274664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222002414] [2025-03-04 02:27:26,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:26,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:26,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:27:26,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-04 02:27:26,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:26,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:27:26,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:26,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:27:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:26,519 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 23 treesize of output 1 [2025-03-04 02:27:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:26,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:27,669 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 116 treesize of output 104 [2025-03-04 02:27:27,714 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-04 02:27:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 196 [2025-03-04 02:27:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222002414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:28,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-04 02:27:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849214284] [2025-03-04 02:27:28,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:27:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:27:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:27:28,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:28,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1333 flow. Second operand has 28 states, 28 states have (on average 10.0) internal successors, (280), 28 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:28,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:28,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:33,786 INFO L124 PetriNetUnfolderBase]: 15506/29271 cut-off events. [2025-03-04 02:27:33,787 INFO L125 PetriNetUnfolderBase]: For 222282/222282 co-relation queries the response was YES. [2025-03-04 02:27:33,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108732 conditions, 29271 events. 15506/29271 cut-off events. For 222282/222282 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 238713 event pairs, 3024 based on Foata normal form. 75/27369 useless extension candidates. Maximal degree in co-relation 108685. Up to 4890 conditions per place. [2025-03-04 02:27:34,023 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 338 selfloop transitions, 200 changer transitions 104/649 dead transitions. [2025-03-04 02:27:34,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 649 transitions, 6709 flow [2025-03-04 02:27:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 02:27:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 02:27:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 706 transitions. [2025-03-04 02:27:34,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962837837837838 [2025-03-04 02:27:34,028 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1333 flow. Second operand 37 states and 706 transitions. [2025-03-04 02:27:34,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 649 transitions, 6709 flow [2025-03-04 02:27:34,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 649 transitions, 5720 flow, removed 475 selfloop flow, removed 20 redundant places. [2025-03-04 02:27:34,524 INFO L231 Difference]: Finished difference. Result has 167 places, 291 transitions, 3834 flow [2025-03-04 02:27:34,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3834, PETRI_PLACES=167, PETRI_TRANSITIONS=291} [2025-03-04 02:27:34,524 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2025-03-04 02:27:34,524 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 291 transitions, 3834 flow [2025-03-04 02:27:34,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 28 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:34,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:34,525 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:34,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:27:34,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:34,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:34,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash 957261298, now seen corresponding path program 4 times [2025-03-04 02:27:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:34,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527625794] [2025-03-04 02:27:34,726 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:34,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:34,736 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 02:27:34,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:27:34,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:34,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527625794] [2025-03-04 02:27:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527625794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838615901] [2025-03-04 02:27:34,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:34,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:34,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:34,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:27:34,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 02:27:35,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:27:35,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:35,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:35,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:27:35,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:35,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:35,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:35,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-04 02:27:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838615901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:35,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 17 [2025-03-04 02:27:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167781173] [2025-03-04 02:27:35,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:27:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:35,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:27:35,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:27:35,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:35,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 291 transitions, 3834 flow. Second operand has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:35,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:35,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:35,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:40,137 INFO L124 PetriNetUnfolderBase]: 18018/34188 cut-off events. [2025-03-04 02:27:40,137 INFO L125 PetriNetUnfolderBase]: For 439917/439917 co-relation queries the response was YES. [2025-03-04 02:27:40,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142624 conditions, 34188 events. 18018/34188 cut-off events. For 439917/439917 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 274207 event pairs, 4209 based on Foata normal form. 147/32050 useless extension candidates. Maximal degree in co-relation 142563. Up to 12874 conditions per place. [2025-03-04 02:27:40,437 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 302 selfloop transitions, 149 changer transitions 56/514 dead transitions. [2025-03-04 02:27:40,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 514 transitions, 7582 flow [2025-03-04 02:27:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:27:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:27:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 308 transitions. [2025-03-04 02:27:40,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2025-03-04 02:27:40,439 INFO L175 Difference]: Start difference. First operand has 167 places, 291 transitions, 3834 flow. Second operand 16 states and 308 transitions. [2025-03-04 02:27:40,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 514 transitions, 7582 flow [2025-03-04 02:27:41,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 514 transitions, 5664 flow, removed 929 selfloop flow, removed 16 redundant places. [2025-03-04 02:27:41,543 INFO L231 Difference]: Finished difference. Result has 174 places, 324 transitions, 4083 flow [2025-03-04 02:27:41,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4083, PETRI_PLACES=174, PETRI_TRANSITIONS=324} [2025-03-04 02:27:41,544 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2025-03-04 02:27:41,544 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 324 transitions, 4083 flow [2025-03-04 02:27:41,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.555555555555555) internal successors, (208), 18 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:41,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:41,544 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:41,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:41,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:41,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 365105596, now seen corresponding path program 5 times [2025-03-04 02:27:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360055633] [2025-03-04 02:27:41,746 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:41,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 02:27:41,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:27:41,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:27:41,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360055633] [2025-03-04 02:27:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360055633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156159948] [2025-03-04 02:27:42,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:42,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:42,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:42,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:42,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:27:42,432 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 02:27:42,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:27:42,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:27:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:27:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:42,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:42,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:27:42,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-03-04 02:27:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:27:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156159948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:43,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 29 [2025-03-04 02:27:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233910371] [2025-03-04 02:27:43,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:27:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:43,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:27:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-04 02:27:43,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:27:43,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 324 transitions, 4083 flow. Second operand has 30 states, 30 states have (on average 10.4) internal successors, (312), 30 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:43,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:43,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:27:43,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:58,041 INFO L124 PetriNetUnfolderBase]: 45150/86043 cut-off events. [2025-03-04 02:27:58,042 INFO L125 PetriNetUnfolderBase]: For 1040186/1040186 co-relation queries the response was YES. [2025-03-04 02:27:58,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339322 conditions, 86043 events. 45150/86043 cut-off events. For 1040186/1040186 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 796169 event pairs, 7229 based on Foata normal form. 707/80989 useless extension candidates. Maximal degree in co-relation 339254. Up to 14385 conditions per place. [2025-03-04 02:27:59,077 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 558 selfloop transitions, 737 changer transitions 367/1669 dead transitions. [2025-03-04 02:27:59,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1669 transitions, 20845 flow [2025-03-04 02:27:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 02:27:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 02:27:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 1335 transitions. [2025-03-04 02:27:59,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959821428571429 [2025-03-04 02:27:59,081 INFO L175 Difference]: Start difference. First operand has 174 places, 324 transitions, 4083 flow. Second operand 70 states and 1335 transitions. [2025-03-04 02:27:59,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1669 transitions, 20845 flow [2025-03-04 02:28:01,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 1669 transitions, 19455 flow, removed 693 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:02,004 INFO L231 Difference]: Finished difference. Result has 284 places, 889 transitions, 14578 flow [2025-03-04 02:28:02,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3731, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=14578, PETRI_PLACES=284, PETRI_TRANSITIONS=889} [2025-03-04 02:28:02,004 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2025-03-04 02:28:02,004 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 889 transitions, 14578 flow [2025-03-04 02:28:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.4) internal successors, (312), 30 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:02,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:02,005 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:02,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:28:02,205 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,SelfDestructingSolverStorable14 [2025-03-04 02:28:02,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1175434026, now seen corresponding path program 6 times [2025-03-04 02:28:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546295274] [2025-03-04 02:28:02,206 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:02,213 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-04 02:28:02,229 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:28:02,230 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546295274] [2025-03-04 02:28:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546295274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97015123] [2025-03-04 02:28:02,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:02,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:02,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:02,980 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:02,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:28:03,024 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-03-04 02:28:03,047 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:28:03,047 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:28:03,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:03,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:28:03,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:03,123 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 23 treesize of output 1 [2025-03-04 02:28:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:03,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:04,291 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 171 treesize of output 153 [2025-03-04 02:28:04,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:28:04,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 530 treesize of output 434 [2025-03-04 02:28:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97015123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:06,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-04 02:28:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135924566] [2025-03-04 02:28:06,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:06,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 02:28:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:06,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 02:28:06,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 02:28:06,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 02:28:06,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 889 transitions, 14578 flow. Second operand has 40 states, 40 states have (on average 9.55) internal successors, (382), 40 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:28:06,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:06,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 02:28:06,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand