./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.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-commit-1.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:22:33,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:22:33,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:22:33,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:22:33,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:22:33,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:22:33,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:22:33,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:22:33,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:22:33,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:22:33,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:22:33,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:22:33,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:22:33,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:22:33,204 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:22:33,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:22:33,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:22:33,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:22:33,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:33,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:22:33,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:22:33,208 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-03-04 02:22:33,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:22:33,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:22:33,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:22:33,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:22:33,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:22:33,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-04 02:22:34,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a94639e/0a388d4e2e9f4b7995c9a2ab78a28055/FLAG474ed6484 [2025-03-04 02:22:34,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:22:34,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-04 02:22:34,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a94639e/0a388d4e2e9f4b7995c9a2ab78a28055/FLAG474ed6484 [2025-03-04 02:22:35,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a94639e/0a388d4e2e9f4b7995c9a2ab78a28055 [2025-03-04 02:22:35,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:22:35,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:22:35,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:35,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:22:35,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:22:35,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d89f267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35, skipping insertion in model container [2025-03-04 02:22:35,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:22:35,264 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-commit-1.wvr.c[4643,4656] [2025-03-04 02:22:35,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:35,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:22:35,300 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-commit-1.wvr.c[4643,4656] [2025-03-04 02:22:35,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:35,315 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:22:35,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35 WrapperNode [2025-03-04 02:22:35,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:35,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:35,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:22:35,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:22:35,324 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:22:35" (1/1) ... [2025-03-04 02:22:35,332 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:22:35" (1/1) ... [2025-03-04 02:22:35,363 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-03-04 02:22:35,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:35,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:22:35,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:22:35,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:22:35,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,399 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 02:22:35,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:22:35,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:22:35,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:22:35,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:22:35,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (1/1) ... [2025-03-04 02:22:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:35,446 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:22:35,452 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:22:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:22:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:22:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:22:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:22:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:22:35,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:22:35,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:22:35,470 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:22:35,559 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:22:35,560 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:22:35,956 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:22:35,956 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:22:36,195 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:22:36,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:22:36,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:36 BoogieIcfgContainer [2025-03-04 02:22:36,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:22:36,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:22:36,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:22:36,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:22:36,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:22:35" (1/3) ... [2025-03-04 02:22:36,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13091f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:36, skipping insertion in model container [2025-03-04 02:22:36,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:35" (2/3) ... [2025-03-04 02:22:36,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13091f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:36, skipping insertion in model container [2025-03-04 02:22:36,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:36" (3/3) ... [2025-03-04 02:22:36,203 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-03-04 02:22:36,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:22:36,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:22:36,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:22:36,272 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:22:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 117 flow [2025-03-04 02:22:36,323 INFO L124 PetriNetUnfolderBase]: 9/45 cut-off events. [2025-03-04 02:22:36,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:22:36,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 9/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-04 02:22:36,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 117 flow [2025-03-04 02:22:36,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-03-04 02:22:36,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:22:36,350 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;@62148088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:22:36,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:22:36,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:22:36,365 INFO L124 PetriNetUnfolderBase]: 9/43 cut-off events. [2025-03-04 02:22:36,365 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:22:36,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:36,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:36,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:36,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash -569557458, now seen corresponding path program 1 times [2025-03-04 02:22:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766133963] [2025-03-04 02:22:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:36,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:22:36,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:22:36,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:36,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:36,612 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:22:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766133963] [2025-03-04 02:22:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766133963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533280336] [2025-03-04 02:22:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:36,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:22:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:22:36,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:22:36,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:36,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:22:36,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:36,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:36,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:37,066 INFO L124 PetriNetUnfolderBase]: 2548/3637 cut-off events. [2025-03-04 02:22:37,066 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-03-04 02:22:37,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3637 events. 2548/3637 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16654 event pairs, 2146 based on Foata normal form. 0/3229 useless extension candidates. Maximal degree in co-relation 7063. Up to 3626 conditions per place. [2025-03-04 02:22:37,096 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2025-03-04 02:22:37,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 174 flow [2025-03-04 02:22:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:22:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:22:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-03-04 02:22:37,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:22:37,108 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 2 states and 54 transitions. [2025-03-04 02:22:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 174 flow [2025-03-04 02:22:37,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:22:37,115 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 88 flow [2025-03-04 02:22:37,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-03-04 02:22:37,122 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-04 02:22:37,122 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 88 flow [2025-03-04 02:22:37,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:22:37,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:37,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:22:37,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1361167108, now seen corresponding path program 1 times [2025-03-04 02:22:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710098690] [2025-03-04 02:22:37,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:37,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:22:37,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:37,390 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:22:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710098690] [2025-03-04 02:22:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710098690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548674469] [2025-03-04 02:22:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:37,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:37,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:37,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:37,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:22:37,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:37,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:37,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:37,843 INFO L124 PetriNetUnfolderBase]: 3499/4990 cut-off events. [2025-03-04 02:22:37,844 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-04 02:22:37,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10072 conditions, 4990 events. 3499/4990 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24953 event pairs, 876 based on Foata normal form. 1/4374 useless extension candidates. Maximal degree in co-relation 10069. Up to 3852 conditions per place. [2025-03-04 02:22:37,872 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 56 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2025-03-04 02:22:37,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 263 flow [2025-03-04 02:22:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 02:22:37,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-04 02:22:37,875 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 88 flow. Second operand 3 states and 83 transitions. [2025-03-04 02:22:37,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 263 flow [2025-03-04 02:22:37,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:37,878 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 114 flow [2025-03-04 02:22:37,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2025-03-04 02:22:37,879 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-04 02:22:37,879 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 114 flow [2025-03-04 02:22:37,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:22:37,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:37,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:37,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:22:37,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:37,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2012511443, now seen corresponding path program 1 times [2025-03-04 02:22:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797323358] [2025-03-04 02:22:37,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:22:37,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:22:37,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:37,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:37,995 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:22:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:37,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797323358] [2025-03-04 02:22:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797323358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695464957] [2025-03-04 02:22:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:37,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:37,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:37,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:37,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:22:37,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:37,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:37,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:38,357 INFO L124 PetriNetUnfolderBase]: 4090/5894 cut-off events. [2025-03-04 02:22:38,357 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2025-03-04 02:22:38,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12635 conditions, 5894 events. 4090/5894 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 29483 event pairs, 1812 based on Foata normal form. 158/5255 useless extension candidates. Maximal degree in co-relation 12630. Up to 3358 conditions per place. [2025-03-04 02:22:38,377 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 62 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-04 02:22:38,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 298 flow [2025-03-04 02:22:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 02:22:38,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:22:38,380 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 114 flow. Second operand 3 states and 84 transitions. [2025-03-04 02:22:38,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 298 flow [2025-03-04 02:22:38,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 295 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:38,381 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 118 flow [2025-03-04 02:22:38,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 02:22:38,382 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-04 02:22:38,382 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 118 flow [2025-03-04 02:22:38,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:22:38,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:38,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:38,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:22:38,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:38,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -700640505, now seen corresponding path program 1 times [2025-03-04 02:22:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:38,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405936467] [2025-03-04 02:22:38,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:38,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:22:38,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:22:38,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405936467] [2025-03-04 02:22:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405936467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070714640] [2025-03-04 02:22:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:38,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:38,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:22:38,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:38,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:38,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:38,766 INFO L124 PetriNetUnfolderBase]: 3703/5358 cut-off events. [2025-03-04 02:22:38,766 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2025-03-04 02:22:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11720 conditions, 5358 events. 3703/5358 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25987 event pairs, 1373 based on Foata normal form. 94/4783 useless extension candidates. Maximal degree in co-relation 11714. Up to 3376 conditions per place. [2025-03-04 02:22:38,789 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 57 selfloop transitions, 2 changer transitions 5/68 dead transitions. [2025-03-04 02:22:38,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 301 flow [2025-03-04 02:22:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 02:22:38,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-03-04 02:22:38,791 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 118 flow. Second operand 3 states and 86 transitions. [2025-03-04 02:22:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 301 flow [2025-03-04 02:22:38,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:38,792 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 124 flow [2025-03-04 02:22:38,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-04 02:22:38,793 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-03-04 02:22:38,793 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 124 flow [2025-03-04 02:22:38,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:22:38,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:38,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:38,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:22:38,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1078075590, now seen corresponding path program 1 times [2025-03-04 02:22:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723098854] [2025-03-04 02:22:38,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:38,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:38,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:22:38,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:22:38,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:38,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:38,873 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:22:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723098854] [2025-03-04 02:22:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723098854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344991207] [2025-03-04 02:22:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:38,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:38,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:38,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:38,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:22:38,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:38,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:39,135 INFO L124 PetriNetUnfolderBase]: 2561/3734 cut-off events. [2025-03-04 02:22:39,137 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2025-03-04 02:22:39,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 3734 events. 2561/3734 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16265 event pairs, 1346 based on Foata normal form. 62/3266 useless extension candidates. Maximal degree in co-relation 8243. Up to 2767 conditions per place. [2025-03-04 02:22:39,148 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 7/61 dead transitions. [2025-03-04 02:22:39,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 275 flow [2025-03-04 02:22:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-04 02:22:39,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-04 02:22:39,150 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 124 flow. Second operand 3 states and 76 transitions. [2025-03-04 02:22:39,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 275 flow [2025-03-04 02:22:39,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:39,151 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 134 flow [2025-03-04 02:22:39,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-04 02:22:39,151 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-03-04 02:22:39,151 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 134 flow [2025-03-04 02:22:39,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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:22:39,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:39,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:39,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:22:39,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:39,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash -914143491, now seen corresponding path program 1 times [2025-03-04 02:22:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-03-04 02:22:39,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:39,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:22:39,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:22:39,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:39,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:39,328 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:22:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-03-04 02:22:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044953435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104880519] [2025-03-04 02:22:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:39,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:39,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:39,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:39,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:39,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:39,651 INFO L124 PetriNetUnfolderBase]: 3171/4702 cut-off events. [2025-03-04 02:22:39,651 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2025-03-04 02:22:39,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10434 conditions, 4702 events. 3171/4702 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 22201 event pairs, 2856 based on Foata normal form. 56/4042 useless extension candidates. Maximal degree in co-relation 10426. Up to 3723 conditions per place. [2025-03-04 02:22:39,665 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 40 selfloop transitions, 2 changer transitions 26/72 dead transitions. [2025-03-04 02:22:39,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 330 flow [2025-03-04 02:22:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-04 02:22:39,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-03-04 02:22:39,668 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 134 flow. Second operand 4 states and 93 transitions. [2025-03-04 02:22:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 330 flow [2025-03-04 02:22:39,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:39,671 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow [2025-03-04 02:22:39,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-04 02:22:39,673 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-04 02:22:39,673 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow [2025-03-04 02:22:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:39,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:39,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:22:39,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -56169424, now seen corresponding path program 1 times [2025-03-04 02:22:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-04 02:22:39,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:22:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:22:39,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:39,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-04 02:22:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038127040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191593] [2025-03-04 02:22:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:39,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:39,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:39,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:39,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:39,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:39,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:39,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:39,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:40,187 INFO L124 PetriNetUnfolderBase]: 3337/4963 cut-off events. [2025-03-04 02:22:40,187 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2025-03-04 02:22:40,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11113 conditions, 4963 events. 3337/4963 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23831 event pairs, 3018 based on Foata normal form. 14/4234 useless extension candidates. Maximal degree in co-relation 11103. Up to 3721 conditions per place. [2025-03-04 02:22:40,208 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 39 selfloop transitions, 4 changer transitions 32/79 dead transitions. [2025-03-04 02:22:40,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 382 flow [2025-03-04 02:22:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 02:22:40,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2025-03-04 02:22:40,210 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 5 states and 107 transitions. [2025-03-04 02:22:40,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 382 flow [2025-03-04 02:22:40,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 374 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:40,212 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 166 flow [2025-03-04 02:22:40,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 02:22:40,214 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2025-03-04 02:22:40,214 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 166 flow [2025-03-04 02:22:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:40,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:40,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:40,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:22:40,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:40,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2075639658, now seen corresponding path program 1 times [2025-03-04 02:22:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530663542] [2025-03-04 02:22:40,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:40,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:22:40,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:22:40,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:40,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:40,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:40,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530663542] [2025-03-04 02:22:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530663542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323781388] [2025-03-04 02:22:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:40,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:40,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:40,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:40,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:40,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:40,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:40,664 INFO L124 PetriNetUnfolderBase]: 3297/4894 cut-off events. [2025-03-04 02:22:40,665 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-03-04 02:22:40,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 4894 events. 3297/4894 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23373 event pairs, 2984 based on Foata normal form. 10/4168 useless extension candidates. Maximal degree in co-relation 10860. Up to 3719 conditions per place. [2025-03-04 02:22:40,684 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 38 selfloop transitions, 6 changer transitions 24/72 dead transitions. [2025-03-04 02:22:40,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 368 flow [2025-03-04 02:22:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-03-04 02:22:40,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 02:22:40,685 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 166 flow. Second operand 5 states and 100 transitions. [2025-03-04 02:22:40,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 368 flow [2025-03-04 02:22:40,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 348 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:40,687 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 176 flow [2025-03-04 02:22:40,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-04 02:22:40,688 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-03-04 02:22:40,688 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 176 flow [2025-03-04 02:22:40,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:40,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:40,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:40,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:22:40,688 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:40,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1139471787, now seen corresponding path program 1 times [2025-03-04 02:22:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149167171] [2025-03-04 02:22:40,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:40,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:22:40,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:22:40,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:40,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149167171] [2025-03-04 02:22:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149167171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533984322] [2025-03-04 02:22:40,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:40,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:40,870 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:22:40,871 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:22:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 02:22:40,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:22:40,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:40,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:40,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:22:40,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:41,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:22:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533984322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:41,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:22:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 02:22:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546822345] [2025-03-04 02:22:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:41,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:41,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:22:41,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:41,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:41,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:41,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:41,507 INFO L124 PetriNetUnfolderBase]: 5255/7615 cut-off events. [2025-03-04 02:22:41,507 INFO L125 PetriNetUnfolderBase]: For 2329/2329 co-relation queries the response was YES. [2025-03-04 02:22:41,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17555 conditions, 7615 events. 5255/7615 cut-off events. For 2329/2329 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 35160 event pairs, 2749 based on Foata normal form. 156/6710 useless extension candidates. Maximal degree in co-relation 17543. Up to 2981 conditions per place. [2025-03-04 02:22:41,529 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 85 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2025-03-04 02:22:41,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 508 flow [2025-03-04 02:22:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-04 02:22:41,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-04 02:22:41,530 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 176 flow. Second operand 4 states and 115 transitions. [2025-03-04 02:22:41,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 508 flow [2025-03-04 02:22:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 494 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:41,533 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 225 flow [2025-03-04 02:22:41,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-03-04 02:22:41,534 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-03-04 02:22:41,534 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 225 flow [2025-03-04 02:22:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:41,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:41,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:41,541 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:22:41,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:41,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1792165292, now seen corresponding path program 1 times [2025-03-04 02:22:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-03-04 02:22:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 02:22:41,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 02:22:41,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:41,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-03-04 02:22:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120108746] [2025-03-04 02:22:41,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:41,929 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:22:41,931 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:22:41,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 02:22:42,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 02:22:42,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:42,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:22:42,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:42,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120108746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:42,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 02:22:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120451130] [2025-03-04 02:22:42,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:42,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:22:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:42,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:22:42,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:22:42,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:42,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 225 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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:22:42,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:42,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:42,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:42,724 INFO L124 PetriNetUnfolderBase]: 6007/8805 cut-off events. [2025-03-04 02:22:42,724 INFO L125 PetriNetUnfolderBase]: For 4182/4182 co-relation queries the response was YES. [2025-03-04 02:22:42,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21971 conditions, 8805 events. 6007/8805 cut-off events. For 4182/4182 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 42804 event pairs, 5125 based on Foata normal form. 2/7537 useless extension candidates. Maximal degree in co-relation 21958. Up to 7601 conditions per place. [2025-03-04 02:22:42,756 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 3 changer transitions 43/98 dead transitions. [2025-03-04 02:22:42,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 549 flow [2025-03-04 02:22:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:22:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:22:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-04 02:22:42,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-03-04 02:22:42,758 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 225 flow. Second operand 6 states and 123 transitions. [2025-03-04 02:22:42,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 549 flow [2025-03-04 02:22:42,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 541 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:42,763 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 239 flow [2025-03-04 02:22:42,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-03-04 02:22:42,764 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-03-04 02:22:42,764 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 239 flow [2025-03-04 02:22:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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:22:42,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:42,764 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:42,771 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:22:42,965 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,SelfDestructingSolverStorable9 [2025-03-04 02:22:42,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:42,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash 95118911, now seen corresponding path program 2 times [2025-03-04 02:22:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-04 02:22:42,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:42,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 02:22:43,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-04 02:22:43,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:22:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-04 02:22:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662980914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:22:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844143637] [2025-03-04 02:22:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:22:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:43,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:22:43,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:22:43,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:43,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 239 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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:22:43,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:43,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:43,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:44,731 INFO L124 PetriNetUnfolderBase]: 6147/8901 cut-off events. [2025-03-04 02:22:44,731 INFO L125 PetriNetUnfolderBase]: For 4579/4579 co-relation queries the response was YES. [2025-03-04 02:22:44,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22447 conditions, 8901 events. 6147/8901 cut-off events. For 4579/4579 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 41538 event pairs, 2206 based on Foata normal form. 1/7638 useless extension candidates. Maximal degree in co-relation 22430. Up to 6518 conditions per place. [2025-03-04 02:22:44,770 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 100 selfloop transitions, 15 changer transitions 18/137 dead transitions. [2025-03-04 02:22:44,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 731 flow [2025-03-04 02:22:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:22:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:22:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2025-03-04 02:22:44,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2025-03-04 02:22:44,772 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 239 flow. Second operand 10 states and 193 transitions. [2025-03-04 02:22:44,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 731 flow [2025-03-04 02:22:44,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 717 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:44,779 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 349 flow [2025-03-04 02:22:44,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-04 02:22:44,780 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-03-04 02:22:44,780 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 349 flow [2025-03-04 02:22:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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:22:44,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:44,780 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:44,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:22:44,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash 526799844, now seen corresponding path program 3 times [2025-03-04 02:22:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:44,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-04 02:22:44,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:44,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:22:44,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:22:44,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:44,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:22:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-04 02:22:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109224028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433291539] [2025-03-04 02:22:44,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:44,988 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:22:44,990 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:22:45,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:22:45,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:22:45,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:45,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:45,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:22:45,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:45,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433291539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:45,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-04 02:22:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813859726] [2025-03-04 02:22:45,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:45,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:22:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:45,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:22:45,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:22:45,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:45,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 349 flow. Second operand has 20 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 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:22:45,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:45,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:45,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:47,254 INFO L124 PetriNetUnfolderBase]: 11421/17200 cut-off events. [2025-03-04 02:22:47,254 INFO L125 PetriNetUnfolderBase]: For 16077/16077 co-relation queries the response was YES. [2025-03-04 02:22:47,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43986 conditions, 17200 events. 11421/17200 cut-off events. For 16077/16077 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 96619 event pairs, 7994 based on Foata normal form. 909/15550 useless extension candidates. Maximal degree in co-relation 43967. Up to 8883 conditions per place. [2025-03-04 02:22:47,311 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 112 selfloop transitions, 13 changer transitions 167/296 dead transitions. [2025-03-04 02:22:47,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 296 transitions, 1868 flow [2025-03-04 02:22:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:22:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:22:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 399 transitions. [2025-03-04 02:22:47,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36141304347826086 [2025-03-04 02:22:47,313 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 349 flow. Second operand 23 states and 399 transitions. [2025-03-04 02:22:47,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 296 transitions, 1868 flow [2025-03-04 02:22:47,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 296 transitions, 1772 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:47,326 INFO L231 Difference]: Finished difference. Result has 112 places, 74 transitions, 473 flow [2025-03-04 02:22:47,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=473, PETRI_PLACES=112, PETRI_TRANSITIONS=74} [2025-03-04 02:22:47,327 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 67 predicate places. [2025-03-04 02:22:47,327 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 74 transitions, 473 flow [2025-03-04 02:22:47,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 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:22:47,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:47,327 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:47,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:22:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:47,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1368710796, now seen corresponding path program 4 times [2025-03-04 02:22:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-03-04 02:22:47,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:47,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-04 02:22:47,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:22:47,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-03-04 02:22:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577324971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392552656] [2025-03-04 02:22:47,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:47,709 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:22:47,711 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:22:47,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-04 02:22:47,814 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:22:47,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:47,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:47,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:22:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:47,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392552656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:48,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 02:22:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174706743] [2025-03-04 02:22:48,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:22:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:48,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:22:48,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:22:48,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:48,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 74 transitions, 473 flow. Second operand has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 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:22:48,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:48,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:48,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:48,856 INFO L124 PetriNetUnfolderBase]: 6905/10111 cut-off events. [2025-03-04 02:22:48,856 INFO L125 PetriNetUnfolderBase]: For 14538/14538 co-relation queries the response was YES. [2025-03-04 02:22:48,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28330 conditions, 10111 events. 6905/10111 cut-off events. For 14538/14538 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 49996 event pairs, 5712 based on Foata normal form. 2/8640 useless extension candidates. Maximal degree in co-relation 28294. Up to 8887 conditions per place. [2025-03-04 02:22:48,902 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 60 selfloop transitions, 4 changer transitions 51/119 dead transitions. [2025-03-04 02:22:48,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 119 transitions, 833 flow [2025-03-04 02:22:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:22:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:22:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-03-04 02:22:48,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2025-03-04 02:22:48,903 INFO L175 Difference]: Start difference. First operand has 112 places, 74 transitions, 473 flow. Second operand 8 states and 145 transitions. [2025-03-04 02:22:48,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 119 transitions, 833 flow [2025-03-04 02:22:48,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 764 flow, removed 28 selfloop flow, removed 13 redundant places. [2025-03-04 02:22:48,928 INFO L231 Difference]: Finished difference. Result has 98 places, 68 transitions, 367 flow [2025-03-04 02:22:48,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=98, PETRI_TRANSITIONS=68} [2025-03-04 02:22:48,928 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2025-03-04 02:22:48,928 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 68 transitions, 367 flow [2025-03-04 02:22:48,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 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:22:48,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:48,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:48,935 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:22:49,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:49,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:49,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 536495547, now seen corresponding path program 5 times [2025-03-04 02:22:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-03-04 02:22:49,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:49,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-03-04 02:22:49,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 02:22:49,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:22:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:22:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-03-04 02:22:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438046205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410533662] [2025-03-04 02:22:49,269 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:22:49,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:49,271 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:22:49,273 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:22:49,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-03-04 02:22:49,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 02:22:49,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:22:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:49,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:22:49,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:22:49,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 02:22:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410533662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:49,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:22:49,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-03-04 02:22:49,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:22:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:49,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:22:49,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:22:49,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:49,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 68 transitions, 367 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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:22:49,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:49,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:49,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:50,880 INFO L124 PetriNetUnfolderBase]: 9349/13754 cut-off events. [2025-03-04 02:22:50,880 INFO L125 PetriNetUnfolderBase]: For 13006/13006 co-relation queries the response was YES. [2025-03-04 02:22:50,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35860 conditions, 13754 events. 9349/13754 cut-off events. For 13006/13006 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 70957 event pairs, 6573 based on Foata normal form. 418/12083 useless extension candidates. Maximal degree in co-relation 35830. Up to 7734 conditions per place. [2025-03-04 02:22:50,952 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 106 selfloop transitions, 10 changer transitions 25/145 dead transitions. [2025-03-04 02:22:50,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 145 transitions, 919 flow [2025-03-04 02:22:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:22:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:22:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-04 02:22:50,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36553030303030304 [2025-03-04 02:22:50,954 INFO L175 Difference]: Start difference. First operand has 98 places, 68 transitions, 367 flow. Second operand 11 states and 193 transitions. [2025-03-04 02:22:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 145 transitions, 919 flow [2025-03-04 02:22:50,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 885 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-04 02:22:50,971 INFO L231 Difference]: Finished difference. Result has 93 places, 72 transitions, 403 flow [2025-03-04 02:22:50,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=403, PETRI_PLACES=93, PETRI_TRANSITIONS=72} [2025-03-04 02:22:50,971 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-03-04 02:22:50,971 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 403 flow [2025-03-04 02:22:50,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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:22:50,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:50,972 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:50,980 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:22:51,172 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,SelfDestructingSolverStorable13 [2025-03-04 02:22:51,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1829105327, now seen corresponding path program 6 times [2025-03-04 02:22:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 02:22:51,173 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:22:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:51,186 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 3 equivalence classes. [2025-03-04 02:22:51,198 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 51 statements. [2025-03-04 02:22:51,198 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:22:51,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 02:22:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:51,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:51,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182813050] [2025-03-04 02:22:51,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:51,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:51,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:51,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:51,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:51,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:22:51,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:51,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:51,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:52,769 INFO L124 PetriNetUnfolderBase]: 16058/23328 cut-off events. [2025-03-04 02:22:52,769 INFO L125 PetriNetUnfolderBase]: For 28897/28897 co-relation queries the response was YES. [2025-03-04 02:22:52,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63940 conditions, 23328 events. 16058/23328 cut-off events. For 28897/28897 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 121408 event pairs, 7934 based on Foata normal form. 364/20360 useless extension candidates. Maximal degree in co-relation 63913. Up to 10563 conditions per place. [2025-03-04 02:22:52,865 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 118 selfloop transitions, 7 changer transitions 3/132 dead transitions. [2025-03-04 02:22:52,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 132 transitions, 934 flow [2025-03-04 02:22:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-04 02:22:52,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-04 02:22:52,866 INFO L175 Difference]: Start difference. First operand has 93 places, 72 transitions, 403 flow. Second operand 4 states and 115 transitions. [2025-03-04 02:22:52,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 132 transitions, 934 flow [2025-03-04 02:22:52,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 918 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 02:22:52,881 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 410 flow [2025-03-04 02:22:52,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=410, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2025-03-04 02:22:52,882 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-03-04 02:22:52,882 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 410 flow [2025-03-04 02:22:52,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:22:52,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:52,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:22:52,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:52,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash -273208050, now seen corresponding path program 7 times [2025-03-04 02:22:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:52,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052441364] [2025-03-04 02:22:52,883 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:22:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:52,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 02:22:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 02:22:52,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:22:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052441364] [2025-03-04 02:22:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052441364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:22:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838291599] [2025-03-04 02:22:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:52,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:52,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:52,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:52,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:22:52,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:52,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:53,155 INFO L124 PetriNetUnfolderBase]: 2344/3635 cut-off events. [2025-03-04 02:22:53,156 INFO L125 PetriNetUnfolderBase]: For 3534/3534 co-relation queries the response was YES. [2025-03-04 02:22:53,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 3635 events. 2344/3635 cut-off events. For 3534/3534 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 15693 event pairs, 2305 based on Foata normal form. 164/3161 useless extension candidates. Maximal degree in co-relation 8724. Up to 3577 conditions per place. [2025-03-04 02:22:53,169 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 51 selfloop transitions, 5 changer transitions 2/62 dead transitions. [2025-03-04 02:22:53,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 62 transitions, 434 flow [2025-03-04 02:22:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-04 02:22:53,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2025-03-04 02:22:53,171 INFO L175 Difference]: Start difference. First operand has 93 places, 71 transitions, 410 flow. Second operand 4 states and 71 transitions. [2025-03-04 02:22:53,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 62 transitions, 434 flow [2025-03-04 02:22:53,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 62 transitions, 365 flow, removed 8 selfloop flow, removed 15 redundant places. [2025-03-04 02:22:53,177 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 249 flow [2025-03-04 02:22:53,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2025-03-04 02:22:53,179 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2025-03-04 02:22:53,179 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 249 flow [2025-03-04 02:22:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:22:53,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:53,179 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-04 02:22:53,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:22:53,179 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:53,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1110724623, now seen corresponding path program 8 times [2025-03-04 02:22:53,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:53,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-04 02:22:53,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:53,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 02:22:53,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 02:22:53,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 02:22:53,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941039316] [2025-03-04 02:22:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941039316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738663914] [2025-03-04 02:22:53,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:53,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:53,361 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:22:53,363 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:22:53,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 02:22:53,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 02:22:53,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:53,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:22:53,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:53,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:54,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738663914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:54,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-04 02:22:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010348623] [2025-03-04 02:22:54,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:54,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:22:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:54,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:22:54,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:22:54,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:54,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 249 flow. Second operand has 22 states, 22 states have (on average 13.590909090909092) internal successors, (299), 22 states have internal predecessors, (299), 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:22:54,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:54,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:54,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:54,840 INFO L124 PetriNetUnfolderBase]: 3986/6225 cut-off events. [2025-03-04 02:22:54,840 INFO L125 PetriNetUnfolderBase]: For 876/876 co-relation queries the response was YES. [2025-03-04 02:22:54,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13510 conditions, 6225 events. 3986/6225 cut-off events. For 876/876 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 30446 event pairs, 2412 based on Foata normal form. 56/5198 useless extension candidates. Maximal degree in co-relation 13491. Up to 2403 conditions per place. [2025-03-04 02:22:54,858 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 52 selfloop transitions, 9 changer transitions 88/153 dead transitions. [2025-03-04 02:22:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 839 flow [2025-03-04 02:22:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:22:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:22:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 249 transitions. [2025-03-04 02:22:54,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2025-03-04 02:22:54,860 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 249 flow. Second operand 15 states and 249 transitions. [2025-03-04 02:22:54,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 839 flow [2025-03-04 02:22:54,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 153 transitions, 821 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:54,864 INFO L231 Difference]: Finished difference. Result has 95 places, 58 transitions, 277 flow [2025-03-04 02:22:54,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=277, PETRI_PLACES=95, PETRI_TRANSITIONS=58} [2025-03-04 02:22:54,865 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2025-03-04 02:22:54,865 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 58 transitions, 277 flow [2025-03-04 02:22:54,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.590909090909092) internal successors, (299), 22 states have internal predecessors, (299), 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:22:54,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:54,866 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-04 02:22:54,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:22:55,067 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:55,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -989279983, now seen corresponding path program 9 times [2025-03-04 02:22:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-04 02:22:55,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:55,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 3 equivalence classes. [2025-03-04 02:22:55,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 02:22:55,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:22:55,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-04 02:22:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031913992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896149968] [2025-03-04 02:22:55,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:55,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:55,332 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:22:55,334 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:22:55,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 3 equivalence classes. [2025-03-04 02:22:55,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 02:22:55,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:22:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:55,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:22:55,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:55,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 02:22:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896149968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:55,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 02:22:55,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776154732] [2025-03-04 02:22:55,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:22:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:55,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:22:55,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:22:55,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-04 02:22:55,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 58 transitions, 277 flow. Second operand has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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:22:55,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:55,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-04 02:22:55,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:56,248 INFO L124 PetriNetUnfolderBase]: 3900/6068 cut-off events. [2025-03-04 02:22:56,248 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-03-04 02:22:56,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 6068 events. 3900/6068 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 29560 event pairs, 3330 based on Foata normal form. 2/5014 useless extension candidates. Maximal degree in co-relation 13356. Up to 3622 conditions per place. [2025-03-04 02:22:56,266 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 5 changer transitions 69/128 dead transitions. [2025-03-04 02:22:56,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 782 flow [2025-03-04 02:22:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:22:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:22:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-03-04 02:22:56,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-04 02:22:56,267 INFO L175 Difference]: Start difference. First operand has 95 places, 58 transitions, 277 flow. Second operand 10 states and 176 transitions. [2025-03-04 02:22:56,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 782 flow [2025-03-04 02:22:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 734 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-03-04 02:22:56,271 INFO L231 Difference]: Finished difference. Result has 92 places, 59 transitions, 279 flow [2025-03-04 02:22:56,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=279, PETRI_PLACES=92, PETRI_TRANSITIONS=59} [2025-03-04 02:22:56,271 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2025-03-04 02:22:56,271 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 59 transitions, 279 flow [2025-03-04 02:22:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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:22:56,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:56,272 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-04 02:22:56,279 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:22:56,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:56,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 942066982, now seen corresponding path program 10 times [2025-03-04 02:22:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:56,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-03-04 02:22:56,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:56,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-03-04 02:22:56,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 02:22:56,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:23:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920102699] [2025-03-04 02:23:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920102699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563625523] [2025-03-04 02:23:00,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:23:00,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:00,855 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:23:00,856 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:23:00,934 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-03-04 02:23:00,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 02:23:00,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:23:00,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:00,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-03-04 02:23:01,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:01,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 02:23:01,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:23:01,358 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 02:23:01,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 02:23:01,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:23:01,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:23:01,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:23:01,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:23:01,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 02:23:01,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:23:01,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:23:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:23:06,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:19,959 INFO L349 Elim1Store]: treesize reduction 75, result has 45.3 percent of original size [2025-03-04 02:23:19,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 362 treesize of output 292 [2025-03-04 02:23:20,990 INFO L349 Elim1Store]: treesize reduction 72, result has 46.7 percent of original size [2025-03-04 02:23:20,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 365 treesize of output 297 [2025-03-04 02:23:21,738 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 343 treesize of output 264 [2025-03-04 02:23:22,272 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 302 treesize of output 239 [2025-03-04 02:23:22,947 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:22,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-04 02:23:23,284 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:23,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 343 treesize of output 264 [2025-03-04 02:23:23,661 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-04 02:23:24,179 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:24,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-04 02:23:24,491 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-04 02:23:24,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-04 02:23:50,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:23:50,833 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 193 [2025-03-04 02:23:50,891 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2025-03-04 02:23:50,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1622 treesize of output 1488 [2025-03-04 02:23:51,024 INFO L349 Elim1Store]: treesize reduction 68, result has 67.8 percent of original size [2025-03-04 02:23:51,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 712 treesize of output 764 [2025-03-04 02:23:51,056 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,059 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,062 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,065 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,068 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,072 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:23:51,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:23:51,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 622 treesize of output 596