./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.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 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:57,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:57,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:57,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:57,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:57,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:57,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:57,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:57,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:57,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:57,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:57,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:57,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:57,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:57,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:57,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:57,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:57,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:57,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:57,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:57,299 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 -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-03-04 02:28:57,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:57,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:57,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:57,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:57,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:57,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-04 02:28:58,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb05ecf6/ab6787cd5b0e4b4fa6ef257636f11db2/FLAG2f51e415c [2025-03-04 02:28:58,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:58,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-04 02:28:58,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb05ecf6/ab6787cd5b0e4b4fa6ef257636f11db2/FLAG2f51e415c [2025-03-04 02:28:59,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb05ecf6/ab6787cd5b0e4b4fa6ef257636f11db2 [2025-03-04 02:28:59,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:59,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:59,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:59,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:59,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:59,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609a6bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59, skipping insertion in model container [2025-03-04 02:28:59,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:59,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c[2667,2680] [2025-03-04 02:28:59,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:59,341 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:59,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c[2667,2680] [2025-03-04 02:28:59,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:59,370 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:59,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59 WrapperNode [2025-03-04 02:28:59,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:59,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:59,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:59,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:59,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,394 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 146 [2025-03-04 02:28:59,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:59,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:59,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:59,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:59,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,413 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:28:59,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:59,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:59,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:59,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:59,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (1/1) ... [2025-03-04 02:28:59,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:59,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:28:59,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:28:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:59,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:59,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:59,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:28:59,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:28:59,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:28:59,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:59,543 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:59,739 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:59,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:59,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:59,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:59,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:59 BoogieIcfgContainer [2025-03-04 02:28:59,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:59,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:59,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:59,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:59,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:59" (1/3) ... [2025-03-04 02:28:59,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454772c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:59, skipping insertion in model container [2025-03-04 02:28:59,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:59" (2/3) ... [2025-03-04 02:28:59,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5454772c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:59, skipping insertion in model container [2025-03-04 02:28:59,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:59" (3/3) ... [2025-03-04 02:28:59,923 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-03-04 02:28:59,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:59,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:28:59,936 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:59,980 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:29:00,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:29:00,035 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-04 02:29:00,039 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:29:00,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 02:29:00,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:29:00,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-04 02:29:00,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:29:00,063 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;@4b6bc481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:29:00,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:29:00,072 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:29:00,074 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-04 02:29:00,074 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:29:00,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:00,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:00,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1369978944, now seen corresponding path program 1 times [2025-03-04 02:29:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:00,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810608752] [2025-03-04 02:29:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:29:00,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:29:00,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:00,444 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:29:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810608752] [2025-03-04 02:29:00,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810608752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:00,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:00,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229136904] [2025-03-04 02:29:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:00,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:00,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:00,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:00,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:00,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:00,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:00,535 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-03-04 02:29:00,535 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 02:29:00,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-03-04 02:29:00,539 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-03-04 02:29:00,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-03-04 02:29:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-04 02:29:00,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:29:00,550 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-03-04 02:29:00,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-03-04 02:29:00,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:00,556 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-03-04 02:29:00,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-03-04 02:29:00,560 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-04 02:29:00,560 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-03-04 02:29:00,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:00,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:00,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:00,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:29:00,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:00,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash 73173435, now seen corresponding path program 1 times [2025-03-04 02:29:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246549899] [2025-03-04 02:29:00,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:00,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:00,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:29:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:29:00,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:00,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:00,793 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:29:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246549899] [2025-03-04 02:29:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246549899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801450451] [2025-03-04 02:29:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:00,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:29:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:00,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:29:00,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:29:00,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:00,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:00,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:00,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:00,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:00,931 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-03-04 02:29:00,931 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:29:00,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-03-04 02:29:00,934 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-03-04 02:29:00,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-03-04 02:29:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:29:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:29:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-04 02:29:00,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-04 02:29:00,935 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-03-04 02:29:00,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-03-04 02:29:00,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:00,936 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-03-04 02:29:00,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-04 02:29:00,937 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-04 02:29:00,937 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-03-04 02:29:00,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:00,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:00,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:29:00,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:00,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1698989743, now seen corresponding path program 2 times [2025-03-04 02:29:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:00,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591285334] [2025-03-04 02:29:00,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:00,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:29:01,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-04 02:29:01,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:29:01,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:01,270 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:29:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591285334] [2025-03-04 02:29:01,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591285334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:01,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:01,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:01,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551277937] [2025-03-04 02:29:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:01,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:29:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:01,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:29:01,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:29:01,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:01,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:01,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:01,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:01,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:01,471 INFO L124 PetriNetUnfolderBase]: 98/190 cut-off events. [2025-03-04 02:29:01,471 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 02:29:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 190 events. 98/190 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 595 event pairs, 3 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 527. Up to 75 conditions per place. [2025-03-04 02:29:01,473 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 38 selfloop transitions, 19 changer transitions 2/60 dead transitions. [2025-03-04 02:29:01,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 60 transitions, 335 flow [2025-03-04 02:29:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:29:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:29:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2025-03-04 02:29:01,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49375 [2025-03-04 02:29:01,475 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 8 states and 79 transitions. [2025-03-04 02:29:01,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 60 transitions, 335 flow [2025-03-04 02:29:01,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 317 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:01,477 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 197 flow [2025-03-04 02:29:01,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-03-04 02:29:01,477 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2025-03-04 02:29:01,477 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 197 flow [2025-03-04 02:29:01,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:01,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:01,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:01,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:29:01,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:01,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2062993595, now seen corresponding path program 3 times [2025-03-04 02:29:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903486326] [2025-03-04 02:29:01,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:01,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:29:01,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-04 02:29:01,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:29:01,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:01,610 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:29:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903486326] [2025-03-04 02:29:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903486326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:01,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491283085] [2025-03-04 02:29:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:01,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:29:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:01,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:29:01,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:29:01,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:01,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:01,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:01,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:01,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:01,719 INFO L124 PetriNetUnfolderBase]: 106/199 cut-off events. [2025-03-04 02:29:01,720 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-04 02:29:01,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 199 events. 106/199 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 612 event pairs, 31 based on Foata normal form. 3/184 useless extension candidates. Maximal degree in co-relation 668. Up to 109 conditions per place. [2025-03-04 02:29:01,724 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 37 selfloop transitions, 16 changer transitions 0/54 dead transitions. [2025-03-04 02:29:01,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 375 flow [2025-03-04 02:29:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:29:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:29:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-04 02:29:01,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-04 02:29:01,726 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 197 flow. Second operand 5 states and 52 transitions. [2025-03-04 02:29:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 375 flow [2025-03-04 02:29:01,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 339 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:01,731 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 249 flow [2025-03-04 02:29:01,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2025-03-04 02:29:01,732 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2025-03-04 02:29:01,732 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 249 flow [2025-03-04 02:29:01,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:01,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:01,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:29:01,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:01,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 497563987, now seen corresponding path program 4 times [2025-03-04 02:29:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140322631] [2025-03-04 02:29:01,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:01,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:29:01,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:29:01,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:01,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:01,914 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:29:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:01,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140322631] [2025-03-04 02:29:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140322631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475242514] [2025-03-04 02:29:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:01,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:29:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:01,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:29:01,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:29:01,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:01,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:01,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:01,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:01,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:02,038 INFO L124 PetriNetUnfolderBase]: 104/191 cut-off events. [2025-03-04 02:29:02,038 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-03-04 02:29:02,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 191 events. 104/191 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 558 event pairs, 15 based on Foata normal form. 3/176 useless extension candidates. Maximal degree in co-relation 653. Up to 144 conditions per place. [2025-03-04 02:29:02,041 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 35 selfloop transitions, 18 changer transitions 0/54 dead transitions. [2025-03-04 02:29:02,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 404 flow [2025-03-04 02:29:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:29:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:29:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-04 02:29:02,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 02:29:02,044 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 249 flow. Second operand 6 states and 58 transitions. [2025-03-04 02:29:02,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 404 flow [2025-03-04 02:29:02,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 391 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:02,049 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 296 flow [2025-03-04 02:29:02,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 02:29:02,051 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2025-03-04 02:29:02,051 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 296 flow [2025-03-04 02:29:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:02,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:02,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:02,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:29:02,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:02,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1814441175, now seen corresponding path program 1 times [2025-03-04 02:29:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:02,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782387821] [2025-03-04 02:29:02,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:02,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:02,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:02,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:02,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782387821] [2025-03-04 02:29:02,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782387821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:02,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016170798] [2025-03-04 02:29:02,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:02,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:02,190 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:29:02,191 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:29:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:02,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:02,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:29:02,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:02,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:02,646 INFO L349 Elim1Store]: treesize reduction 74, result has 14.9 percent of original size [2025-03-04 02:29:02,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 146 [2025-03-04 02:29:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:02,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:03,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 280 [2025-03-04 02:29:03,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:03,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 1134 treesize of output 866 [2025-03-04 02:29:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016170798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:24,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 02:29:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536428818] [2025-03-04 02:29:24,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:29:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:24,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:29:24,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:29:24,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:24,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 296 flow. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:24,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:24,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:24,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:25,208 INFO L124 PetriNetUnfolderBase]: 267/486 cut-off events. [2025-03-04 02:29:25,208 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2025-03-04 02:29:25,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 486 events. 267/486 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1963 event pairs, 17 based on Foata normal form. 6/436 useless extension candidates. Maximal degree in co-relation 1622. Up to 153 conditions per place. [2025-03-04 02:29:25,210 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 62 selfloop transitions, 39 changer transitions 58/160 dead transitions. [2025-03-04 02:29:25,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 160 transitions, 1153 flow [2025-03-04 02:29:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:29:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:29:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 210 transitions. [2025-03-04 02:29:25,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-04 02:29:25,213 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 296 flow. Second operand 24 states and 210 transitions. [2025-03-04 02:29:25,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 160 transitions, 1153 flow [2025-03-04 02:29:25,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 160 transitions, 1033 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:29:25,219 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 444 flow [2025-03-04 02:29:25,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=444, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2025-03-04 02:29:25,220 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2025-03-04 02:29:25,220 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 444 flow [2025-03-04 02:29:25,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:25,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:25,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:25,227 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:29:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:29:25,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1494732079, now seen corresponding path program 1 times [2025-03-04 02:29:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631655753] [2025-03-04 02:29:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:25,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:25,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:25,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:25,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631655753] [2025-03-04 02:29:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631655753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118577075] [2025-03-04 02:29:25,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:25,544 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:29:25,546 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:29:25,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:25,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:25,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:25,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:29:25,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:25,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:25,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:29:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:25,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:26,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:29:26,195 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:29:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 02:29:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118577075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:26,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-04 02:29:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072627315] [2025-03-04 02:29:26,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:26,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:29:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:26,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:29:26,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:29:26,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:26,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 444 flow. Second operand has 21 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:26,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:26,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:30,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:30,952 INFO L124 PetriNetUnfolderBase]: 287/561 cut-off events. [2025-03-04 02:29:30,952 INFO L125 PetriNetUnfolderBase]: For 783/783 co-relation queries the response was YES. [2025-03-04 02:29:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 561 events. 287/561 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2557 event pairs, 4 based on Foata normal form. 4/538 useless extension candidates. Maximal degree in co-relation 1972. Up to 178 conditions per place. [2025-03-04 02:29:30,955 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 88 selfloop transitions, 58 changer transitions 3/150 dead transitions. [2025-03-04 02:29:30,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 150 transitions, 1192 flow [2025-03-04 02:29:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:29:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:29:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 169 transitions. [2025-03-04 02:29:30,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44473684210526315 [2025-03-04 02:29:30,957 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 444 flow. Second operand 19 states and 169 transitions. [2025-03-04 02:29:30,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 150 transitions, 1192 flow [2025-03-04 02:29:30,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1045 flow, removed 47 selfloop flow, removed 10 redundant places. [2025-03-04 02:29:30,962 INFO L231 Difference]: Finished difference. Result has 80 places, 88 transitions, 743 flow [2025-03-04 02:29:30,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=743, PETRI_PLACES=80, PETRI_TRANSITIONS=88} [2025-03-04 02:29:30,965 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2025-03-04 02:29:30,965 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 88 transitions, 743 flow [2025-03-04 02:29:30,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:30,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:30,973 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:29:31,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:29:31,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:31,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash 223016981, now seen corresponding path program 2 times [2025-03-04 02:29:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:31,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517143281] [2025-03-04 02:29:31,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:31,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:31,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:31,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517143281] [2025-03-04 02:29:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517143281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958232856] [2025-03-04 02:29:31,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:31,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:31,378 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:29:31,379 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:29:31,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:31,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:31,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:31,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:31,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:31,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:31,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958232856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:31,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:31,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384339292] [2025-03-04 02:29:31,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:31,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:31,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:31,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:31,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:31,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 88 transitions, 743 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:31,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:31,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:31,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,910 INFO L124 PetriNetUnfolderBase]: 340/670 cut-off events. [2025-03-04 02:29:31,910 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2025-03-04 02:29:31,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 670 events. 340/670 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3278 event pairs, 80 based on Foata normal form. 15/680 useless extension candidates. Maximal degree in co-relation 2747. Up to 310 conditions per place. [2025-03-04 02:29:31,914 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 91 selfloop transitions, 59 changer transitions 0/151 dead transitions. [2025-03-04 02:29:31,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 151 transitions, 1412 flow [2025-03-04 02:29:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:29:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:29:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2025-03-04 02:29:31,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2025-03-04 02:29:31,916 INFO L175 Difference]: Start difference. First operand has 80 places, 88 transitions, 743 flow. Second operand 13 states and 122 transitions. [2025-03-04 02:29:31,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 151 transitions, 1412 flow [2025-03-04 02:29:31,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 1277 flow, removed 48 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:31,925 INFO L231 Difference]: Finished difference. Result has 95 places, 113 transitions, 1072 flow [2025-03-04 02:29:31,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1072, PETRI_PLACES=95, PETRI_TRANSITIONS=113} [2025-03-04 02:29:31,926 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 74 predicate places. [2025-03-04 02:29:31,926 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 113 transitions, 1072 flow [2025-03-04 02:29:31,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:31,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:31,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:31,933 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:29:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:32,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:32,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 328477121, now seen corresponding path program 3 times [2025-03-04 02:29:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28797379] [2025-03-04 02:29:32,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:32,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:32,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:32,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:32,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28797379] [2025-03-04 02:29:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28797379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572084161] [2025-03-04 02:29:32,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:32,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:32,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:32,249 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:29:32,251 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:29:32,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:32,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:32,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:32,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:32,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:29:32,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:32,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:32,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-03-04 02:29:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:32,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:33,299 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-04 02:29:33,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-03-04 02:29:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572084161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:33,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-04 02:29:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151788563] [2025-03-04 02:29:33,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:29:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:29:33,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:29:33,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:33,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 113 transitions, 1072 flow. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:33,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:33,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:34,421 INFO L124 PetriNetUnfolderBase]: 383/768 cut-off events. [2025-03-04 02:29:34,421 INFO L125 PetriNetUnfolderBase]: For 2837/2837 co-relation queries the response was YES. [2025-03-04 02:29:34,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3725 conditions, 768 events. 383/768 cut-off events. For 2837/2837 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3995 event pairs, 8 based on Foata normal form. 4/736 useless extension candidates. Maximal degree in co-relation 3471. Up to 223 conditions per place. [2025-03-04 02:29:34,427 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 94 selfloop transitions, 85 changer transitions 8/188 dead transitions. [2025-03-04 02:29:34,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 188 transitions, 1902 flow [2025-03-04 02:29:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:29:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:29:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 178 transitions. [2025-03-04 02:29:34,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-03-04 02:29:34,430 INFO L175 Difference]: Start difference. First operand has 95 places, 113 transitions, 1072 flow. Second operand 21 states and 178 transitions. [2025-03-04 02:29:34,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 188 transitions, 1902 flow [2025-03-04 02:29:34,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 188 transitions, 1814 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 02:29:34,445 INFO L231 Difference]: Finished difference. Result has 117 places, 132 transitions, 1418 flow [2025-03-04 02:29:34,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1418, PETRI_PLACES=117, PETRI_TRANSITIONS=132} [2025-03-04 02:29:34,446 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2025-03-04 02:29:34,446 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 132 transitions, 1418 flow [2025-03-04 02:29:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:34,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:34,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:34,452 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:29:34,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:34,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:34,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1183783775, now seen corresponding path program 4 times [2025-03-04 02:29:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635921038] [2025-03-04 02:29:34,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:34,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:34,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:34,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635921038] [2025-03-04 02:29:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635921038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147392393] [2025-03-04 02:29:34,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:34,757 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:29:34,759 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:29:34,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:34,810 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:34,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:34,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:34,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:29:34,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:34,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:34,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-03-04 02:29:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:35,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:35,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:35,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 127 [2025-03-04 02:29:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147392393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:35,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 18 [2025-03-04 02:29:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278637428] [2025-03-04 02:29:35,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:29:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:35,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:29:35,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:29:35,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:35,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 132 transitions, 1418 flow. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:35,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:35,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:35,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:36,730 INFO L124 PetriNetUnfolderBase]: 399/788 cut-off events. [2025-03-04 02:29:36,730 INFO L125 PetriNetUnfolderBase]: For 3868/3868 co-relation queries the response was YES. [2025-03-04 02:29:36,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 788 events. 399/788 cut-off events. For 3868/3868 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4039 event pairs, 29 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 4089. Up to 563 conditions per place. [2025-03-04 02:29:36,735 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 120 selfloop transitions, 48 changer transitions 4/173 dead transitions. [2025-03-04 02:29:36,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 173 transitions, 1996 flow [2025-03-04 02:29:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:29:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:29:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2025-03-04 02:29:36,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-03-04 02:29:36,737 INFO L175 Difference]: Start difference. First operand has 117 places, 132 transitions, 1418 flow. Second operand 14 states and 121 transitions. [2025-03-04 02:29:36,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 173 transitions, 1996 flow [2025-03-04 02:29:36,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 173 transitions, 1898 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-04 02:29:36,755 INFO L231 Difference]: Finished difference. Result has 125 places, 137 transitions, 1514 flow [2025-03-04 02:29:36,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1514, PETRI_PLACES=125, PETRI_TRANSITIONS=137} [2025-03-04 02:29:36,755 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2025-03-04 02:29:36,755 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 137 transitions, 1514 flow [2025-03-04 02:29:36,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:36,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:36,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:36,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:29:36,960 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,SelfDestructingSolverStorable9 [2025-03-04 02:29:36,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -534559931, now seen corresponding path program 5 times [2025-03-04 02:29:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085452013] [2025-03-04 02:29:36,961 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:36,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:36,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:36,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085452013] [2025-03-04 02:29:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085452013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331121809] [2025-03-04 02:29:37,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:37,078 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:29:37,080 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:29:37,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:37,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:37,144 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:37,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:37,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:29:37,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:37,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:37,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:37,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 44 [2025-03-04 02:29:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:37,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:38,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:29:38,205 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:29:38,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 02:29:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:38,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331121809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:38,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-04 02:29:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313387274] [2025-03-04 02:29:38,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:38,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:29:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:38,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:29:38,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:29:38,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:38,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 137 transitions, 1514 flow. Second operand has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:38,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:38,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:38,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:39,237 INFO L124 PetriNetUnfolderBase]: 416/834 cut-off events. [2025-03-04 02:29:39,237 INFO L125 PetriNetUnfolderBase]: For 4435/4435 co-relation queries the response was YES. [2025-03-04 02:29:39,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 834 events. 416/834 cut-off events. For 4435/4435 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4451 event pairs, 2 based on Foata normal form. 6/805 useless extension candidates. Maximal degree in co-relation 4396. Up to 387 conditions per place. [2025-03-04 02:29:39,243 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 105 selfloop transitions, 95 changer transitions 6/207 dead transitions. [2025-03-04 02:29:39,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 207 transitions, 2394 flow [2025-03-04 02:29:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:29:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:29:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 165 transitions. [2025-03-04 02:29:39,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-03-04 02:29:39,247 INFO L175 Difference]: Start difference. First operand has 125 places, 137 transitions, 1514 flow. Second operand 20 states and 165 transitions. [2025-03-04 02:29:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 207 transitions, 2394 flow [2025-03-04 02:29:39,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 207 transitions, 2307 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-04 02:29:39,268 INFO L231 Difference]: Finished difference. Result has 140 places, 156 transitions, 1956 flow [2025-03-04 02:29:39,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1956, PETRI_PLACES=140, PETRI_TRANSITIONS=156} [2025-03-04 02:29:39,269 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 119 predicate places. [2025-03-04 02:29:39,269 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 156 transitions, 1956 flow [2025-03-04 02:29:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:39,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:39,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:39,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:29:39,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:39,470 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1515140193, now seen corresponding path program 6 times [2025-03-04 02:29:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681515285] [2025-03-04 02:29:39,471 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:39,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:39,489 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:39,489 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681515285] [2025-03-04 02:29:39,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681515285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463610275] [2025-03-04 02:29:39,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:29:39,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:39,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:39,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:29:39,669 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:39,715 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:39,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:29:39,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:39,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:29:39,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:39,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:39,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-03-04 02:29:40,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:40,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 217 [2025-03-04 02:29:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463610275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:41,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-04 02:29:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995895655] [2025-03-04 02:29:41,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:29:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:41,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:29:41,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:29:41,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:41,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 156 transitions, 1956 flow. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:41,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:41,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:41,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:42,398 INFO L124 PetriNetUnfolderBase]: 443/917 cut-off events. [2025-03-04 02:29:42,398 INFO L125 PetriNetUnfolderBase]: For 6605/6605 co-relation queries the response was YES. [2025-03-04 02:29:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 917 events. 443/917 cut-off events. For 6605/6605 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5200 event pairs, 26 based on Foata normal form. 14/916 useless extension candidates. Maximal degree in co-relation 5318. Up to 536 conditions per place. [2025-03-04 02:29:42,405 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 126 selfloop transitions, 95 changer transitions 26/248 dead transitions. [2025-03-04 02:29:42,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 248 transitions, 3174 flow [2025-03-04 02:29:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:29:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:29:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 190 transitions. [2025-03-04 02:29:42,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2025-03-04 02:29:42,406 INFO L175 Difference]: Start difference. First operand has 140 places, 156 transitions, 1956 flow. Second operand 23 states and 190 transitions. [2025-03-04 02:29:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 248 transitions, 3174 flow [2025-03-04 02:29:42,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 248 transitions, 2929 flow, removed 34 selfloop flow, removed 18 redundant places. [2025-03-04 02:29:42,430 INFO L231 Difference]: Finished difference. Result has 152 places, 178 transitions, 2308 flow [2025-03-04 02:29:42,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1743, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2308, PETRI_PLACES=152, PETRI_TRANSITIONS=178} [2025-03-04 02:29:42,431 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2025-03-04 02:29:42,431 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 178 transitions, 2308 flow [2025-03-04 02:29:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:42,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:42,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:42,437 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:29:42,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:42,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -31268153, now seen corresponding path program 7 times [2025-03-04 02:29:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:42,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569196462] [2025-03-04 02:29:42,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:42,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:42,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:42,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:42,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569196462] [2025-03-04 02:29:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569196462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:42,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573361074] [2025-03-04 02:29:42,712 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:29:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:42,714 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:42,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:29:42,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:29:42,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:42,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:42,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:42,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:29:42,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:42,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:42,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 02:29:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:42,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:43,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:29:43,500 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:29:43,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-04 02:29:43,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-03-04 02:29:43,537 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-03-04 02:29:43,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 164 [2025-03-04 02:29:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573361074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:43,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:43,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2025-03-04 02:29:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857081946] [2025-03-04 02:29:43,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:43,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:29:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:43,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:29:43,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:29:43,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:43,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 178 transitions, 2308 flow. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:43,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:43,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:43,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:44,486 INFO L124 PetriNetUnfolderBase]: 437/919 cut-off events. [2025-03-04 02:29:44,486 INFO L125 PetriNetUnfolderBase]: For 6789/6789 co-relation queries the response was YES. [2025-03-04 02:29:44,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5657 conditions, 919 events. 437/919 cut-off events. For 6789/6789 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5268 event pairs, 8 based on Foata normal form. 7/911 useless extension candidates. Maximal degree in co-relation 5498. Up to 424 conditions per place. [2025-03-04 02:29:44,493 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 108 selfloop transitions, 118 changer transitions 15/242 dead transitions. [2025-03-04 02:29:44,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 242 transitions, 3157 flow [2025-03-04 02:29:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:29:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:29:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 196 transitions. [2025-03-04 02:29:44,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2025-03-04 02:29:44,494 INFO L175 Difference]: Start difference. First operand has 152 places, 178 transitions, 2308 flow. Second operand 26 states and 196 transitions. [2025-03-04 02:29:44,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 242 transitions, 3157 flow [2025-03-04 02:29:44,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 242 transitions, 3088 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:44,521 INFO L231 Difference]: Finished difference. Result has 178 places, 185 transitions, 2618 flow [2025-03-04 02:29:44,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2618, PETRI_PLACES=178, PETRI_TRANSITIONS=185} [2025-03-04 02:29:44,522 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2025-03-04 02:29:44,522 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 185 transitions, 2618 flow [2025-03-04 02:29:44,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:44,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:44,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:44,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:44,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:29:44,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1681113537, now seen corresponding path program 8 times [2025-03-04 02:29:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813077629] [2025-03-04 02:29:44,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:44,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:44,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:44,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:44,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813077629] [2025-03-04 02:29:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813077629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347797061] [2025-03-04 02:29:44,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:44,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:44,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:29:44,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:29:44,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:29:44,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:44,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:44,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:44,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:29:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347797061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:45,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:45,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 02:29:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598487597] [2025-03-04 02:29:45,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:45,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:29:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:45,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:29:45,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:29:45,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:45,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 185 transitions, 2618 flow. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:45,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:45,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:45,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:45,246 INFO L124 PetriNetUnfolderBase]: 507/1077 cut-off events. [2025-03-04 02:29:45,247 INFO L125 PetriNetUnfolderBase]: For 10093/10093 co-relation queries the response was YES. [2025-03-04 02:29:45,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1077 events. 507/1077 cut-off events. For 10093/10093 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6347 event pairs, 81 based on Foata normal form. 8/1069 useless extension candidates. Maximal degree in co-relation 7083. Up to 380 conditions per place. [2025-03-04 02:29:45,256 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 138 selfloop transitions, 99 changer transitions 0/238 dead transitions. [2025-03-04 02:29:45,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 238 transitions, 3722 flow [2025-03-04 02:29:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:29:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:29:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2025-03-04 02:29:45,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:29:45,258 INFO L175 Difference]: Start difference. First operand has 178 places, 185 transitions, 2618 flow. Second operand 10 states and 85 transitions. [2025-03-04 02:29:45,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 238 transitions, 3722 flow [2025-03-04 02:29:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 238 transitions, 3553 flow, removed 53 selfloop flow, removed 17 redundant places. [2025-03-04 02:29:45,314 INFO L231 Difference]: Finished difference. Result has 172 places, 200 transitions, 3006 flow [2025-03-04 02:29:45,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3006, PETRI_PLACES=172, PETRI_TRANSITIONS=200} [2025-03-04 02:29:45,314 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 151 predicate places. [2025-03-04 02:29:45,314 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 200 transitions, 3006 flow [2025-03-04 02:29:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:45,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:45,315 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:45,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:29:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:29:45,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash 594347125, now seen corresponding path program 9 times [2025-03-04 02:29:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123521074] [2025-03-04 02:29:45,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:45,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:45,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:45,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:45,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123521074] [2025-03-04 02:29:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123521074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441887681] [2025-03-04 02:29:45,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:45,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:45,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:45,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:45,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:29:45,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:45,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:45,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:45,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:45,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 02:29:45,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:45,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:45,989 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:29:45,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2025-03-04 02:29:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:46,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:46,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2025-03-04 02:29:46,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:29:46,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 297 treesize of output 257 [2025-03-04 02:29:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441887681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:47,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 02:29:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261613520] [2025-03-04 02:29:47,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:29:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:47,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:29:47,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:29:47,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:47,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 200 transitions, 3006 flow. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:47,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:47,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:47,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:47,616 INFO L124 PetriNetUnfolderBase]: 516/1114 cut-off events. [2025-03-04 02:29:47,616 INFO L125 PetriNetUnfolderBase]: For 11022/11022 co-relation queries the response was YES. [2025-03-04 02:29:47,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7554 conditions, 1114 events. 516/1114 cut-off events. For 11022/11022 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6813 event pairs, 36 based on Foata normal form. 7/1115 useless extension candidates. Maximal degree in co-relation 7446. Up to 758 conditions per place. [2025-03-04 02:29:47,624 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 150 selfloop transitions, 15 changer transitions 79/245 dead transitions. [2025-03-04 02:29:47,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 245 transitions, 3815 flow [2025-03-04 02:29:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:29:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:29:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2025-03-04 02:29:47,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 02:29:47,625 INFO L175 Difference]: Start difference. First operand has 172 places, 200 transitions, 3006 flow. Second operand 11 states and 100 transitions. [2025-03-04 02:29:47,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 245 transitions, 3815 flow [2025-03-04 02:29:47,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 245 transitions, 3618 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:47,672 INFO L231 Difference]: Finished difference. Result has 179 places, 162 transitions, 2247 flow [2025-03-04 02:29:47,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2247, PETRI_PLACES=179, PETRI_TRANSITIONS=162} [2025-03-04 02:29:47,673 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2025-03-04 02:29:47,673 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 162 transitions, 2247 flow [2025-03-04 02:29:47,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:47,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:47,673 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:47,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:29:47,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:29:47,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 712848912, now seen corresponding path program 2 times [2025-03-04 02:29:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895626239] [2025-03-04 02:29:47,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:47,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:47,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:47,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895626239] [2025-03-04 02:29:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895626239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530679077] [2025-03-04 02:29:47,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:29:47,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:47,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:47,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:47,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:29:48,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:48,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:48,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:48,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:48,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:48,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:48,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530679077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930156346] [2025-03-04 02:29:48,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:48,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:48,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:48,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:48,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 162 transitions, 2247 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:48,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:48,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:48,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:50,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:51,086 INFO L124 PetriNetUnfolderBase]: 465/951 cut-off events. [2025-03-04 02:29:51,086 INFO L125 PetriNetUnfolderBase]: For 8810/8810 co-relation queries the response was YES. [2025-03-04 02:29:51,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6368 conditions, 951 events. 465/951 cut-off events. For 8810/8810 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5405 event pairs, 82 based on Foata normal form. 10/952 useless extension candidates. Maximal degree in co-relation 6286. Up to 404 conditions per place. [2025-03-04 02:29:51,095 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 158 selfloop transitions, 85 changer transitions 0/244 dead transitions. [2025-03-04 02:29:51,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 244 transitions, 3583 flow [2025-03-04 02:29:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:29:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:29:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2025-03-04 02:29:51,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-04 02:29:51,097 INFO L175 Difference]: Start difference. First operand has 179 places, 162 transitions, 2247 flow. Second operand 16 states and 148 transitions. [2025-03-04 02:29:51,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 244 transitions, 3583 flow [2025-03-04 02:29:51,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 244 transitions, 3324 flow, removed 73 selfloop flow, removed 15 redundant places. [2025-03-04 02:29:51,134 INFO L231 Difference]: Finished difference. Result has 164 places, 186 transitions, 2656 flow [2025-03-04 02:29:51,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2656, PETRI_PLACES=164, PETRI_TRANSITIONS=186} [2025-03-04 02:29:51,134 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2025-03-04 02:29:51,134 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 186 transitions, 2656 flow [2025-03-04 02:29:51,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:51,135 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:51,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:29:51,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:29:51,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 530544944, now seen corresponding path program 3 times [2025-03-04 02:29:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057246842] [2025-03-04 02:29:51,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:51,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:51,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:51,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:51,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:51,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:51,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057246842] [2025-03-04 02:29:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057246842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558664083] [2025-03-04 02:29:51,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:29:51,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:51,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:51,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:51,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:29:51,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:51,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:51,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:29:51,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:51,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:29:51,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:51,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558664083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:51,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 02:29:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940039614] [2025-03-04 02:29:51,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:51,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:29:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:51,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:29:51,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:29:51,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:51,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 186 transitions, 2656 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:51,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:51,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:51,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:52,021 INFO L124 PetriNetUnfolderBase]: 697/1381 cut-off events. [2025-03-04 02:29:52,021 INFO L125 PetriNetUnfolderBase]: For 14465/14465 co-relation queries the response was YES. [2025-03-04 02:29:52,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9866 conditions, 1381 events. 697/1381 cut-off events. For 14465/14465 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8213 event pairs, 36 based on Foata normal form. 8/1371 useless extension candidates. Maximal degree in co-relation 9793. Up to 498 conditions per place. [2025-03-04 02:29:52,031 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 154 selfloop transitions, 158 changer transitions 0/313 dead transitions. [2025-03-04 02:29:52,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 313 transitions, 4891 flow [2025-03-04 02:29:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:29:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:29:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2025-03-04 02:29:52,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2025-03-04 02:29:52,032 INFO L175 Difference]: Start difference. First operand has 164 places, 186 transitions, 2656 flow. Second operand 14 states and 143 transitions. [2025-03-04 02:29:52,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 313 transitions, 4891 flow [2025-03-04 02:29:52,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 313 transitions, 4670 flow, removed 85 selfloop flow, removed 6 redundant places. [2025-03-04 02:29:52,076 INFO L231 Difference]: Finished difference. Result has 178 places, 249 transitions, 4026 flow [2025-03-04 02:29:52,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2475, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4026, PETRI_PLACES=178, PETRI_TRANSITIONS=249} [2025-03-04 02:29:52,077 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2025-03-04 02:29:52,077 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 249 transitions, 4026 flow [2025-03-04 02:29:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:52,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:52,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:52,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:52,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:29:52,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:52,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash 425084804, now seen corresponding path program 4 times [2025-03-04 02:29:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915184431] [2025-03-04 02:29:52,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:52,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:52,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:52,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:52,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915184431] [2025-03-04 02:29:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915184431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:52,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597976669] [2025-03-04 02:29:52,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:29:52,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:52,457 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:52,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:29:52,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:52,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:52,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:29:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:52,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:29:52,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:52,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597976669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:52,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 02:29:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862800622] [2025-03-04 02:29:52,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:29:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:52,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:29:52,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:29:52,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:52,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 249 transitions, 4026 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:52,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:52,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:52,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:53,444 INFO L124 PetriNetUnfolderBase]: 679/1349 cut-off events. [2025-03-04 02:29:53,445 INFO L125 PetriNetUnfolderBase]: For 18747/18747 co-relation queries the response was YES. [2025-03-04 02:29:53,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10278 conditions, 1349 events. 679/1349 cut-off events. For 18747/18747 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7979 event pairs, 38 based on Foata normal form. 27/1370 useless extension candidates. Maximal degree in co-relation 10196. Up to 393 conditions per place. [2025-03-04 02:29:53,455 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 155 selfloop transitions, 180 changer transitions 0/336 dead transitions. [2025-03-04 02:29:53,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 336 transitions, 5607 flow [2025-03-04 02:29:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:29:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:29:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 208 transitions. [2025-03-04 02:29:53,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.416 [2025-03-04 02:29:53,456 INFO L175 Difference]: Start difference. First operand has 178 places, 249 transitions, 4026 flow. Second operand 25 states and 208 transitions. [2025-03-04 02:29:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 336 transitions, 5607 flow [2025-03-04 02:29:53,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 336 transitions, 5261 flow, removed 115 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:53,514 INFO L231 Difference]: Finished difference. Result has 202 places, 264 transitions, 4445 flow [2025-03-04 02:29:53,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3587, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4445, PETRI_PLACES=202, PETRI_TRANSITIONS=264} [2025-03-04 02:29:53,515 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 181 predicate places. [2025-03-04 02:29:53,515 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 264 transitions, 4445 flow [2025-03-04 02:29:53,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:53,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:53,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:53,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:29:53,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:29:53,720 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1404285624, now seen corresponding path program 5 times [2025-03-04 02:29:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759371254] [2025-03-04 02:29:53,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:53,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:53,734 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:53,734 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:53,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759371254] [2025-03-04 02:29:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759371254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963425590] [2025-03-04 02:29:53,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:29:53,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:53,815 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:53,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:29:53,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:29:53,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:29:53,883 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:29:53,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:53,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:29:53,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963425590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:53,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:29:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:29:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488945148] [2025-03-04 02:29:53,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:53,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:29:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:53,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:29:53,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:29:53,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:29:53,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 264 transitions, 4445 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:53,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:53,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:29:53,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:55,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:29:55,650 INFO L124 PetriNetUnfolderBase]: 742/1439 cut-off events. [2025-03-04 02:29:55,650 INFO L125 PetriNetUnfolderBase]: For 20436/20436 co-relation queries the response was YES. [2025-03-04 02:29:55,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11263 conditions, 1439 events. 742/1439 cut-off events. For 20436/20436 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8448 event pairs, 150 based on Foata normal form. 16/1446 useless extension candidates. Maximal degree in co-relation 11177. Up to 869 conditions per place. [2025-03-04 02:29:55,660 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 187 selfloop transitions, 139 changer transitions 0/327 dead transitions. [2025-03-04 02:29:55,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 327 transitions, 5942 flow [2025-03-04 02:29:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:29:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:29:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 124 transitions. [2025-03-04 02:29:55,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-04 02:29:55,662 INFO L175 Difference]: Start difference. First operand has 202 places, 264 transitions, 4445 flow. Second operand 14 states and 124 transitions. [2025-03-04 02:29:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 327 transitions, 5942 flow [2025-03-04 02:29:55,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 327 transitions, 5482 flow, removed 186 selfloop flow, removed 9 redundant places. [2025-03-04 02:29:55,737 INFO L231 Difference]: Finished difference. Result has 206 places, 289 transitions, 4949 flow [2025-03-04 02:29:55,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4002, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4949, PETRI_PLACES=206, PETRI_TRANSITIONS=289} [2025-03-04 02:29:55,738 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 185 predicate places. [2025-03-04 02:29:55,738 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 289 transitions, 4949 flow [2025-03-04 02:29:55,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:55,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:55,738 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:55,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:29:55,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:55,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:29:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1954272912, now seen corresponding path program 1 times [2025-03-04 02:29:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248984544] [2025-03-04 02:29:55,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:55,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:29:55,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:55,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:55,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:29:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248984544] [2025-03-04 02:29:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248984544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:29:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29800115] [2025-03-04 02:29:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:56,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:56,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:56,033 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:29:56,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:29:56,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:29:56,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:29:56,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:56,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:56,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 02:29:56,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:56,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:56,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:29:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:56,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29800115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:08,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:08,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 22 [2025-03-04 02:30:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812117952] [2025-03-04 02:30:08,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:08,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:30:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:08,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:30:08,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:30:08,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:08,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 289 transitions, 4949 flow. Second operand has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:08,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:08,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:08,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:20,561 INFO L124 PetriNetUnfolderBase]: 1041/1962 cut-off events. [2025-03-04 02:30:20,561 INFO L125 PetriNetUnfolderBase]: For 26999/26999 co-relation queries the response was YES. [2025-03-04 02:30:20,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15731 conditions, 1962 events. 1041/1962 cut-off events. For 26999/26999 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 11873 event pairs, 10 based on Foata normal form. 9/1971 useless extension candidates. Maximal degree in co-relation 15491. Up to 570 conditions per place. [2025-03-04 02:30:20,576 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 220 selfloop transitions, 341 changer transitions 10/572 dead transitions. [2025-03-04 02:30:20,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 572 transitions, 9810 flow [2025-03-04 02:30:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 02:30:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-04 02:30:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 345 transitions. [2025-03-04 02:30:20,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-04 02:30:20,578 INFO L175 Difference]: Start difference. First operand has 206 places, 289 transitions, 4949 flow. Second operand 42 states and 345 transitions. [2025-03-04 02:30:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 572 transitions, 9810 flow [2025-03-04 02:30:20,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 572 transitions, 9511 flow, removed 72 selfloop flow, removed 8 redundant places. [2025-03-04 02:30:20,745 INFO L231 Difference]: Finished difference. Result has 253 places, 439 transitions, 8561 flow [2025-03-04 02:30:20,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4760, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=8561, PETRI_PLACES=253, PETRI_TRANSITIONS=439} [2025-03-04 02:30:20,745 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 232 predicate places. [2025-03-04 02:30:20,745 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 439 transitions, 8561 flow [2025-03-04 02:30:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.863636363636363) internal successors, (107), 22 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:20,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:20,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:20,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:30:20,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:20,946 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:20,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1742288530, now seen corresponding path program 10 times [2025-03-04 02:30:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:20,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758835778] [2025-03-04 02:30:20,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:20,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:20,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:20,964 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:20,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758835778] [2025-03-04 02:30:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758835778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143081382] [2025-03-04 02:30:21,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:30:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:21,596 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:30:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:30:21,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:21,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:21,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:30:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:30:21,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:21,817 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2025-03-04 02:30:21,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 119 [2025-03-04 02:30:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:21,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:22,367 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-04 02:30:22,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 103 [2025-03-04 02:30:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143081382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:22,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-03-04 02:30:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687719540] [2025-03-04 02:30:22,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:30:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:22,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:30:22,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:30:22,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:22,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 439 transitions, 8561 flow. Second operand has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:22,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:22,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:22,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:26,476 INFO L124 PetriNetUnfolderBase]: 1100/2123 cut-off events. [2025-03-04 02:30:26,476 INFO L125 PetriNetUnfolderBase]: For 33900/33900 co-relation queries the response was YES. [2025-03-04 02:30:26,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18242 conditions, 2123 events. 1100/2123 cut-off events. For 33900/33900 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13511 event pairs, 11 based on Foata normal form. 3/2126 useless extension candidates. Maximal degree in co-relation 17966. Up to 1116 conditions per place. [2025-03-04 02:30:26,493 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 296 selfloop transitions, 261 changer transitions 5/563 dead transitions. [2025-03-04 02:30:26,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 563 transitions, 10860 flow [2025-03-04 02:30:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:30:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:30:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 290 transitions. [2025-03-04 02:30:26,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-03-04 02:30:26,495 INFO L175 Difference]: Start difference. First operand has 253 places, 439 transitions, 8561 flow. Second operand 34 states and 290 transitions. [2025-03-04 02:30:26,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 563 transitions, 10860 flow [2025-03-04 02:30:26,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 563 transitions, 10330 flow, removed 231 selfloop flow, removed 10 redundant places. [2025-03-04 02:30:26,695 INFO L231 Difference]: Finished difference. Result has 284 places, 483 transitions, 9697 flow [2025-03-04 02:30:26,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8114, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9697, PETRI_PLACES=284, PETRI_TRANSITIONS=483} [2025-03-04 02:30:26,696 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2025-03-04 02:30:26,696 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 483 transitions, 9697 flow [2025-03-04 02:30:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.090909090909091) internal successors, (112), 22 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:26,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:26,696 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:26,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:30:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:26,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:26,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1268202960, now seen corresponding path program 6 times [2025-03-04 02:30:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:26,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069910379] [2025-03-04 02:30:26,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:30:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:26,901 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:26,911 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:26,912 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:30:26,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069910379] [2025-03-04 02:30:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069910379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598531201] [2025-03-04 02:30:26,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:30:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:26,998 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:30:26,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:30:27,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:27,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:27,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:30:27,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:27,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:30:27,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:27,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598531201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:27,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 02:30:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718502501] [2025-03-04 02:30:27,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:27,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:27,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:27,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 483 transitions, 9697 flow. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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:30:27,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:27,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:28,062 INFO L124 PetriNetUnfolderBase]: 1102/2128 cut-off events. [2025-03-04 02:30:28,062 INFO L125 PetriNetUnfolderBase]: For 34800/34800 co-relation queries the response was YES. [2025-03-04 02:30:28,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18495 conditions, 2128 events. 1102/2128 cut-off events. For 34800/34800 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13529 event pairs, 121 based on Foata normal form. 15/2143 useless extension candidates. Maximal degree in co-relation 18272. Up to 590 conditions per place. [2025-03-04 02:30:28,080 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 306 selfloop transitions, 259 changer transitions 0/566 dead transitions. [2025-03-04 02:30:28,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 566 transitions, 11663 flow [2025-03-04 02:30:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:30:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 02:30:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 165 transitions. [2025-03-04 02:30:28,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:30:28,081 INFO L175 Difference]: Start difference. First operand has 284 places, 483 transitions, 9697 flow. Second operand 21 states and 165 transitions. [2025-03-04 02:30:28,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 566 transitions, 11663 flow [2025-03-04 02:30:28,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 566 transitions, 11213 flow, removed 141 selfloop flow, removed 13 redundant places. [2025-03-04 02:30:28,297 INFO L231 Difference]: Finished difference. Result has 296 places, 495 transitions, 10040 flow [2025-03-04 02:30:28,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=9293, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10040, PETRI_PLACES=296, PETRI_TRANSITIONS=495} [2025-03-04 02:30:28,297 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 275 predicate places. [2025-03-04 02:30:28,297 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 495 transitions, 10040 flow [2025-03-04 02:30:28,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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:30:28,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:28,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:28,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:30:28,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:28,498 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -842315532, now seen corresponding path program 7 times [2025-03-04 02:30:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892253984] [2025-03-04 02:30:28,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:30:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:28,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:30:28,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:28,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:28,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892253984] [2025-03-04 02:30:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892253984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503157662] [2025-03-04 02:30:28,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:30:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:28,631 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:30:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:30:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:30:28,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:28,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:28,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:28,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:30:28,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:28,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:30:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503157662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:30:28,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:30:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 02:30:28,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104352216] [2025-03-04 02:30:28,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:30:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:30:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:28,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:30:28,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:30:28,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-04 02:30:28,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 495 transitions, 10040 flow. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:28,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:28,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-04 02:30:28,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:30,047 INFO L124 PetriNetUnfolderBase]: 1198/2363 cut-off events. [2025-03-04 02:30:30,047 INFO L125 PetriNetUnfolderBase]: For 40130/40130 co-relation queries the response was YES. [2025-03-04 02:30:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20567 conditions, 2363 events. 1198/2363 cut-off events. For 40130/40130 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 15683 event pairs, 180 based on Foata normal form. 36/2399 useless extension candidates. Maximal degree in co-relation 20330. Up to 989 conditions per place. [2025-03-04 02:30:30,066 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 387 selfloop transitions, 245 changer transitions 0/633 dead transitions. [2025-03-04 02:30:30,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 633 transitions, 12959 flow [2025-03-04 02:30:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:30:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:30:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 251 transitions. [2025-03-04 02:30:30,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44821428571428573 [2025-03-04 02:30:30,067 INFO L175 Difference]: Start difference. First operand has 296 places, 495 transitions, 10040 flow. Second operand 28 states and 251 transitions. [2025-03-04 02:30:30,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 633 transitions, 12959 flow [2025-03-04 02:30:30,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 633 transitions, 12599 flow, removed 91 selfloop flow, removed 7 redundant places. [2025-03-04 02:30:30,347 INFO L231 Difference]: Finished difference. Result has 324 places, 545 transitions, 11577 flow [2025-03-04 02:30:30,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=9654, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=11577, PETRI_PLACES=324, PETRI_TRANSITIONS=545} [2025-03-04 02:30:30,348 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 303 predicate places. [2025-03-04 02:30:30,348 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 545 transitions, 11577 flow [2025-03-04 02:30:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:30,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:30,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:30,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:30:30,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:30,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:30:30,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 855150990, now seen corresponding path program 11 times [2025-03-04 02:30:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:30,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234502971] [2025-03-04 02:30:30,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:30,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:30,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:30,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:30,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234502971] [2025-03-04 02:30:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234502971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:30:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208050879] [2025-03-04 02:30:31,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:30:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:30:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:31,290 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:30:31,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:30:31,338 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:30:31,367 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:30:31,367 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:30:31,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:31,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:30:31,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:30:31,597 INFO L349 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2025-03-04 02:30:31,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 114 [2025-03-04 02:30:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:30:31,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:30:32,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:30:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 155