./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:03,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:03,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:13:03,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:03,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:03,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:03,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:03,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:03,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:03,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:03,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:03,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:03,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:03,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:03,176 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:03,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:03,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:03,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:03,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:03,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:03,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:03,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:03,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:03,179 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-jdk21/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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-02-08 01:13:03,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:03,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:03,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:03,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:03,413 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:03,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-08 01:13:04,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91895294d/2c553e8477444ae8928af987b46fa274/FLAG5b0d61ff7 [2025-02-08 01:13:04,840 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:04,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-02-08 01:13:04,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91895294d/2c553e8477444ae8928af987b46fa274/FLAG5b0d61ff7 [2025-02-08 01:13:05,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91895294d/2c553e8477444ae8928af987b46fa274 [2025-02-08 01:13:05,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:05,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:05,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:05,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:05,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:05,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601179c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05, skipping insertion in model container [2025-02-08 01:13:05,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:05,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-02-08 01:13:05,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:05,353 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:05,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-02-08 01:13:05,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:05,391 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:05,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05 WrapperNode [2025-02-08 01:13:05,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:05,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:05,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:05,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:05,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,435 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-02-08 01:13:05,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:05,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:05,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:05,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:05,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,474 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 01:13:05,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:05,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:05,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:05,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:05,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (1/1) ... [2025-02-08 01:13:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:05,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:13:05,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:13:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:05,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:05,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:13:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:13:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:13:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:13:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:13:05,554 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:13:05,647 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:05,649 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:05,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: #t~ite21#1 := #t~ret20#1; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-9: #t~ret20#1 := minus_#res#1; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: #t~ite19#1 := #t~ret18#1; [2025-02-08 01:13:05,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret18#1 && #t~ret18#1 <= 2147483647; [2025-02-08 01:13:05,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:05,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:05,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: #t~ret18#1 := minus_#res#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-5: #t~ite43#1 := #t~ret42#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-9: #t~ret42#1 := minus_#res#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-3: #t~ite41#1 := #t~ret40#1; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret40#1 && #t~ret40#1 <= 2147483647; [2025-02-08 01:13:06,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:06,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:06,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: #t~ret40#1 := minus_#res#1; [2025-02-08 01:13:06,220 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:06,220 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:06,598 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:06,599 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:06,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:06 BoogieIcfgContainer [2025-02-08 01:13:06,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:06,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:06,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:06,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:06,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:05" (1/3) ... [2025-02-08 01:13:06,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65afe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:06, skipping insertion in model container [2025-02-08 01:13:06,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:05" (2/3) ... [2025-02-08 01:13:06,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65afe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:06, skipping insertion in model container [2025-02-08 01:13:06,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:06" (3/3) ... [2025-02-08 01:13:06,610 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-02-08 01:13:06,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:06,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 39 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:13:06,624 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:06,703 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:13:06,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 48 transitions, 110 flow [2025-02-08 01:13:06,811 INFO L124 PetriNetUnfolderBase]: 10/46 cut-off events. [2025-02-08 01:13:06,813 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:06,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 10/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-08 01:13:06,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 48 transitions, 110 flow [2025-02-08 01:13:06,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 45 transitions, 102 flow [2025-02-08 01:13:06,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:06,842 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;@39ba9b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:06,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:13:06,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:06,852 INFO L124 PetriNetUnfolderBase]: 10/44 cut-off events. [2025-02-08 01:13:06,852 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:06,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,853 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] [2025-02-08 01:13:06,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2024563318, now seen corresponding path program 1 times [2025-02-08 01:13:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211745254] [2025-02-08 01:13:06,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:13:06,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:13:06,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:07,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211745254] [2025-02-08 01:13:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211745254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456155519] [2025-02-08 01:13:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:07,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:07,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:07,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:07,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:07,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:07,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:07,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:07,468 INFO L124 PetriNetUnfolderBase]: 647/1071 cut-off events. [2025-02-08 01:13:07,469 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 01:13:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 1071 events. 647/1071 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5068 event pairs, 203 based on Foata normal form. 17/869 useless extension candidates. Maximal degree in co-relation 2056. Up to 793 conditions per place. [2025-02-08 01:13:07,475 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 50 selfloop transitions, 4 changer transitions 6/63 dead transitions. [2025-02-08 01:13:07,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 267 flow [2025-02-08 01:13:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-08 01:13:07,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-02-08 01:13:07,490 INFO L175 Difference]: Start difference. First operand has 42 places, 45 transitions, 102 flow. Second operand 3 states and 79 transitions. [2025-02-08 01:13:07,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 267 flow [2025-02-08 01:13:07,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 253 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:07,501 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 118 flow [2025-02-08 01:13:07,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-02-08 01:13:07,506 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-02-08 01:13:07,508 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 118 flow [2025-02-08 01:13:07,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:07,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:07,509 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] [2025-02-08 01:13:07,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:07,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:07,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1538709228, now seen corresponding path program 2 times [2025-02-08 01:13:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560590811] [2025-02-08 01:13:07,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:07,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:13:07,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:13:07,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:07,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560590811] [2025-02-08 01:13:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560590811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814298977] [2025-02-08 01:13:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:07,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:07,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:07,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:07,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:07,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:07,808 INFO L124 PetriNetUnfolderBase]: 496/866 cut-off events. [2025-02-08 01:13:07,808 INFO L125 PetriNetUnfolderBase]: For 220/224 co-relation queries the response was YES. [2025-02-08 01:13:07,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 866 events. 496/866 cut-off events. For 220/224 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3869 event pairs, 149 based on Foata normal form. 42/860 useless extension candidates. Maximal degree in co-relation 437. Up to 654 conditions per place. [2025-02-08 01:13:07,815 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 54 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-08 01:13:07,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 297 flow [2025-02-08 01:13:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-08 01:13:07,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2025-02-08 01:13:07,818 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 118 flow. Second operand 3 states and 71 transitions. [2025-02-08 01:13:07,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 297 flow [2025-02-08 01:13:07,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 63 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:07,820 INFO L231 Difference]: Finished difference. Result has 41 places, 49 transitions, 184 flow [2025-02-08 01:13:07,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=49} [2025-02-08 01:13:07,823 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-02-08 01:13:07,823 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 49 transitions, 184 flow [2025-02-08 01:13:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:07,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:07,823 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] [2025-02-08 01:13:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:07,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1751003887, now seen corresponding path program 1 times [2025-02-08 01:13:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110343265] [2025-02-08 01:13:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:13:07,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:13:07,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:07,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110343265] [2025-02-08 01:13:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110343265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:13:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939827802] [2025-02-08 01:13:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:08,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:08,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:08,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:08,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 49 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,165 INFO L124 PetriNetUnfolderBase]: 496/878 cut-off events. [2025-02-08 01:13:08,165 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-02-08 01:13:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 878 events. 496/878 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3977 event pairs, 384 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 486. Up to 852 conditions per place. [2025-02-08 01:13:08,171 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 44 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-02-08 01:13:08,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 284 flow [2025-02-08 01:13:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 01:13:08,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2025-02-08 01:13:08,173 INFO L175 Difference]: Start difference. First operand has 41 places, 49 transitions, 184 flow. Second operand 3 states and 55 transitions. [2025-02-08 01:13:08,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 284 flow [2025-02-08 01:13:08,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:08,178 INFO L231 Difference]: Finished difference. Result has 43 places, 51 transitions, 200 flow [2025-02-08 01:13:08,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=43, PETRI_TRANSITIONS=51} [2025-02-08 01:13:08,179 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-02-08 01:13:08,179 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 51 transitions, 200 flow [2025-02-08 01:13:08,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-08 01:13:08,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,180 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-02-08 01:13:08,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:08,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:08,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 212034654, now seen corresponding path program 1 times [2025-02-08 01:13:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392491188] [2025-02-08 01:13:08,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:08,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:13:08,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:13:08,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:08,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:13:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392491188] [2025-02-08 01:13:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392491188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467044831] [2025-02-08 01:13:08,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:08,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:08,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:08,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:08,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:13:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:13:08,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:13:08,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:08,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:08,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:08,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:13:08,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:13:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467044831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:08,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-08 01:13:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431995032] [2025-02-08 01:13:08,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:08,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:08,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:08,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 51 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:08,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:08,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:08,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,681 INFO L124 PetriNetUnfolderBase]: 496/884 cut-off events. [2025-02-08 01:13:08,681 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-02-08 01:13:08,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 884 events. 496/884 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3973 event pairs, 384 based on Foata normal form. 3/840 useless extension candidates. Maximal degree in co-relation 2068. Up to 852 conditions per place. [2025-02-08 01:13:08,687 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 44 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2025-02-08 01:13:08,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 332 flow [2025-02-08 01:13:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-02-08 01:13:08,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-02-08 01:13:08,690 INFO L175 Difference]: Start difference. First operand has 43 places, 51 transitions, 200 flow. Second operand 6 states and 80 transitions. [2025-02-08 01:13:08,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 332 flow [2025-02-08 01:13:08,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:08,691 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 262 flow [2025-02-08 01:13:08,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2025-02-08 01:13:08,692 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-02-08 01:13:08,692 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 262 flow [2025-02-08 01:13:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:08,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,692 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:08,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:13:08,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:08,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash -235734021, now seen corresponding path program 2 times [2025-02-08 01:13:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726403766] [2025-02-08 01:13:08,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:08,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 30 statements. [2025-02-08 01:13:08,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:08,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:13:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726403766] [2025-02-08 01:13:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726403766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742756313] [2025-02-08 01:13:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:09,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:09,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:09,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:09,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:09,423 INFO L124 PetriNetUnfolderBase]: 554/999 cut-off events. [2025-02-08 01:13:09,423 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2025-02-08 01:13:09,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 999 events. 554/999 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4706 event pairs, 331 based on Foata normal form. 1/946 useless extension candidates. Maximal degree in co-relation 2292. Up to 744 conditions per place. [2025-02-08 01:13:09,428 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 80 selfloop transitions, 3 changer transitions 11/97 dead transitions. [2025-02-08 01:13:09,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 97 transitions, 546 flow [2025-02-08 01:13:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-08 01:13:09,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2025-02-08 01:13:09,430 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 262 flow. Second operand 6 states and 109 transitions. [2025-02-08 01:13:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 97 transitions, 546 flow [2025-02-08 01:13:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 97 transitions, 530 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:09,433 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 266 flow [2025-02-08 01:13:09,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2025-02-08 01:13:09,434 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-02-08 01:13:09,434 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 266 flow [2025-02-08 01:13:09,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,434 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:09,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:09,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash 126577847, now seen corresponding path program 3 times [2025-02-08 01:13:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480007598] [2025-02-08 01:13:09,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-02-08 01:13:09,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 30 statements. [2025-02-08 01:13:09,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:13:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480007598] [2025-02-08 01:13:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480007598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614388653] [2025-02-08 01:13:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:09,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:09,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:09,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:09,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:09,887 INFO L124 PetriNetUnfolderBase]: 551/999 cut-off events. [2025-02-08 01:13:09,888 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-02-08 01:13:09,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 999 events. 551/999 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4667 event pairs, 390 based on Foata normal form. 1/946 useless extension candidates. Maximal degree in co-relation 2461. Up to 897 conditions per place. [2025-02-08 01:13:09,893 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 65 selfloop transitions, 5 changer transitions 9/82 dead transitions. [2025-02-08 01:13:09,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 492 flow [2025-02-08 01:13:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-08 01:13:09,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-02-08 01:13:09,896 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 266 flow. Second operand 6 states and 93 transitions. [2025-02-08 01:13:09,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 492 flow [2025-02-08 01:13:09,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 482 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:09,901 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 282 flow [2025-02-08 01:13:09,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-02-08 01:13:09,902 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2025-02-08 01:13:09,903 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 282 flow [2025-02-08 01:13:09,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,904 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:09,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:13:09,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash -210161417, now seen corresponding path program 4 times [2025-02-08 01:13:09,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056213948] [2025-02-08 01:13:09,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:09,935 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:09,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:09,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:13:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056213948] [2025-02-08 01:13:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056213948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601641685] [2025-02-08 01:13:10,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:10,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:10,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:13:10,146 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:10,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:10,184 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:10,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:13:10,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:13:10,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:13:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601641685] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:10,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 01:13:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972176230] [2025-02-08 01:13:10,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:13:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:13:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:13:10,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:10,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 282 flow. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:10,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:10,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:10,457 INFO L124 PetriNetUnfolderBase]: 540/975 cut-off events. [2025-02-08 01:13:10,457 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2025-02-08 01:13:10,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 975 events. 540/975 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4478 event pairs, 428 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 2453. Up to 942 conditions per place. [2025-02-08 01:13:10,464 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 46 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2025-02-08 01:13:10,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 410 flow [2025-02-08 01:13:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-02-08 01:13:10,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24702380952380953 [2025-02-08 01:13:10,468 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 282 flow. Second operand 7 states and 83 transitions. [2025-02-08 01:13:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 410 flow [2025-02-08 01:13:10,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 396 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:10,471 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 314 flow [2025-02-08 01:13:10,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2025-02-08 01:13:10,473 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-02-08 01:13:10,473 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 314 flow [2025-02-08 01:13:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:10,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:10,474 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:10,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:13:10,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:10,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:10,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1357531482, now seen corresponding path program 5 times [2025-02-08 01:13:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:10,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531939148] [2025-02-08 01:13:10,680 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:10,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-02-08 01:13:10,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:13:10,722 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 01:13:10,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531939148] [2025-02-08 01:13:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531939148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:10,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847054273] [2025-02-08 01:13:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:10,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:10,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:10,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:10,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,189 INFO L124 PetriNetUnfolderBase]: 550/1001 cut-off events. [2025-02-08 01:13:11,190 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2025-02-08 01:13:11,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 1001 events. 550/1001 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4708 event pairs, 394 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 2430. Up to 897 conditions per place. [2025-02-08 01:13:11,194 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 65 selfloop transitions, 3 changer transitions 13/84 dead transitions. [2025-02-08 01:13:11,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 535 flow [2025-02-08 01:13:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-08 01:13:11,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-02-08 01:13:11,196 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 314 flow. Second operand 6 states and 93 transitions. [2025-02-08 01:13:11,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 535 flow [2025-02-08 01:13:11,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 511 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:11,199 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 285 flow [2025-02-08 01:13:11,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2025-02-08 01:13:11,201 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2025-02-08 01:13:11,201 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 285 flow [2025-02-08 01:13:11,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:11,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:13:11,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1507262532, now seen corresponding path program 6 times [2025-02-08 01:13:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487250014] [2025-02-08 01:13:11,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,213 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-02-08 01:13:11,217 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 32 statements. [2025-02-08 01:13:11,218 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:11,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487250014] [2025-02-08 01:13:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487250014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082862557] [2025-02-08 01:13:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:11,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:11,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:11,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:11,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:11,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,542 INFO L124 PetriNetUnfolderBase]: 590/1080 cut-off events. [2025-02-08 01:13:11,542 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-02-08 01:13:11,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 1080 events. 590/1080 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5214 event pairs, 387 based on Foata normal form. 1/1022 useless extension candidates. Maximal degree in co-relation 2725. Up to 856 conditions per place. [2025-02-08 01:13:11,548 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 80 selfloop transitions, 2 changer transitions 10/95 dead transitions. [2025-02-08 01:13:11,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 580 flow [2025-02-08 01:13:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-02-08 01:13:11,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2025-02-08 01:13:11,550 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 285 flow. Second operand 6 states and 105 transitions. [2025-02-08 01:13:11,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 580 flow [2025-02-08 01:13:11,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 554 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:11,553 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 290 flow [2025-02-08 01:13:11,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-02-08 01:13:11,554 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2025-02-08 01:13:11,554 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 290 flow [2025-02-08 01:13:11,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,555 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:11,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:11,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1306508988, now seen corresponding path program 7 times [2025-02-08 01:13:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978626081] [2025-02-08 01:13:11,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:13:11,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:13:11,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:11,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:11,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:11,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978626081] [2025-02-08 01:13:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978626081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:11,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:11,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429290335] [2025-02-08 01:13:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:11,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:11,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:11,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:11,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:11,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:11,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,946 INFO L124 PetriNetUnfolderBase]: 582/1068 cut-off events. [2025-02-08 01:13:11,946 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-02-08 01:13:11,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 1068 events. 582/1068 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5090 event pairs, 435 based on Foata normal form. 1/1010 useless extension candidates. Maximal degree in co-relation 2645. Up to 979 conditions per place. [2025-02-08 01:13:11,951 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 66 selfloop transitions, 4 changer transitions 10/83 dead transitions. [2025-02-08 01:13:11,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 518 flow [2025-02-08 01:13:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-08 01:13:11,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-02-08 01:13:11,953 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 290 flow. Second operand 6 states and 92 transitions. [2025-02-08 01:13:11,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 518 flow [2025-02-08 01:13:11,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 511 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:11,955 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 305 flow [2025-02-08 01:13:11,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-02-08 01:13:11,956 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-02-08 01:13:11,956 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 305 flow [2025-02-08 01:13:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,956 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:11,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:11,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:11,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -800213090, now seen corresponding path program 8 times [2025-02-08 01:13:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678783122] [2025-02-08 01:13:11,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-08 01:13:11,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 32 statements. [2025-02-08 01:13:11,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678783122] [2025-02-08 01:13:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678783122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531951222] [2025-02-08 01:13:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:12,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:12,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:12,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:12,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:12,284 INFO L124 PetriNetUnfolderBase]: 570/1038 cut-off events. [2025-02-08 01:13:12,284 INFO L125 PetriNetUnfolderBase]: For 519/519 co-relation queries the response was YES. [2025-02-08 01:13:12,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 1038 events. 570/1038 cut-off events. For 519/519 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4882 event pairs, 424 based on Foata normal form. 1/980 useless extension candidates. Maximal degree in co-relation 2604. Up to 952 conditions per place. [2025-02-08 01:13:12,289 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 64 selfloop transitions, 2 changer transitions 12/81 dead transitions. [2025-02-08 01:13:12,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 514 flow [2025-02-08 01:13:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-02-08 01:13:12,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-02-08 01:13:12,290 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 305 flow. Second operand 6 states and 90 transitions. [2025-02-08 01:13:12,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 514 flow [2025-02-08 01:13:12,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 502 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:12,295 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 284 flow [2025-02-08 01:13:12,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-02-08 01:13:12,295 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2025-02-08 01:13:12,295 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 284 flow [2025-02-08 01:13:12,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:12,297 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:12,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:13:12,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 28152759, now seen corresponding path program 1 times [2025-02-08 01:13:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965713315] [2025-02-08 01:13:12,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:12,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:13:12,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:13:12,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:12,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965713315] [2025-02-08 01:13:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965713315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503228237] [2025-02-08 01:13:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:12,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:12,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:12,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:12,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:12,776 INFO L124 PetriNetUnfolderBase]: 598/1094 cut-off events. [2025-02-08 01:13:12,776 INFO L125 PetriNetUnfolderBase]: For 510/522 co-relation queries the response was YES. [2025-02-08 01:13:12,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 1094 events. 598/1094 cut-off events. For 510/522 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5300 event pairs, 393 based on Foata normal form. 5/1037 useless extension candidates. Maximal degree in co-relation 2711. Up to 840 conditions per place. [2025-02-08 01:13:12,782 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 81 selfloop transitions, 3 changer transitions 11/98 dead transitions. [2025-02-08 01:13:12,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 576 flow [2025-02-08 01:13:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-08 01:13:12,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2025-02-08 01:13:12,783 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 284 flow. Second operand 6 states and 109 transitions. [2025-02-08 01:13:12,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 576 flow [2025-02-08 01:13:12,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 564 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:12,786 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 287 flow [2025-02-08 01:13:12,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-02-08 01:13:12,786 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-02-08 01:13:12,786 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 287 flow [2025-02-08 01:13:12,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:12,787 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:12,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:13:12,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash 881997167, now seen corresponding path program 2 times [2025-02-08 01:13:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773921973] [2025-02-08 01:13:12,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:12,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-08 01:13:12,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 32 statements. [2025-02-08 01:13:12,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:12,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773921973] [2025-02-08 01:13:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773921973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573050078] [2025-02-08 01:13:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:12,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:12,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:12,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:13,096 INFO L124 PetriNetUnfolderBase]: 595/1094 cut-off events. [2025-02-08 01:13:13,097 INFO L125 PetriNetUnfolderBase]: For 553/565 co-relation queries the response was YES. [2025-02-08 01:13:13,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1094 events. 595/1094 cut-off events. For 553/565 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5282 event pairs, 452 based on Foata normal form. 5/1037 useless extension candidates. Maximal degree in co-relation 2713. Up to 993 conditions per place. [2025-02-08 01:13:13,102 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 66 selfloop transitions, 5 changer transitions 9/83 dead transitions. [2025-02-08 01:13:13,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 521 flow [2025-02-08 01:13:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-08 01:13:13,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-02-08 01:13:13,103 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 287 flow. Second operand 6 states and 93 transitions. [2025-02-08 01:13:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 521 flow [2025-02-08 01:13:13,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 496 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:13,106 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 292 flow [2025-02-08 01:13:13,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-02-08 01:13:13,107 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-02-08 01:13:13,107 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 292 flow [2025-02-08 01:13:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,107 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:13:13,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash 545257903, now seen corresponding path program 3 times [2025-02-08 01:13:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747290865] [2025-02-08 01:13:13,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-08 01:13:13,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 32 statements. [2025-02-08 01:13:13,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:13,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747290865] [2025-02-08 01:13:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747290865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10329954] [2025-02-08 01:13:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:13,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:13,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:13,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:13,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:13,423 INFO L124 PetriNetUnfolderBase]: 594/1094 cut-off events. [2025-02-08 01:13:13,423 INFO L125 PetriNetUnfolderBase]: For 458/470 co-relation queries the response was YES. [2025-02-08 01:13:13,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2723 conditions, 1094 events. 594/1094 cut-off events. For 458/470 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5308 event pairs, 456 based on Foata normal form. 5/1037 useless extension candidates. Maximal degree in co-relation 2687. Up to 991 conditions per place. [2025-02-08 01:13:13,428 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 64 selfloop transitions, 3 changer transitions 13/83 dead transitions. [2025-02-08 01:13:13,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 515 flow [2025-02-08 01:13:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-08 01:13:13,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-02-08 01:13:13,429 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 292 flow. Second operand 6 states and 93 transitions. [2025-02-08 01:13:13,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 515 flow [2025-02-08 01:13:13,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 501 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:13,431 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 275 flow [2025-02-08 01:13:13,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2025-02-08 01:13:13,432 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2025-02-08 01:13:13,432 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 275 flow [2025-02-08 01:13:13,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,432 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:13:13,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1959851813, now seen corresponding path program 4 times [2025-02-08 01:13:13,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168651693] [2025-02-08 01:13:13,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 01:13:13,457 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:13:13,457 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168651693] [2025-02-08 01:13:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168651693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:13,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:13,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425595572] [2025-02-08 01:13:13,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:13,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:13,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:13,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:13,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:13,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:13,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:13,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:13,787 INFO L124 PetriNetUnfolderBase]: 615/1143 cut-off events. [2025-02-08 01:13:13,787 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2025-02-08 01:13:13,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 1143 events. 615/1143 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5593 event pairs, 439 based on Foata normal form. 1/1078 useless extension candidates. Maximal degree in co-relation 2789. Up to 918 conditions per place. [2025-02-08 01:13:13,792 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 78 selfloop transitions, 2 changer transitions 10/93 dead transitions. [2025-02-08 01:13:13,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 552 flow [2025-02-08 01:13:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-02-08 01:13:13,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2025-02-08 01:13:13,794 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 275 flow. Second operand 6 states and 105 transitions. [2025-02-08 01:13:13,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 552 flow [2025-02-08 01:13:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 530 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:13,806 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 274 flow [2025-02-08 01:13:13,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-02-08 01:13:13,807 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-02-08 01:13:13,807 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 274 flow [2025-02-08 01:13:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,807 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:13:13,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:13,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1793899483, now seen corresponding path program 5 times [2025-02-08 01:13:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980239300] [2025-02-08 01:13:13,808 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,819 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-02-08 01:13:13,835 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:13:13,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 01:13:13,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980239300] [2025-02-08 01:13:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980239300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033433575] [2025-02-08 01:13:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:13,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:13,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:13,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:13,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:13,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:13,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:13,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:13,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,174 INFO L124 PetriNetUnfolderBase]: 607/1131 cut-off events. [2025-02-08 01:13:14,175 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-02-08 01:13:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 1131 events. 607/1131 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5481 event pairs, 487 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 2717. Up to 1041 conditions per place. [2025-02-08 01:13:14,182 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 64 selfloop transitions, 4 changer transitions 10/81 dead transitions. [2025-02-08 01:13:14,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 498 flow [2025-02-08 01:13:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-08 01:13:14,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-02-08 01:13:14,183 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 274 flow. Second operand 6 states and 92 transitions. [2025-02-08 01:13:14,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 498 flow [2025-02-08 01:13:14,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 477 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:14,186 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 279 flow [2025-02-08 01:13:14,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-02-08 01:13:14,187 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2025-02-08 01:13:14,187 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 279 flow [2025-02-08 01:13:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:14,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,187 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:13:14,187 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash 394345735, now seen corresponding path program 6 times [2025-02-08 01:13:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271435797] [2025-02-08 01:13:14,188 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,198 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-02-08 01:13:14,216 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 32 statements. [2025-02-08 01:13:14,216 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:14,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271435797] [2025-02-08 01:13:14,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271435797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:14,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:14,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385405333] [2025-02-08 01:13:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:14,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:14,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:14,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:14,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:14,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:14,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:14,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:14,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,538 INFO L124 PetriNetUnfolderBase]: 595/1101 cut-off events. [2025-02-08 01:13:14,538 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-02-08 01:13:14,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1101 events. 595/1101 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5255 event pairs, 476 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 2626. Up to 1014 conditions per place. [2025-02-08 01:13:14,547 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 62 selfloop transitions, 2 changer transitions 12/79 dead transitions. [2025-02-08 01:13:14,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 482 flow [2025-02-08 01:13:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-02-08 01:13:14,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-02-08 01:13:14,552 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 279 flow. Second operand 6 states and 90 transitions. [2025-02-08 01:13:14,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 482 flow [2025-02-08 01:13:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 470 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:14,554 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 262 flow [2025-02-08 01:13:14,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-02-08 01:13:14,555 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2025-02-08 01:13:14,555 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 262 flow [2025-02-08 01:13:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:14,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,555 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:13:14,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1771624588, now seen corresponding path program 1 times [2025-02-08 01:13:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417808126] [2025-02-08 01:13:14,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:13:14,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:13:14,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:14,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417808126] [2025-02-08 01:13:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417808126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:14,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216235508] [2025-02-08 01:13:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:14,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:14,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:14,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:14,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:14,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-08 01:13:14,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:14,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,764 INFO L124 PetriNetUnfolderBase]: 369/708 cut-off events. [2025-02-08 01:13:14,764 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2025-02-08 01:13:14,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 708 events. 369/708 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3174 event pairs, 184 based on Foata normal form. 30/699 useless extension candidates. Maximal degree in co-relation 1649. Up to 387 conditions per place. [2025-02-08 01:13:14,769 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 40 selfloop transitions, 0 changer transitions 32/73 dead transitions. [2025-02-08 01:13:14,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 416 flow [2025-02-08 01:13:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 01:13:14,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2025-02-08 01:13:14,771 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 262 flow. Second operand 3 states and 73 transitions. [2025-02-08 01:13:14,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 416 flow [2025-02-08 01:13:14,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 406 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:14,773 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 180 flow [2025-02-08 01:13:14,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-02-08 01:13:14,773 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-02-08 01:13:14,774 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 180 flow [2025-02-08 01:13:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-08 01:13:14,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,774 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:13:14,774 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1513498009, now seen corresponding path program 1 times [2025-02-08 01:13:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806004013] [2025-02-08 01:13:14,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 01:13:14,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 01:13:14,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:14,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806004013] [2025-02-08 01:13:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806004013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521420520] [2025-02-08 01:13:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:14,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:14,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:14,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:14,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:14,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:14,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:14,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,951 INFO L124 PetriNetUnfolderBase]: 323/563 cut-off events. [2025-02-08 01:13:14,951 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-02-08 01:13:14,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 563 events. 323/563 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1883 event pairs, 195 based on Foata normal form. 18/520 useless extension candidates. Maximal degree in co-relation 1289. Up to 387 conditions per place. [2025-02-08 01:13:14,953 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 50 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2025-02-08 01:13:14,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 325 flow [2025-02-08 01:13:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 01:13:14,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2025-02-08 01:13:14,954 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 180 flow. Second operand 3 states and 59 transitions. [2025-02-08 01:13:14,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 325 flow [2025-02-08 01:13:14,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 311 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:14,955 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 183 flow [2025-02-08 01:13:14,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2025-02-08 01:13:14,956 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-02-08 01:13:14,956 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 183 flow [2025-02-08 01:13:14,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:14,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,956 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:13:14,956 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:14,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash 421893370, now seen corresponding path program 1 times [2025-02-08 01:13:14,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996277900] [2025-02-08 01:13:14,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 01:13:14,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 01:13:14,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:14,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 01:13:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996277900] [2025-02-08 01:13:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996277900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721292515] [2025-02-08 01:13:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:15,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:15,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:15,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:15,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:15,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:15,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:15,197 INFO L124 PetriNetUnfolderBase]: 434/749 cut-off events. [2025-02-08 01:13:15,197 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-08 01:13:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 749 events. 434/749 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2706 event pairs, 266 based on Foata normal form. 25/724 useless extension candidates. Maximal degree in co-relation 1734. Up to 563 conditions per place. [2025-02-08 01:13:15,199 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 51 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2025-02-08 01:13:15,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 334 flow [2025-02-08 01:13:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-08 01:13:15,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-02-08 01:13:15,201 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 183 flow. Second operand 3 states and 57 transitions. [2025-02-08 01:13:15,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 334 flow [2025-02-08 01:13:15,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:15,202 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 195 flow [2025-02-08 01:13:15,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-02-08 01:13:15,203 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-02-08 01:13:15,203 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 195 flow [2025-02-08 01:13:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:15,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:15,203 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:13:15,203 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 293997756, now seen corresponding path program 1 times [2025-02-08 01:13:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007162579] [2025-02-08 01:13:15,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 01:13:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:15,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007162579] [2025-02-08 01:13:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007162579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890069036] [2025-02-08 01:13:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:22,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:22,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:22,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:22,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:13:22,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 01:13:22,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:22,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:22,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 01:13:22,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:23,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:23,395 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 356 treesize of output 296 [2025-02-08 01:13:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:24,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:25,871 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-02-08 01:13:25,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 321 treesize of output 294 [2025-02-08 01:13:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890069036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:26,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7, 7] total 31 [2025-02-08 01:13:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243579729] [2025-02-08 01:13:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:26,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 01:13:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:26,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 01:13:26,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-02-08 01:13:26,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:26,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 195 flow. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 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-02-08 01:13:26,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:26,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:26,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:31,279 INFO L124 PetriNetUnfolderBase]: 1746/3012 cut-off events. [2025-02-08 01:13:31,280 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2025-02-08 01:13:31,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7210 conditions, 3012 events. 1746/3012 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15961 event pairs, 240 based on Foata normal form. 50/3062 useless extension candidates. Maximal degree in co-relation 7196. Up to 542 conditions per place. [2025-02-08 01:13:31,292 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 251 selfloop transitions, 103 changer transitions 38/393 dead transitions. [2025-02-08 01:13:31,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 393 transitions, 2024 flow [2025-02-08 01:13:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-08 01:13:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-02-08 01:13:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 668 transitions. [2025-02-08 01:13:31,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24851190476190477 [2025-02-08 01:13:31,299 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 195 flow. Second operand 56 states and 668 transitions. [2025-02-08 01:13:31,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 393 transitions, 2024 flow [2025-02-08 01:13:31,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 393 transitions, 1962 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:31,305 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 852 flow [2025-02-08 01:13:31,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=852, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-02-08 01:13:31,306 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2025-02-08 01:13:31,306 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 852 flow [2025-02-08 01:13:31,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 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-02-08 01:13:31,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:31,307 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:31,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:13:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:31,512 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1112639542, now seen corresponding path program 2 times [2025-02-08 01:13:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848151375] [2025-02-08 01:13:31,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:31,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:31,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:13:31,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:31,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:31,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:36,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:36,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848151375] [2025-02-08 01:13:36,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848151375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940005247] [2025-02-08 01:13:36,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:36,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:36,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:36,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:36,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:13:36,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:13:36,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:36,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:36,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:36,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 01:13:36,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:37,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:37,311 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 322 treesize of output 266 [2025-02-08 01:13:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:37,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:39,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:39,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 412 treesize of output 378 [2025-02-08 01:13:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940005247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:39,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 7] total 34 [2025-02-08 01:13:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655296730] [2025-02-08 01:13:39,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 01:13:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 01:13:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 01:13:40,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:40,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 852 flow. Second operand has 34 states, 34 states have (on average 7.882352941176471) internal successors, (268), 34 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:40,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:40,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:43,549 INFO L124 PetriNetUnfolderBase]: 3100/5448 cut-off events. [2025-02-08 01:13:43,550 INFO L125 PetriNetUnfolderBase]: For 4317/4317 co-relation queries the response was YES. [2025-02-08 01:13:43,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14283 conditions, 5448 events. 3100/5448 cut-off events. For 4317/4317 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 33796 event pairs, 486 based on Foata normal form. 4/5452 useless extension candidates. Maximal degree in co-relation 14262. Up to 1089 conditions per place. [2025-02-08 01:13:43,569 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 162 selfloop transitions, 132 changer transitions 33/328 dead transitions. [2025-02-08 01:13:43,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 328 transitions, 2241 flow [2025-02-08 01:13:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 01:13:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-02-08 01:13:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 360 transitions. [2025-02-08 01:13:43,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.234375 [2025-02-08 01:13:43,576 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 852 flow. Second operand 32 states and 360 transitions. [2025-02-08 01:13:43,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 328 transitions, 2241 flow [2025-02-08 01:13:43,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 328 transitions, 1975 flow, removed 86 selfloop flow, removed 13 redundant places. [2025-02-08 01:13:43,595 INFO L231 Difference]: Finished difference. Result has 136 places, 188 transitions, 1388 flow [2025-02-08 01:13:43,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1388, PETRI_PLACES=136, PETRI_TRANSITIONS=188} [2025-02-08 01:13:43,596 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2025-02-08 01:13:43,597 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 188 transitions, 1388 flow [2025-02-08 01:13:43,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.882352941176471) internal successors, (268), 34 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:43,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:43,597 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:43,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:13:43,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 01:13:43,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:43,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1547922572, now seen corresponding path program 3 times [2025-02-08 01:13:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:43,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532666393] [2025-02-08 01:13:43,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:43,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:13:43,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 39 statements. [2025-02-08 01:13:43,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 01:13:43,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532666393] [2025-02-08 01:13:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532666393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975553632] [2025-02-08 01:13:46,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:46,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:46,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:46,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:46,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:13:46,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:13:46,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 39 statements. [2025-02-08 01:13:46,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 01:13:46,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:46,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 01:13:46,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:47,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:47,823 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 342 treesize of output 278 [2025-02-08 01:13:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:48,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:49,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:49,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 388 treesize of output 366 [2025-02-08 01:13:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975553632] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:50,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-02-08 01:13:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195645242] [2025-02-08 01:13:50,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:50,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 01:13:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:50,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 01:13:50,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-02-08 01:13:50,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:13:50,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 188 transitions, 1388 flow. Second operand has 24 states, 24 states have (on average 8.75) internal successors, (210), 24 states have internal predecessors, (210), 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-02-08 01:13:50,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:50,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:13:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:51,718 INFO L124 PetriNetUnfolderBase]: 3344/5880 cut-off events. [2025-02-08 01:13:51,719 INFO L125 PetriNetUnfolderBase]: For 8755/8755 co-relation queries the response was YES. [2025-02-08 01:13:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17392 conditions, 5880 events. 3344/5880 cut-off events. For 8755/8755 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37269 event pairs, 846 based on Foata normal form. 2/5882 useless extension candidates. Maximal degree in co-relation 17368. Up to 1857 conditions per place. [2025-02-08 01:13:51,747 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 224 selfloop transitions, 108 changer transitions 24/357 dead transitions. [2025-02-08 01:13:51,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 357 transitions, 2931 flow [2025-02-08 01:13:51,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 01:13:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 01:13:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 264 transitions. [2025-02-08 01:13:51,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2894736842105263 [2025-02-08 01:13:51,748 INFO L175 Difference]: Start difference. First operand has 136 places, 188 transitions, 1388 flow. Second operand 19 states and 264 transitions. [2025-02-08 01:13:51,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 357 transitions, 2931 flow [2025-02-08 01:13:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 357 transitions, 2750 flow, removed 70 selfloop flow, removed 14 redundant places. [2025-02-08 01:13:51,826 INFO L231 Difference]: Finished difference. Result has 143 places, 224 transitions, 1841 flow [2025-02-08 01:13:51,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1841, PETRI_PLACES=143, PETRI_TRANSITIONS=224} [2025-02-08 01:13:51,827 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2025-02-08 01:13:51,827 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 224 transitions, 1841 flow [2025-02-08 01:13:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.75) internal successors, (210), 24 states have internal predecessors, (210), 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-02-08 01:13:51,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:51,827 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:51,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 01:13:52,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 01:13:52,028 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:52,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 55662774, now seen corresponding path program 4 times [2025-02-08 01:13:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614476981] [2025-02-08 01:13:52,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:52,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:13:52,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:52,151 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:52,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:56,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:56,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614476981] [2025-02-08 01:13:56,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614476981] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:56,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677808220] [2025-02-08 01:13:56,463 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:56,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:56,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:13:56,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-08 01:13:56,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:13:56,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:56,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:56,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 01:13:56,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:57,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:57,289 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 346 treesize of output 290 [2025-02-08 01:13:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:13:57,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:59,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:59,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 331 [2025-02-08 01:14:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:14:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677808220] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:00,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7, 7] total 31 [2025-02-08 01:14:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326385083] [2025-02-08 01:14:00,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 01:14:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 01:14:00,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2025-02-08 01:14:00,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:14:00,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 224 transitions, 1841 flow. Second operand has 31 states, 31 states have (on average 7.806451612903226) internal successors, (242), 31 states have internal predecessors, (242), 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-02-08 01:14:00,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:14:00,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:03,317 INFO L124 PetriNetUnfolderBase]: 3391/5980 cut-off events. [2025-02-08 01:14:03,317 INFO L125 PetriNetUnfolderBase]: For 8731/8731 co-relation queries the response was YES. [2025-02-08 01:14:03,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18258 conditions, 5980 events. 3391/5980 cut-off events. For 8731/8731 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 38000 event pairs, 918 based on Foata normal form. 3/5983 useless extension candidates. Maximal degree in co-relation 18231. Up to 1124 conditions per place. [2025-02-08 01:14:03,345 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 275 selfloop transitions, 146 changer transitions 36/458 dead transitions. [2025-02-08 01:14:03,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 458 transitions, 3665 flow [2025-02-08 01:14:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-08 01:14:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-02-08 01:14:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 489 transitions. [2025-02-08 01:14:03,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2680921052631579 [2025-02-08 01:14:03,347 INFO L175 Difference]: Start difference. First operand has 143 places, 224 transitions, 1841 flow. Second operand 38 states and 489 transitions. [2025-02-08 01:14:03,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 458 transitions, 3665 flow [2025-02-08 01:14:03,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 458 transitions, 3422 flow, removed 42 selfloop flow, removed 8 redundant places. [2025-02-08 01:14:03,404 INFO L231 Difference]: Finished difference. Result has 177 places, 247 transitions, 2221 flow [2025-02-08 01:14:03,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2221, PETRI_PLACES=177, PETRI_TRANSITIONS=247} [2025-02-08 01:14:03,405 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2025-02-08 01:14:03,406 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 247 transitions, 2221 flow [2025-02-08 01:14:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.806451612903226) internal successors, (242), 31 states have internal predecessors, (242), 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-02-08 01:14:03,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:03,407 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:03,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 01:14:03,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 01:14:03,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:03,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2131922224, now seen corresponding path program 5 times [2025-02-08 01:14:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:03,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981410183] [2025-02-08 01:14:03,608 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:03,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:14:03,719 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:14:03,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 01:14:03,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981410183] [2025-02-08 01:14:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981410183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490607277] [2025-02-08 01:14:08,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:08,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:08,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:14:08,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:14:08,633 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:14:08,633 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 01:14:08,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:08,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 01:14:08,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:09,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:09,427 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 326 treesize of output 278 [2025-02-08 01:14:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:14:10,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:11,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:11,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 337 [2025-02-08 01:14:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:14:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490607277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:12,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 7] total 33 [2025-02-08 01:14:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066226515] [2025-02-08 01:14:12,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:12,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 01:14:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:12,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 01:14:12,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 01:14:12,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 48 [2025-02-08 01:14:12,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 247 transitions, 2221 flow. Second operand has 33 states, 33 states have (on average 7.96969696969697) internal successors, (263), 33 states have internal predecessors, (263), 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-02-08 01:14:12,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:12,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 48 [2025-02-08 01:14:12,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:14,480 INFO L124 PetriNetUnfolderBase]: 3310/5814 cut-off events. [2025-02-08 01:14:14,480 INFO L125 PetriNetUnfolderBase]: For 9508/9508 co-relation queries the response was YES. [2025-02-08 01:14:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18032 conditions, 5814 events. 3310/5814 cut-off events. For 9508/9508 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 36632 event pairs, 738 based on Foata normal form. 2/5816 useless extension candidates. Maximal degree in co-relation 18002. Up to 1655 conditions per place. [2025-02-08 01:14:14,502 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 169 selfloop transitions, 157 changer transitions 33/360 dead transitions. [2025-02-08 01:14:14,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 360 transitions, 3287 flow [2025-02-08 01:14:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 01:14:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-08 01:14:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 305 transitions. [2025-02-08 01:14:14,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2353395061728395 [2025-02-08 01:14:14,503 INFO L175 Difference]: Start difference. First operand has 177 places, 247 transitions, 2221 flow. Second operand 27 states and 305 transitions. [2025-02-08 01:14:14,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 360 transitions, 3287 flow [2025-02-08 01:14:14,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 360 transitions, 3099 flow, removed 15 selfloop flow, removed 19 redundant places. [2025-02-08 01:14:14,545 INFO L231 Difference]: Finished difference. Result has 186 places, 248 transitions, 2435 flow [2025-02-08 01:14:14,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2435, PETRI_PLACES=186, PETRI_TRANSITIONS=248} [2025-02-08 01:14:14,546 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2025-02-08 01:14:14,546 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 248 transitions, 2435 flow [2025-02-08 01:14:14,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.96969696969697) internal successors, (263), 33 states have internal predecessors, (263), 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-02-08 01:14:14,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:14,546 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:14,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 01:14:14,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:14,747 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:14,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -274578510, now seen corresponding path program 6 times [2025-02-08 01:14:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056576299] [2025-02-08 01:14:14,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:14,761 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:14:14,810 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 39 statements. [2025-02-08 01:14:14,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 01:14:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:14:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056576299] [2025-02-08 01:14:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056576299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177017239] [2025-02-08 01:14:17,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:17,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:17,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:17,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:17,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 01:14:17,191 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-02-08 01:14:17,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 39 statements. [2025-02-08 01:14:17,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 01:14:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 01:14:17,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:18,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:18,226 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 332 treesize of output 272 [2025-02-08 01:14:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 01:14:18,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:19,953 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-02-08 01:14:19,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 338 treesize of output 313