./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/pthread/queue_longer.i -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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:24:47,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:24:47,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:24:47,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:24:47,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:24:47,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:24:47,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:24:47,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:24:47,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:24:47,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:24:47,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:24:47,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:24:47,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:24:47,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:24:47,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:24:47,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:24:47,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:24:47,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:24:47,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:24:47,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:24:47,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:24:47,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:24:47,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:24:47,234 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-13 21:24:47,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:24:47,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:24:47,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:24:47,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:24:47,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:24:47,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-13 21:24:48,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc1ab0d0/d19f7a42acd54e00b07c0043a9b2aad0/FLAG4c0bed59d [2025-03-13 21:24:48,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:24:48,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-13 21:24:48,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc1ab0d0/d19f7a42acd54e00b07c0043a9b2aad0/FLAG4c0bed59d [2025-03-13 21:24:48,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc1ab0d0/d19f7a42acd54e00b07c0043a9b2aad0 [2025-03-13 21:24:48,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:24:48,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:24:48,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:24:48,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:24:48,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:24:48,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:24:48" (1/1) ... [2025-03-13 21:24:48,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a27154f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:48, skipping insertion in model container [2025-03-13 21:24:48,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:24:48" (1/1) ... [2025-03-13 21:24:48,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:24:49,147 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/pthread/queue_longer.i[43296,43309] [2025-03-13 21:24:49,153 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/pthread/queue_longer.i[43503,43516] [2025-03-13 21:24:49,157 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/pthread/queue_longer.i[43783,43796] [2025-03-13 21:24:49,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:24:49,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:24:49,223 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/pthread/queue_longer.i[43296,43309] [2025-03-13 21:24:49,227 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/pthread/queue_longer.i[43503,43516] [2025-03-13 21:24:49,229 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/pthread/queue_longer.i[43783,43796] [2025-03-13 21:24:49,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:24:49,314 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:24:49,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49 WrapperNode [2025-03-13 21:24:49,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:24:49,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:24:49,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:24:49,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:24:49,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,393 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1034 [2025-03-13 21:24:49,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:24:49,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:24:49,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:24:49,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:24:49,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,442 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-03-13 21:24:49,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:24:49,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:24:49,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:24:49,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:24:49,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (1/1) ... [2025-03-13 21:24:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:24:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:24:49,508 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-13 21:24:49,511 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-13 21:24:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:24:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:24:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:24:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:24:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:24:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:24:49,528 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:24:49,633 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:24:49,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:24:50,600 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:24:50,601 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:24:50,601 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:25:01,213 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:25:01,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:25:01 BoogieIcfgContainer [2025-03-13 21:25:01,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:25:01,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:25:01,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:25:01,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:25:01,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:24:48" (1/3) ... [2025-03-13 21:25:01,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130cf136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:25:01, skipping insertion in model container [2025-03-13 21:25:01,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:49" (2/3) ... [2025-03-13 21:25:01,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130cf136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:25:01, skipping insertion in model container [2025-03-13 21:25:01,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:25:01" (3/3) ... [2025-03-13 21:25:01,221 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-13 21:25:01,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:25:01,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 41 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-13 21:25:01,238 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:25:01,545 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:25:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2025-03-13 21:25:01,604 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-03-13 21:25:01,608 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:25:01,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-13 21:25:01,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2025-03-13 21:25:01,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2025-03-13 21:25:01,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:25:01,634 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;@4898398f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:25:01,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:25:01,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:25:01,650 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-13 21:25:01,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:25:01,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:01,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-13 21:25:01,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2152289, now seen corresponding path program 1 times [2025-03-13 21:25:01,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129798990] [2025-03-13 21:25:01,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-13 21:25:01,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-13 21:25:01,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:02,042 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-13 21:25:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129798990] [2025-03-13 21:25:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129798990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:25:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107035501] [2025-03-13 21:25:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:25:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:02,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:25:02,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:25:02,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:02,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 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-13 21:25:02,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:02,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:02,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:02,335 INFO L124 PetriNetUnfolderBase]: 425/775 cut-off events. [2025-03-13 21:25:02,336 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 21:25:02,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 775 events. 425/775 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3498 event pairs, 331 based on Foata normal form. 47/740 useless extension candidates. Maximal degree in co-relation 1446. Up to 692 conditions per place. [2025-03-13 21:25:02,342 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-03-13 21:25:02,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2025-03-13 21:25:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:25:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:25:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-03-13 21:25:02,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-03-13 21:25:02,353 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2025-03-13 21:25:02,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2025-03-13 21:25:02,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:25:02,358 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2025-03-13 21:25:02,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-03-13 21:25:02,362 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-03-13 21:25:02,364 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2025-03-13 21:25:02,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 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-13 21:25:02,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:02,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:25:02,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -433540034, now seen corresponding path program 1 times [2025-03-13 21:25:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527917897] [2025-03-13 21:25:02,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:25:02,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:25:02,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:02,773 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-13 21:25:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527917897] [2025-03-13 21:25:02,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527917897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:02,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:25:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145550808] [2025-03-13 21:25:02,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:02,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:25:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:02,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:25:02,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:25:02,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:02,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 21:25:02,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:02,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:02,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:03,016 INFO L124 PetriNetUnfolderBase]: 405/753 cut-off events. [2025-03-13 21:25:03,016 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 21:25:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 753 events. 405/753 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3493 event pairs, 304 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 1451. Up to 623 conditions per place. [2025-03-13 21:25:03,021 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-13 21:25:03,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2025-03-13 21:25:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:25:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:25:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-13 21:25:03,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-03-13 21:25:03,023 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2025-03-13 21:25:03,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2025-03-13 21:25:03,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:25:03,025 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2025-03-13 21:25:03,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-13 21:25:03,026 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-13 21:25:03,026 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2025-03-13 21:25:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 21:25:03,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:03,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:03,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:25:03,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:03,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash -554835980, now seen corresponding path program 1 times [2025-03-13 21:25:03,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753461723] [2025-03-13 21:25:03,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:03,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:25:03,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:25:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:03,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:04,134 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-13 21:25:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753461723] [2025-03-13 21:25:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753461723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:04,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:04,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:25:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534791231] [2025-03-13 21:25:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:04,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:25:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:04,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:25:04,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:25:04,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:04,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-13 21:25:04,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:04,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:04,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:04,566 INFO L124 PetriNetUnfolderBase]: 674/1248 cut-off events. [2025-03-13 21:25:04,566 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-13 21:25:04,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 1248 events. 674/1248 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6205 event pairs, 74 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 2430. Up to 658 conditions per place. [2025-03-13 21:25:04,572 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2025-03-13 21:25:04,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2025-03-13 21:25:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:25:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:25:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-13 21:25:04,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2025-03-13 21:25:04,575 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2025-03-13 21:25:04,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2025-03-13 21:25:04,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:25:04,577 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2025-03-13 21:25:04,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-03-13 21:25:04,579 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-03-13 21:25:04,579 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2025-03-13 21:25:04,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-13 21:25:04,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:04,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:25:04,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1847716122, now seen corresponding path program 1 times [2025-03-13 21:25:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132763021] [2025-03-13 21:25:04,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:04,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:25:04,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:25:04,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:04,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:04,779 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-13 21:25:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:04,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132763021] [2025-03-13 21:25:04,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132763021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:04,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:04,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:25:04,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106908144] [2025-03-13 21:25:04,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:04,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:25:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:04,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:25:04,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:25:04,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:04,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:04,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:04,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:04,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:04,942 INFO L124 PetriNetUnfolderBase]: 419/814 cut-off events. [2025-03-13 21:25:04,943 INFO L125 PetriNetUnfolderBase]: For 112/116 co-relation queries the response was YES. [2025-03-13 21:25:04,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 814 events. 419/814 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3576 event pairs, 215 based on Foata normal form. 32/828 useless extension candidates. Maximal degree in co-relation 1673. Up to 417 conditions per place. [2025-03-13 21:25:04,945 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2025-03-13 21:25:04,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2025-03-13 21:25:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:25:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:25:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-13 21:25:04,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2025-03-13 21:25:04,947 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2025-03-13 21:25:04,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2025-03-13 21:25:04,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:25:04,949 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2025-03-13 21:25:04,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-03-13 21:25:04,950 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-13 21:25:04,950 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2025-03-13 21:25:04,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:04,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:04,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:04,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:25:04,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:04,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -478674635, now seen corresponding path program 1 times [2025-03-13 21:25:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:04,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514845018] [2025-03-13 21:25:04,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:04,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:25:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:25:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:05,144 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-13 21:25:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514845018] [2025-03-13 21:25:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514845018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:25:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781685659] [2025-03-13 21:25:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:25:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:05,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:25:05,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:25:05,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:05,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:05,329 INFO L124 PetriNetUnfolderBase]: 249/547 cut-off events. [2025-03-13 21:25:05,329 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-13 21:25:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 547 events. 249/547 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 85 based on Foata normal form. 32/572 useless extension candidates. Maximal degree in co-relation 1126. Up to 252 conditions per place. [2025-03-13 21:25:05,334 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-03-13 21:25:05,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2025-03-13 21:25:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:25:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:25:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-13 21:25:05,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-03-13 21:25:05,335 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2025-03-13 21:25:05,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2025-03-13 21:25:05,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:25:05,336 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2025-03-13 21:25:05,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-03-13 21:25:05,337 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-03-13 21:25:05,337 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2025-03-13 21:25:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:05,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:05,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:25:05,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1280066349, now seen corresponding path program 1 times [2025-03-13 21:25:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976615072] [2025-03-13 21:25:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:25:05,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:25:05,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:05,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:07,777 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-13 21:25:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976615072] [2025-03-13 21:25:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976615072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:07,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:25:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530316060] [2025-03-13 21:25:07,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:07,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:25:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:07,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:25:07,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:25:07,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:07,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:07,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:07,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:07,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:08,526 INFO L124 PetriNetUnfolderBase]: 357/786 cut-off events. [2025-03-13 21:25:08,526 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-13 21:25:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 786 events. 357/786 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3758 event pairs, 77 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1701. Up to 264 conditions per place. [2025-03-13 21:25:08,530 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 65 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2025-03-13 21:25:08,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 455 flow [2025-03-13 21:25:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:25:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:25:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-03-13 21:25:08,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-03-13 21:25:08,531 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2025-03-13 21:25:08,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 455 flow [2025-03-13 21:25:08,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:25:08,533 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 202 flow [2025-03-13 21:25:08,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-03-13 21:25:08,534 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-03-13 21:25:08,534 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 202 flow [2025-03-13 21:25:08,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:08,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:08,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:08,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:25:08,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 279220145, now seen corresponding path program 2 times [2025-03-13 21:25:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361637584] [2025-03-13 21:25:08,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:25:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:08,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:25:08,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:25:08,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:25:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:10,774 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-13 21:25:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361637584] [2025-03-13 21:25:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361637584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:25:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603151204] [2025-03-13 21:25:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:25:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:10,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:25:10,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:25:10,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:10,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:10,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:10,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:11,264 INFO L124 PetriNetUnfolderBase]: 466/1039 cut-off events. [2025-03-13 21:25:11,264 INFO L125 PetriNetUnfolderBase]: For 798/800 co-relation queries the response was YES. [2025-03-13 21:25:11,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1039 events. 466/1039 cut-off events. For 798/800 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5769 event pairs, 129 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 2681. Up to 607 conditions per place. [2025-03-13 21:25:11,269 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2025-03-13 21:25:11,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 568 flow [2025-03-13 21:25:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:25:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:25:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2025-03-13 21:25:11,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3947990543735225 [2025-03-13 21:25:11,270 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 202 flow. Second operand 9 states and 167 transitions. [2025-03-13 21:25:11,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 568 flow [2025-03-13 21:25:11,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 550 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:25:11,274 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 347 flow [2025-03-13 21:25:11,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-13 21:25:11,274 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-03-13 21:25:11,274 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 347 flow [2025-03-13 21:25:11,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:11,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:11,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:11,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:25:11,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -952647209, now seen corresponding path program 3 times [2025-03-13 21:25:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164205412] [2025-03-13 21:25:11,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:25:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:11,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:25:11,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:25:11,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:25:11,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:12,676 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-13 21:25:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164205412] [2025-03-13 21:25:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164205412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:25:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470950529] [2025-03-13 21:25:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:12,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:25:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:12,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:25:12,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:25:12,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-03-13 21:25:12,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 347 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:12,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:12,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-03-13 21:25:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:13,271 INFO L124 PetriNetUnfolderBase]: 586/1285 cut-off events. [2025-03-13 21:25:13,272 INFO L125 PetriNetUnfolderBase]: For 1635/1637 co-relation queries the response was YES. [2025-03-13 21:25:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1285 events. 586/1285 cut-off events. For 1635/1637 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7329 event pairs, 58 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 3591. Up to 293 conditions per place. [2025-03-13 21:25:13,278 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 89 selfloop transitions, 32 changer transitions 6/133 dead transitions. [2025-03-13 21:25:13,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 133 transitions, 882 flow [2025-03-13 21:25:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:25:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:25:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 231 transitions. [2025-03-13 21:25:13,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4095744680851064 [2025-03-13 21:25:13,279 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 347 flow. Second operand 12 states and 231 transitions. [2025-03-13 21:25:13,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 133 transitions, 882 flow [2025-03-13 21:25:13,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 836 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-13 21:25:13,286 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 465 flow [2025-03-13 21:25:13,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=465, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2025-03-13 21:25:13,287 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-13 21:25:13,287 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 465 flow [2025-03-13 21:25:13,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-13 21:25:13,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:13,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:13,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:25:13,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -72798741, now seen corresponding path program 4 times [2025-03-13 21:25:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500681732] [2025-03-13 21:25:13,288 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:25:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:13,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:25:13,379 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:25:13,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:25:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:14,788 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-13 21:25:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500681732] [2025-03-13 21:25:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500681732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:25:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:25:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:25:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994167566] [2025-03-13 21:25:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:25:14,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:25:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:14,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:25:14,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:25:14,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-13 21:25:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 465 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-13 21:25:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-13 21:25:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:15,563 INFO L124 PetriNetUnfolderBase]: 748/1587 cut-off events. [2025-03-13 21:25:15,563 INFO L125 PetriNetUnfolderBase]: For 2892/2892 co-relation queries the response was YES. [2025-03-13 21:25:15,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 1587 events. 748/1587 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9119 event pairs, 193 based on Foata normal form. 7/1587 useless extension candidates. Maximal degree in co-relation 4747. Up to 734 conditions per place. [2025-03-13 21:25:15,571 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 93 selfloop transitions, 22 changer transitions 8/128 dead transitions. [2025-03-13 21:25:15,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 965 flow [2025-03-13 21:25:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:25:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:25:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2025-03-13 21:25:15,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-03-13 21:25:15,572 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 465 flow. Second operand 9 states and 177 transitions. [2025-03-13 21:25:15,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 965 flow [2025-03-13 21:25:15,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 893 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-13 21:25:15,579 INFO L231 Difference]: Finished difference. Result has 88 places, 80 transitions, 606 flow [2025-03-13 21:25:15,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=88, PETRI_TRANSITIONS=80} [2025-03-13 21:25:15,580 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2025-03-13 21:25:15,580 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 606 flow [2025-03-13 21:25:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-13 21:25:15,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:15,580 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:25:15,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash -520706843, now seen corresponding path program 1 times [2025-03-13 21:25:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222900340] [2025-03-13 21:25:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:15,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:25:15,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:15,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:15,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:17,204 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-13 21:25:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222900340] [2025-03-13 21:25:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222900340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327047588] [2025-03-13 21:25:17,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:17,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:17,207 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-13 21:25:17,207 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-13 21:25:17,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:25:17,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:17,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:17,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:17,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 21:25:17,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:17,501 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 29 treesize of output 19 [2025-03-13 21:25:17,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:17,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2025-03-13 21:25:17,621 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 11 treesize of output 7 [2025-03-13 21:25:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:25:17,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:25:17,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:17,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 59 [2025-03-13 21:25:18,641 INFO L349 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2025-03-13 21:25:18,641 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 65 [2025-03-13 21:25:18,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:18,648 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 59 treesize of output 49 [2025-03-13 21:25:18,701 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-13 21:25:18,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:19,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:19,165 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:19,222 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:19,222 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:21,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:21,984 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:21,996 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:21,996 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:22,754 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 13 [2025-03-13 21:25:22,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 18 [2025-03-13 21:25:22,766 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 23 treesize of output 21 [2025-03-13 21:25:22,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 54 [2025-03-13 21:25:22,809 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 23 treesize of output 21 [2025-03-13 21:25:22,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 54 [2025-03-13 21:25:22,844 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 23 treesize of output 21 [2025-03-13 21:25:22,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 54 [2025-03-13 21:25:22,881 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 23 treesize of output 21 [2025-03-13 21:25:22,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 54 [2025-03-13 21:25:22,927 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 13 [2025-03-13 21:25:22,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 18 [2025-03-13 21:25:24,329 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-13 21:25:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327047588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:24,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:25:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786315918] [2025-03-13 21:25:24,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:25:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:25:24,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:25:24,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-13 21:25:24,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 606 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:24,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:24,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-13 21:25:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:26,998 INFO L124 PetriNetUnfolderBase]: 836/1775 cut-off events. [2025-03-13 21:25:26,998 INFO L125 PetriNetUnfolderBase]: For 3866/3868 co-relation queries the response was YES. [2025-03-13 21:25:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5555 conditions, 1775 events. 836/1775 cut-off events. For 3866/3868 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10777 event pairs, 204 based on Foata normal form. 0/1768 useless extension candidates. Maximal degree in co-relation 5526. Up to 1113 conditions per place. [2025-03-13 21:25:27,008 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 109 selfloop transitions, 26 changer transitions 4/144 dead transitions. [2025-03-13 21:25:27,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 144 transitions, 1135 flow [2025-03-13 21:25:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:25:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:25:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2025-03-13 21:25:27,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3723404255319149 [2025-03-13 21:25:27,011 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 606 flow. Second operand 12 states and 210 transitions. [2025-03-13 21:25:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 144 transitions, 1135 flow [2025-03-13 21:25:27,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 144 transitions, 1067 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-03-13 21:25:27,021 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 711 flow [2025-03-13 21:25:27,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=711, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2025-03-13 21:25:27,023 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2025-03-13 21:25:27,023 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 711 flow [2025-03-13 21:25:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:27,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:27,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:27,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:25:27,224 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,SelfDestructingSolverStorable9 [2025-03-13 21:25:27,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 734475485, now seen corresponding path program 2 times [2025-03-13 21:25:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323675082] [2025-03-13 21:25:27,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:25:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:27,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:27,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:27,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:25:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:29,885 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-13 21:25:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323675082] [2025-03-13 21:25:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323675082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497010267] [2025-03-13 21:25:29,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:25:29,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:29,888 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-13 21:25:29,889 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-13 21:25:29,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:31,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:31,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:25:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:31,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-13 21:25:31,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:31,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:25:31,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:31,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 38 [2025-03-13 21:25:31,575 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 11 treesize of output 7 [2025-03-13 21:25:31,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:25:31,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:25:31,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 61 [2025-03-13 21:25:32,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:25:32,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:32,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2025-03-13 21:25:32,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:32,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 24 [2025-03-13 21:25:32,173 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-13 21:25:32,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:32,491 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:32,491 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:32,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:32,501 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:34,121 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:34,121 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:34,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:34,131 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:35,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:35,387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:35,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:35,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1416 treesize of output 923 [2025-03-13 21:25:36,207 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-13 21:25:36,224 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-13 21:25:36,785 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-13 21:25:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497010267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:36,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:36,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:25:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438899714] [2025-03-13 21:25:36,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:36,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:25:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:36,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:25:36,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:25:37,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-13 21:25:37,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 711 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:37,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:37,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-13 21:25:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:40,473 INFO L124 PetriNetUnfolderBase]: 1031/2139 cut-off events. [2025-03-13 21:25:40,474 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2025-03-13 21:25:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 2139 events. 1031/2139 cut-off events. For 5732/5732 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12759 event pairs, 110 based on Foata normal form. 22/2154 useless extension candidates. Maximal degree in co-relation 7353. Up to 750 conditions per place. [2025-03-13 21:25:40,485 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 124 selfloop transitions, 64 changer transitions 9/202 dead transitions. [2025-03-13 21:25:40,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 202 transitions, 1711 flow [2025-03-13 21:25:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:25:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:25:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 282 transitions. [2025-03-13 21:25:40,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-13 21:25:40,487 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 711 flow. Second operand 16 states and 282 transitions. [2025-03-13 21:25:40,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 202 transitions, 1711 flow [2025-03-13 21:25:40,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 202 transitions, 1657 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-13 21:25:40,501 INFO L231 Difference]: Finished difference. Result has 118 places, 129 transitions, 1235 flow [2025-03-13 21:25:40,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1235, PETRI_PLACES=118, PETRI_TRANSITIONS=129} [2025-03-13 21:25:40,502 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places. [2025-03-13 21:25:40,502 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 129 transitions, 1235 flow [2025-03-13 21:25:40,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:40,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:40,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:40,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:25:40,703 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,SelfDestructingSolverStorable10 [2025-03-13 21:25:40,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1637472397, now seen corresponding path program 3 times [2025-03-13 21:25:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817974627] [2025-03-13 21:25:40,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:25:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:40,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:40,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:40,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:25:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:25:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817974627] [2025-03-13 21:25:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817974627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39607080] [2025-03-13 21:25:42,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:25:42,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:42,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:42,728 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-13 21:25:42,729 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-13 21:25:42,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:43,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:43,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:25:43,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:43,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 21:25:43,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:43,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-13 21:25:43,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:43,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 38 [2025-03-13 21:25:43,371 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 11 treesize of output 7 [2025-03-13 21:25:43,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:25:43,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:25:43,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2025-03-13 21:25:44,365 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-13 21:25:44,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 85 [2025-03-13 21:25:44,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:44,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 55 [2025-03-13 21:25:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:25:44,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:44,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:44,620 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:44,632 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:44,632 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:46,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:46,960 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:46,968 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:46,968 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:48,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:48,169 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:25:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39607080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:48,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:25:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137115861] [2025-03-13 21:25:48,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:25:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:25:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:25:49,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-13 21:25:49,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 129 transitions, 1235 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:49,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:49,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-13 21:25:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:55,597 INFO L124 PetriNetUnfolderBase]: 1427/2934 cut-off events. [2025-03-13 21:25:55,597 INFO L125 PetriNetUnfolderBase]: For 12587/12587 co-relation queries the response was YES. [2025-03-13 21:25:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11492 conditions, 2934 events. 1427/2934 cut-off events. For 12587/12587 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 18725 event pairs, 157 based on Foata normal form. 32/2952 useless extension candidates. Maximal degree in co-relation 11451. Up to 613 conditions per place. [2025-03-13 21:25:55,624 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 192 selfloop transitions, 105 changer transitions 6/308 dead transitions. [2025-03-13 21:25:55,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 308 transitions, 3091 flow [2025-03-13 21:25:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:25:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:25:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 384 transitions. [2025-03-13 21:25:55,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3890577507598784 [2025-03-13 21:25:55,628 INFO L175 Difference]: Start difference. First operand has 118 places, 129 transitions, 1235 flow. Second operand 21 states and 384 transitions. [2025-03-13 21:25:55,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 308 transitions, 3091 flow [2025-03-13 21:25:55,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 308 transitions, 2855 flow, removed 110 selfloop flow, removed 3 redundant places. [2025-03-13 21:25:55,660 INFO L231 Difference]: Finished difference. Result has 147 places, 179 transitions, 1982 flow [2025-03-13 21:25:55,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1982, PETRI_PLACES=147, PETRI_TRANSITIONS=179} [2025-03-13 21:25:55,662 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2025-03-13 21:25:55,663 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 179 transitions, 1982 flow [2025-03-13 21:25:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:25:55,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:55,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:55,677 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-13 21:25:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:55,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1247122637, now seen corresponding path program 4 times [2025-03-13 21:25:55,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:55,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34374332] [2025-03-13 21:25:55,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:25:55,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:55,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:56,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:56,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:25:56,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:25:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34374332] [2025-03-13 21:25:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34374332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:57,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320709971] [2025-03-13 21:25:57,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:25:57,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:57,873 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-13 21:25:57,874 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-13 21:25:57,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:25:58,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:58,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:25:58,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:58,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-13 21:25:58,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:58,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-13 21:25:58,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-03-13 21:25:58,242 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 11 treesize of output 7 [2025-03-13 21:25:58,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:58,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2025-03-13 21:25:58,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-13 21:25:58,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:58,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2025-03-13 21:25:58,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:58,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 21 [2025-03-13 21:25:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:25:58,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:58,947 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:58,947 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:58,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:58,969 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:59,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:59,793 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 60 [2025-03-13 21:26:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320709971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:01,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:26:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305462623] [2025-03-13 21:26:01,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:01,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:26:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:26:01,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:26:01,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-03-13 21:26:01,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 179 transitions, 1982 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:26:01,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:01,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-03-13 21:26:01,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:05,155 INFO L124 PetriNetUnfolderBase]: 1268/2662 cut-off events. [2025-03-13 21:26:05,156 INFO L125 PetriNetUnfolderBase]: For 19545/19545 co-relation queries the response was YES. [2025-03-13 21:26:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12004 conditions, 2662 events. 1268/2662 cut-off events. For 19545/19545 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 16644 event pairs, 38 based on Foata normal form. 100/2748 useless extension candidates. Maximal degree in co-relation 11950. Up to 452 conditions per place. [2025-03-13 21:26:05,177 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 173 selfloop transitions, 121 changer transitions 6/305 dead transitions. [2025-03-13 21:26:05,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 305 transitions, 3390 flow [2025-03-13 21:26:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-13 21:26:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-13 21:26:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 417 transitions. [2025-03-13 21:26:05,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3696808510638298 [2025-03-13 21:26:05,179 INFO L175 Difference]: Start difference. First operand has 147 places, 179 transitions, 1982 flow. Second operand 24 states and 417 transitions. [2025-03-13 21:26:05,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 305 transitions, 3390 flow [2025-03-13 21:26:05,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 305 transitions, 3123 flow, removed 110 selfloop flow, removed 11 redundant places. [2025-03-13 21:26:05,224 INFO L231 Difference]: Finished difference. Result has 162 places, 187 transitions, 2250 flow [2025-03-13 21:26:05,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2250, PETRI_PLACES=162, PETRI_TRANSITIONS=187} [2025-03-13 21:26:05,224 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2025-03-13 21:26:05,224 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 187 transitions, 2250 flow [2025-03-13 21:26:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-13 21:26:05,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:05,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:05,234 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-13 21:26:05,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:05,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:26:05,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash 470343301, now seen corresponding path program 5 times [2025-03-13 21:26:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805008822] [2025-03-13 21:26:05,426 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:26:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:05,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:26:05,550 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:26:05,550 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:05,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:07,315 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-13 21:26:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805008822] [2025-03-13 21:26:07,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805008822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547607449] [2025-03-13 21:26:07,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:26:07,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:07,317 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-13 21:26:07,318 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-13 21:26:07,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:26:07,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:26:07,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:07,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:07,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-13 21:26:07,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:07,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-13 21:26:07,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:26:07,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2025-03-13 21:26:07,715 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 11 treesize of output 7 [2025-03-13 21:26:07,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:26:07,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:26:07,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:26:07,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2025-03-13 21:26:08,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:26:08,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:26:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-03-13 21:26:08,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:26:08,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 21 [2025-03-13 21:26:08,250 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-13 21:26:08,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:08,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:26:08,584 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:26:08,597 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:26:08,597 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18