./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.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-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:11:37,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:11:37,189 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:11:37,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:11:37,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:11:37,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:11:37,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:11:37,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:11:37,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:11:37,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:11:37,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:11:37,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:11:37,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:37,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:11:37,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:11:37,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:11:37,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:11:37,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:11:37,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:11:37,213 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-02-08 01:11:37,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:11:37,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:11:37,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:11:37,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:11:37,449 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:11:37,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-02-08 01:11:38,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0848ea35a/6e61cb4826b14373859b850eb45490ff/FLAG729903a0a [2025-02-08 01:11:38,875 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:11:38,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-02-08 01:11:38,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0848ea35a/6e61cb4826b14373859b850eb45490ff/FLAG729903a0a [2025-02-08 01:11:39,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0848ea35a/6e61cb4826b14373859b850eb45490ff [2025-02-08 01:11:39,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:11:39,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:11:39,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:39,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:11:39,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:11:39,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1a99cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39, skipping insertion in model container [2025-02-08 01:11:39,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:11:39,273 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-array-int-subst.wvr.c[2820,2833] [2025-02-08 01:11:39,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:39,293 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:11:39,316 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-array-int-subst.wvr.c[2820,2833] [2025-02-08 01:11:39,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:39,333 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:11:39,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39 WrapperNode [2025-02-08 01:11:39,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:39,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:39,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:11:39,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:11:39,339 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:11:39" (1/1) ... [2025-02-08 01:11:39,344 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:11:39" (1/1) ... [2025-02-08 01:11:39,365 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-02-08 01:11:39,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:39,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:11:39,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:11:39,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:11:39,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,404 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 01:11:39,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:11:39,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:11:39,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:11:39,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:11:39,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (1/1) ... [2025-02-08 01:11:39,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:39,452 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:11:39,456 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:11:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:11:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:11:39,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:11:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:11:39,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:11:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:11:39,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:11:39,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:11:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:11:39,470 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:11:39,551 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:11:39,552 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~ret5#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~mem4#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem3#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: ~res1~0 := #t~ret5#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:39,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: #t~ret5#1 := minus_#res#1; [2025-02-08 01:11:39,665 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~ret11#1; [2025-02-08 01:11:39,668 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~mem10#1; [2025-02-08 01:11:39,668 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem9#1; [2025-02-08 01:11:39,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: ~res2~0 := #t~ret11#1; [2025-02-08 01:11:39,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 01:11:39,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:39,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:39,669 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: #t~ret11#1 := minus_#res#1; [2025-02-08 01:11:39,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc #t~ret17#1; [2025-02-08 01:11:39,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc #t~mem16#1; [2025-02-08 01:11:39,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc #t~mem15#1; [2025-02-08 01:11:39,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: ~res3~0 := #t~ret17#1; [2025-02-08 01:11:39,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 01:11:39,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:11:39,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:11:39,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-7: #t~ret17#1 := minus_#res#1; [2025-02-08 01:11:39,862 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:11:39,863 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:11:40,110 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:11:40,111 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:11:40,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:40 BoogieIcfgContainer [2025-02-08 01:11:40,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:11:40,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:11:40,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:11:40,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:11:40,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:11:39" (1/3) ... [2025-02-08 01:11:40,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5f7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:40, skipping insertion in model container [2025-02-08 01:11:40,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:39" (2/3) ... [2025-02-08 01:11:40,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5f7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:40, skipping insertion in model container [2025-02-08 01:11:40,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:40" (3/3) ... [2025-02-08 01:11:40,118 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-02-08 01:11:40,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:11:40,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:11:40,131 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:11:40,175 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:11:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:11:40,220 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2025-02-08 01:11:40,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:11:40,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 6/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 01:11:40,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:11:40,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 33 transitions, 84 flow [2025-02-08 01:11:40,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:11:40,245 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;@62e6ee2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:11:40,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:11:40,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:11:40,259 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-02-08 01:11:40,259 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:11:40,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:40,260 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:11:40,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1010914414, now seen corresponding path program 1 times [2025-02-08 01:11:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544337429] [2025-02-08 01:11:40,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:40,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:11:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:11:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:41,066 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:11:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544337429] [2025-02-08 01:11:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544337429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:41,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:11:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369098815] [2025-02-08 01:11:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:11:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:41,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:11:41,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:11:41,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:41,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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:11:41,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:41,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:41,581 INFO L124 PetriNetUnfolderBase]: 1587/2279 cut-off events. [2025-02-08 01:11:41,582 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-08 01:11:41,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 2279 events. 1587/2279 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9297 event pairs, 764 based on Foata normal form. 1/1542 useless extension candidates. Maximal degree in co-relation 2150. Up to 1133 conditions per place. [2025-02-08 01:11:41,591 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 36 selfloop transitions, 8 changer transitions 29/74 dead transitions. [2025-02-08 01:11:41,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 74 transitions, 336 flow [2025-02-08 01:11:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-02-08 01:11:41,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3938223938223938 [2025-02-08 01:11:41,603 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 84 flow. Second operand 7 states and 102 transitions. [2025-02-08 01:11:41,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 74 transitions, 336 flow [2025-02-08 01:11:41,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:11:41,612 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 127 flow [2025-02-08 01:11:41,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-02-08 01:11:41,617 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-02-08 01:11:41,617 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 127 flow [2025-02-08 01:11:41,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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:11:41,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:41,618 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:11:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:11:41,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -373449507, now seen corresponding path program 1 times [2025-02-08 01:11:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999734827] [2025-02-08 01:11:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:41,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:41,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:41,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999734827] [2025-02-08 01:11:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999734827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810309307] [2025-02-08 01:11:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:41,785 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:11:41,790 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:11:41,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:41,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:41,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:41,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:41,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:41,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:41,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810309307] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-02-08 01:11:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329976811] [2025-02-08 01:11:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:42,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:42,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:42,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:11:42,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:42,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:42,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:42,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:42,517 INFO L124 PetriNetUnfolderBase]: 1294/1878 cut-off events. [2025-02-08 01:11:42,517 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-02-08 01:11:42,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 1878 events. 1294/1878 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7604 event pairs, 591 based on Foata normal form. 1/1503 useless extension candidates. Maximal degree in co-relation 4157. Up to 628 conditions per place. [2025-02-08 01:11:42,522 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 60 selfloop transitions, 5 changer transitions 41/107 dead transitions. [2025-02-08 01:11:42,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 107 transitions, 541 flow [2025-02-08 01:11:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2025-02-08 01:11:42,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2025-02-08 01:11:42,523 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 127 flow. Second operand 7 states and 124 transitions. [2025-02-08 01:11:42,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 107 transitions, 541 flow [2025-02-08 01:11:42,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 107 transitions, 522 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 01:11:42,525 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 140 flow [2025-02-08 01:11:42,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-02-08 01:11:42,526 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-02-08 01:11:42,526 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 140 flow [2025-02-08 01:11:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:42,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:42,526 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:11:42,533 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:11:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:42,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:42,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -264994811, now seen corresponding path program 1 times [2025-02-08 01:11:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:42,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594051994] [2025-02-08 01:11:42,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:42,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:42,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594051994] [2025-02-08 01:11:42,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594051994] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214871010] [2025-02-08 01:11:42,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:42,835 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:11:42,837 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:11:42,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:42,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:42,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:42,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:42,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:42,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:43,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214871010] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-02-08 01:11:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349356996] [2025-02-08 01:11:43,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:43,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:43,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:11:43,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:43,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:11:43,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:43,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:43,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:43,364 INFO L124 PetriNetUnfolderBase]: 1293/1877 cut-off events. [2025-02-08 01:11:43,365 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2025-02-08 01:11:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 1877 events. 1293/1877 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7577 event pairs, 591 based on Foata normal form. 1/1504 useless extension candidates. Maximal degree in co-relation 4209. Up to 1250 conditions per place. [2025-02-08 01:11:43,373 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 31 selfloop transitions, 5 changer transitions 43/80 dead transitions. [2025-02-08 01:11:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 420 flow [2025-02-08 01:11:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-02-08 01:11:43,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4369369369369369 [2025-02-08 01:11:43,375 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 140 flow. Second operand 6 states and 97 transitions. [2025-02-08 01:11:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 420 flow [2025-02-08 01:11:43,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 80 transitions, 405 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 01:11:43,376 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 137 flow [2025-02-08 01:11:43,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 01:11:43,377 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2025-02-08 01:11:43,377 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 137 flow [2025-02-08 01:11:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:11:43,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:43,377 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:11:43,386 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:11:43,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:43,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1227859143, now seen corresponding path program 1 times [2025-02-08 01:11:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940278848] [2025-02-08 01:11:43,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:43,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:43,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940278848] [2025-02-08 01:11:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940278848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983942326] [2025-02-08 01:11:43,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:43,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:43,911 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:11:43,912 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:11:43,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:11:43,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:11:43,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:43,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:43,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 01:11:43,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:44,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983942326] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:44,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:44,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-02-08 01:11:44,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391901642] [2025-02-08 01:11:44,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:44,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:11:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:44,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:11:44,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:11:44,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:44,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:11:44,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:44,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:44,684 INFO L124 PetriNetUnfolderBase]: 1063/1540 cut-off events. [2025-02-08 01:11:44,684 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2025-02-08 01:11:44,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1540 events. 1063/1540 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6100 event pairs, 87 based on Foata normal form. 1/1219 useless extension candidates. Maximal degree in co-relation 3403. Up to 574 conditions per place. [2025-02-08 01:11:44,689 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 74 selfloop transitions, 9 changer transitions 18/102 dead transitions. [2025-02-08 01:11:44,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 507 flow [2025-02-08 01:11:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:11:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:11:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-02-08 01:11:44,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3810810810810811 [2025-02-08 01:11:44,690 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 137 flow. Second operand 10 states and 141 transitions. [2025-02-08 01:11:44,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 507 flow [2025-02-08 01:11:44,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 102 transitions, 481 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:44,692 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 158 flow [2025-02-08 01:11:44,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-02-08 01:11:44,692 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-02-08 01:11:44,692 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 158 flow [2025-02-08 01:11:44,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:11:44,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:44,692 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:11:44,701 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:11:44,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:44,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:44,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 151482871, now seen corresponding path program 2 times [2025-02-08 01:11:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508979096] [2025-02-08 01:11:44,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:44,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 01:11:44,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-02-08 01:11:44,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:44,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508979096] [2025-02-08 01:11:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508979096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:45,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:45,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:11:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748853466] [2025-02-08 01:11:45,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:45,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:45,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:45,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:45,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:11:45,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:45,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:45,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:45,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:45,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:45,535 INFO L124 PetriNetUnfolderBase]: 730/1068 cut-off events. [2025-02-08 01:11:45,535 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-02-08 01:11:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1068 events. 730/1068 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3824 event pairs, 87 based on Foata normal form. 1/849 useless extension candidates. Maximal degree in co-relation 2448. Up to 574 conditions per place. [2025-02-08 01:11:45,538 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 37 selfloop transitions, 4 changer transitions 41/83 dead transitions. [2025-02-08 01:11:45,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 424 flow [2025-02-08 01:11:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:11:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:11:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-02-08 01:11:45,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2025-02-08 01:11:45,539 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 158 flow. Second operand 9 states and 118 transitions. [2025-02-08 01:11:45,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 424 flow [2025-02-08 01:11:45,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 402 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 01:11:45,541 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 119 flow [2025-02-08 01:11:45,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-02-08 01:11:45,542 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-02-08 01:11:45,542 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 119 flow [2025-02-08 01:11:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:45,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:45,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:11:45,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -426255196, now seen corresponding path program 1 times [2025-02-08 01:11:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115556321] [2025-02-08 01:11:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:45,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:11:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:11:45,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:45,645 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:11:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115556321] [2025-02-08 01:11:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115556321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411027854] [2025-02-08 01:11:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:45,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:45,650 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:11:45,650 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:11:45,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:11:45,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:11:45,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:45,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:45,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:45,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:45,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411027854] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:45,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2025-02-08 01:11:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021518714] [2025-02-08 01:11:45,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:45,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:45,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:11:45,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:45,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:45,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:45,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:45,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:45,940 INFO L124 PetriNetUnfolderBase]: 530/769 cut-off events. [2025-02-08 01:11:45,940 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-02-08 01:11:45,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 769 events. 530/769 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2536 event pairs, 205 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 1739. Up to 442 conditions per place. [2025-02-08 01:11:45,944 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 42 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-02-08 01:11:45,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 265 flow [2025-02-08 01:11:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-02-08 01:11:45,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2025-02-08 01:11:45,945 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 119 flow. Second operand 7 states and 74 transitions. [2025-02-08 01:11:45,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 265 flow [2025-02-08 01:11:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 239 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-08 01:11:45,946 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 126 flow [2025-02-08 01:11:45,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-02-08 01:11:45,947 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2025-02-08 01:11:45,947 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 126 flow [2025-02-08 01:11:45,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:45,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:45,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:45,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:46,147 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,SelfDestructingSolverStorable5 [2025-02-08 01:11:46,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:46,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash 422880251, now seen corresponding path program 1 times [2025-02-08 01:11:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503999191] [2025-02-08 01:11:46,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:46,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:46,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:46,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503999191] [2025-02-08 01:11:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503999191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613584476] [2025-02-08 01:11:46,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:46,391 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:11:46,397 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:11:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:46,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:46,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:46,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:46,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:11:46,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:46,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613584476] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:46,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:46,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-02-08 01:11:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710898258] [2025-02-08 01:11:46,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:11:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:46,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:11:46,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:11:46,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:46,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:46,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:46,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:46,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:47,270 INFO L124 PetriNetUnfolderBase]: 1574/2272 cut-off events. [2025-02-08 01:11:47,271 INFO L125 PetriNetUnfolderBase]: For 1193/1193 co-relation queries the response was YES. [2025-02-08 01:11:47,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2272 events. 1574/2272 cut-off events. For 1193/1193 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9589 event pairs, 225 based on Foata normal form. 1/1945 useless extension candidates. Maximal degree in co-relation 5787. Up to 753 conditions per place. [2025-02-08 01:11:47,279 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 89 selfloop transitions, 13 changer transitions 18/121 dead transitions. [2025-02-08 01:11:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 121 transitions, 626 flow [2025-02-08 01:11:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:11:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:11:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2025-02-08 01:11:47,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3832923832923833 [2025-02-08 01:11:47,280 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 126 flow. Second operand 11 states and 156 transitions. [2025-02-08 01:11:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 121 transitions, 626 flow [2025-02-08 01:11:47,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 121 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:47,282 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 215 flow [2025-02-08 01:11:47,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=215, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-02-08 01:11:47,282 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2025-02-08 01:11:47,282 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 215 flow [2025-02-08 01:11:47,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:47,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:47,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:47,290 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:11:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:47,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash 204451799, now seen corresponding path program 2 times [2025-02-08 01:11:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233419876] [2025-02-08 01:11:47,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:47,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:47,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-02-08 01:11:47,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:47,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:11:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233419876] [2025-02-08 01:11:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233419876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:47,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:47,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:11:47,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406337069] [2025-02-08 01:11:47,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:47,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:11:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:47,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:11:47,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:11:47,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:47,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:47,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:47,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:47,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:48,145 INFO L124 PetriNetUnfolderBase]: 1709/2469 cut-off events. [2025-02-08 01:11:48,145 INFO L125 PetriNetUnfolderBase]: For 1974/1974 co-relation queries the response was YES. [2025-02-08 01:11:48,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6423 conditions, 2469 events. 1709/2469 cut-off events. For 1974/1974 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10642 event pairs, 267 based on Foata normal form. 1/2097 useless extension candidates. Maximal degree in co-relation 6393. Up to 893 conditions per place. [2025-02-08 01:11:48,156 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 87 selfloop transitions, 11 changer transitions 19/118 dead transitions. [2025-02-08 01:11:48,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 670 flow [2025-02-08 01:11:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:11:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:11:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-02-08 01:11:48,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4027027027027027 [2025-02-08 01:11:48,158 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 215 flow. Second operand 10 states and 149 transitions. [2025-02-08 01:11:48,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 670 flow [2025-02-08 01:11:48,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 651 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:11:48,164 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 233 flow [2025-02-08 01:11:48,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=233, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-02-08 01:11:48,164 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-02-08 01:11:48,164 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 233 flow [2025-02-08 01:11:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:48,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:48,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:11:48,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -556735405, now seen corresponding path program 3 times [2025-02-08 01:11:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680429761] [2025-02-08 01:11:48,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:11:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:48,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:48,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-02-08 01:11:48,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:11:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:11:48,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:48,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680429761] [2025-02-08 01:11:48,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680429761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:48,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:11:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797599044] [2025-02-08 01:11:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:48,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:11:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:48,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:11:48,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:11:48,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:48,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 233 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:48,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:48,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:48,824 INFO L124 PetriNetUnfolderBase]: 1653/2379 cut-off events. [2025-02-08 01:11:48,824 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2025-02-08 01:11:48,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6224 conditions, 2379 events. 1653/2379 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9909 event pairs, 340 based on Foata normal form. 1/2004 useless extension candidates. Maximal degree in co-relation 6193. Up to 846 conditions per place. [2025-02-08 01:11:48,834 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 86 selfloop transitions, 12 changer transitions 16/115 dead transitions. [2025-02-08 01:11:48,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 115 transitions, 687 flow [2025-02-08 01:11:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:11:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:11:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2025-02-08 01:11:48,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3891891891891892 [2025-02-08 01:11:48,835 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 233 flow. Second operand 10 states and 144 transitions. [2025-02-08 01:11:48,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 115 transitions, 687 flow [2025-02-08 01:11:48,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 658 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 01:11:48,839 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 256 flow [2025-02-08 01:11:48,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-02-08 01:11:48,840 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-02-08 01:11:48,840 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 256 flow [2025-02-08 01:11:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:48,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:48,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:11:48,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 290407251, now seen corresponding path program 4 times [2025-02-08 01:11:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512330704] [2025-02-08 01:11:48,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:11:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:48,850 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:48,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-02-08 01:11:48,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:11:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512330704] [2025-02-08 01:11:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512330704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133215171] [2025-02-08 01:11:48,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:11:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:48,977 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:11:48,978 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:11:49,025 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:49,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-02-08 01:11:49,036 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:11:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:49,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:11:49,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:49,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133215171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:49,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 01:11:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76382846] [2025-02-08 01:11:49,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:11:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:49,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:11:49,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:11:49,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:49,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 256 flow. Second operand has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 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:11:49,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:49,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:49,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:49,961 INFO L124 PetriNetUnfolderBase]: 2809/4129 cut-off events. [2025-02-08 01:11:49,962 INFO L125 PetriNetUnfolderBase]: For 4662/4662 co-relation queries the response was YES. [2025-02-08 01:11:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10969 conditions, 4129 events. 2809/4129 cut-off events. For 4662/4662 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 20577 event pairs, 333 based on Foata normal form. 2/3490 useless extension candidates. Maximal degree in co-relation 10936. Up to 1470 conditions per place. [2025-02-08 01:11:49,974 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 107 selfloop transitions, 17 changer transitions 14/139 dead transitions. [2025-02-08 01:11:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 139 transitions, 918 flow [2025-02-08 01:11:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:11:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:11:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-02-08 01:11:49,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-02-08 01:11:49,975 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 256 flow. Second operand 9 states and 150 transitions. [2025-02-08 01:11:49,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 139 transitions, 918 flow [2025-02-08 01:11:49,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 869 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-02-08 01:11:49,979 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 334 flow [2025-02-08 01:11:49,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2025-02-08 01:11:49,980 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2025-02-08 01:11:49,980 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 334 flow [2025-02-08 01:11:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 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:11:49,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:49,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:49,989 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:11:50,181 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,SelfDestructingSolverStorable9 [2025-02-08 01:11:50,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1909823353, now seen corresponding path program 5 times [2025-02-08 01:11:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584709454] [2025-02-08 01:11:50,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:11:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:50,188 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:50,199 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:50,199 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:50,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584709454] [2025-02-08 01:11:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584709454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907588890] [2025-02-08 01:11:50,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:11:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:50,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:11:50,469 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:11:50,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:50,537 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:50,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:50,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:50,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 01:11:50,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:50,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907588890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:50,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 24 [2025-02-08 01:11:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525363848] [2025-02-08 01:11:50,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 01:11:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 01:11:50,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-02-08 01:11:50,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:50,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 334 flow. Second operand has 24 states, 24 states have (on average 6.958333333333333) internal successors, (167), 24 states have internal predecessors, (167), 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:11:50,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:50,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:50,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:52,309 INFO L124 PetriNetUnfolderBase]: 5646/8306 cut-off events. [2025-02-08 01:11:52,309 INFO L125 PetriNetUnfolderBase]: For 13860/13860 co-relation queries the response was YES. [2025-02-08 01:11:52,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25976 conditions, 8306 events. 5646/8306 cut-off events. For 13860/13860 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 45439 event pairs, 492 based on Foata normal form. 6/7669 useless extension candidates. Maximal degree in co-relation 25876. Up to 1364 conditions per place. [2025-02-08 01:11:52,339 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 215 selfloop transitions, 41 changer transitions 48/305 dead transitions. [2025-02-08 01:11:52,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 305 transitions, 2070 flow [2025-02-08 01:11:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 01:11:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 01:11:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 368 transitions. [2025-02-08 01:11:52,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33153153153153153 [2025-02-08 01:11:52,341 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 334 flow. Second operand 30 states and 368 transitions. [2025-02-08 01:11:52,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 305 transitions, 2070 flow [2025-02-08 01:11:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 305 transitions, 2031 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-02-08 01:11:52,356 INFO L231 Difference]: Finished difference. Result has 108 places, 76 transitions, 646 flow [2025-02-08 01:11:52,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=646, PETRI_PLACES=108, PETRI_TRANSITIONS=76} [2025-02-08 01:11:52,357 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 71 predicate places. [2025-02-08 01:11:52,357 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 76 transitions, 646 flow [2025-02-08 01:11:52,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.958333333333333) internal successors, (167), 24 states have internal predecessors, (167), 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:11:52,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:52,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:52,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:52,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:52,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1853226647, now seen corresponding path program 6 times [2025-02-08 01:11:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733579115] [2025-02-08 01:11:52,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:11:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:52,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:11:52,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-08 01:11:52,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:11:52,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733579115] [2025-02-08 01:11:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733579115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:11:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137988937] [2025-02-08 01:11:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:52,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:11:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:11:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:11:52,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:52,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 76 transitions, 646 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:52,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:52,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:53,295 INFO L124 PetriNetUnfolderBase]: 4376/6414 cut-off events. [2025-02-08 01:11:53,296 INFO L125 PetriNetUnfolderBase]: For 14574/14574 co-relation queries the response was YES. [2025-02-08 01:11:53,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21400 conditions, 6414 events. 4376/6414 cut-off events. For 14574/14574 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32586 event pairs, 1429 based on Foata normal form. 6/5881 useless extension candidates. Maximal degree in co-relation 21301. Up to 2861 conditions per place. [2025-02-08 01:11:53,322 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 90 selfloop transitions, 11 changer transitions 45/147 dead transitions. [2025-02-08 01:11:53,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1227 flow [2025-02-08 01:11:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:11:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:11:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-02-08 01:11:53,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-02-08 01:11:53,324 INFO L175 Difference]: Start difference. First operand has 108 places, 76 transitions, 646 flow. Second operand 9 states and 129 transitions. [2025-02-08 01:11:53,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1227 flow [2025-02-08 01:11:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 147 transitions, 1139 flow, removed 17 selfloop flow, removed 13 redundant places. [2025-02-08 01:11:53,344 INFO L231 Difference]: Finished difference. Result has 102 places, 70 transitions, 505 flow [2025-02-08 01:11:53,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=102, PETRI_TRANSITIONS=70} [2025-02-08 01:11:53,345 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2025-02-08 01:11:53,345 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 70 transitions, 505 flow [2025-02-08 01:11:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:53,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:53,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:11:53,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:53,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash 400423053, now seen corresponding path program 7 times [2025-02-08 01:11:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:53,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337589224] [2025-02-08 01:11:53,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:11:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:53,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:53,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:53,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:53,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337589224] [2025-02-08 01:11:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337589224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967713728] [2025-02-08 01:11:53,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:11:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:53,577 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:11:53,579 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:11:53,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:53,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:11:53,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:53,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967713728] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-02-08 01:11:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902088389] [2025-02-08 01:11:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:11:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:53,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:11:53,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:11:53,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:53,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 70 transitions, 505 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:53,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:53,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:53,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:54,443 INFO L124 PetriNetUnfolderBase]: 3098/4562 cut-off events. [2025-02-08 01:11:54,443 INFO L125 PetriNetUnfolderBase]: For 9786/9786 co-relation queries the response was YES. [2025-02-08 01:11:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15595 conditions, 4562 events. 3098/4562 cut-off events. For 9786/9786 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21810 event pairs, 915 based on Foata normal form. 8/4216 useless extension candidates. Maximal degree in co-relation 15544. Up to 2830 conditions per place. [2025-02-08 01:11:54,474 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 52 selfloop transitions, 11 changer transitions 46/110 dead transitions. [2025-02-08 01:11:54,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 110 transitions, 870 flow [2025-02-08 01:11:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:11:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:11:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2025-02-08 01:11:54,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:11:54,477 INFO L175 Difference]: Start difference. First operand has 102 places, 70 transitions, 505 flow. Second operand 10 states and 115 transitions. [2025-02-08 01:11:54,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 110 transitions, 870 flow [2025-02-08 01:11:54,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 110 transitions, 823 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-08 01:11:54,491 INFO L231 Difference]: Finished difference. Result has 101 places, 59 transitions, 390 flow [2025-02-08 01:11:54,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=101, PETRI_TRANSITIONS=59} [2025-02-08 01:11:54,491 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-02-08 01:11:54,491 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 59 transitions, 390 flow [2025-02-08 01:11:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:54,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:54,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:54,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 01:11:54,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:54,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2132804090, now seen corresponding path program 1 times [2025-02-08 01:11:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18644024] [2025-02-08 01:11:54,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:54,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:11:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18644024] [2025-02-08 01:11:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18644024] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145458668] [2025-02-08 01:11:54,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:54,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:54,805 INFO L229 MonitoredProcess]: Starting monitored process 10 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:11:54,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 01:11:54,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:11:54,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:11:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:54,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:54,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:54,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:54,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145458668] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:55,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-02-08 01:11:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686443692] [2025-02-08 01:11:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:55,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:55,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:55,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:11:55,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:55,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 59 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:11:55,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:55,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:55,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:55,200 INFO L124 PetriNetUnfolderBase]: 1572/2268 cut-off events. [2025-02-08 01:11:55,200 INFO L125 PetriNetUnfolderBase]: For 5503/5503 co-relation queries the response was YES. [2025-02-08 01:11:55,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7826 conditions, 2268 events. 1572/2268 cut-off events. For 5503/5503 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8988 event pairs, 509 based on Foata normal form. 108/2240 useless extension candidates. Maximal degree in co-relation 7794. Up to 1162 conditions per place. [2025-02-08 01:11:55,207 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 54 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2025-02-08 01:11:55,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 70 transitions, 573 flow [2025-02-08 01:11:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-02-08 01:11:55,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28185328185328185 [2025-02-08 01:11:55,208 INFO L175 Difference]: Start difference. First operand has 101 places, 59 transitions, 390 flow. Second operand 7 states and 73 transitions. [2025-02-08 01:11:55,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 70 transitions, 573 flow [2025-02-08 01:11:55,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 528 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-02-08 01:11:55,213 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 364 flow [2025-02-08 01:11:55,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-02-08 01:11:55,213 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2025-02-08 01:11:55,214 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 364 flow [2025-02-08 01:11:55,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:11:55,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:55,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:55,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:55,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:55,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:55,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash 945995856, now seen corresponding path program 1 times [2025-02-08 01:11:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:55,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116554401] [2025-02-08 01:11:55,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:55,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:11:55,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:11:55,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:55,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:55,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116554401] [2025-02-08 01:11:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116554401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124707941] [2025-02-08 01:11:55,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:55,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:55,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:55,540 INFO L229 MonitoredProcess]: Starting monitored process 11 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:11:55,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 01:11:55,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:11:55,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:11:55,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:55,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:55,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:11:55,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:55,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:11:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124707941] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-02-08 01:11:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052680399] [2025-02-08 01:11:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:11:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:11:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:11:55,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:55,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:55,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:55,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:55,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:55,970 INFO L124 PetriNetUnfolderBase]: 1898/2728 cut-off events. [2025-02-08 01:11:55,971 INFO L125 PetriNetUnfolderBase]: For 5316/5316 co-relation queries the response was YES. [2025-02-08 01:11:55,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 2728 events. 1898/2728 cut-off events. For 5316/5316 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10998 event pairs, 779 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 4544. Up to 1660 conditions per place. [2025-02-08 01:11:55,982 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 55 selfloop transitions, 16 changer transitions 0/72 dead transitions. [2025-02-08 01:11:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 592 flow [2025-02-08 01:11:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:11:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:11:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-02-08 01:11:55,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.277992277992278 [2025-02-08 01:11:55,983 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 364 flow. Second operand 7 states and 72 transitions. [2025-02-08 01:11:55,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 592 flow [2025-02-08 01:11:55,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 569 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:55,986 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 401 flow [2025-02-08 01:11:55,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2025-02-08 01:11:55,987 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2025-02-08 01:11:55,987 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 401 flow [2025-02-08 01:11:55,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:55,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:55,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:55,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 01:11:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 01:11:56,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:56,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -197807041, now seen corresponding path program 1 times [2025-02-08 01:11:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644699171] [2025-02-08 01:11:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:56,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:11:56,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:11:56,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:56,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644699171] [2025-02-08 01:11:56,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644699171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637393542] [2025-02-08 01:11:56,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:56,411 INFO L229 MonitoredProcess]: Starting monitored process 12 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:11:56,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 01:11:56,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:11:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:11:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:56,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:56,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 01:11:56,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:11:56,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:11:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637393542] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:11:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 10] total 21 [2025-02-08 01:11:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332754488] [2025-02-08 01:11:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:11:56,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:56,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:56,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:56,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:57,349 INFO L124 PetriNetUnfolderBase]: 4056/5802 cut-off events. [2025-02-08 01:11:57,350 INFO L125 PetriNetUnfolderBase]: For 9391/9391 co-relation queries the response was YES. [2025-02-08 01:11:57,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20478 conditions, 5802 events. 4056/5802 cut-off events. For 9391/9391 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28385 event pairs, 132 based on Foata normal form. 2/5802 useless extension candidates. Maximal degree in co-relation 10237. Up to 2246 conditions per place. [2025-02-08 01:11:57,416 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 83 selfloop transitions, 8 changer transitions 24/116 dead transitions. [2025-02-08 01:11:57,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 903 flow [2025-02-08 01:11:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2025-02-08 01:11:57,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2025-02-08 01:11:57,417 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 401 flow. Second operand 6 states and 103 transitions. [2025-02-08 01:11:57,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 903 flow [2025-02-08 01:11:57,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 116 transitions, 873 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:57,432 INFO L231 Difference]: Finished difference. Result has 78 places, 55 transitions, 384 flow [2025-02-08 01:11:57,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=78, PETRI_TRANSITIONS=55} [2025-02-08 01:11:57,433 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2025-02-08 01:11:57,433 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 384 flow [2025-02-08 01:11:57,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:57,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:57,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:57,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 01:11:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 01:11:57,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1098158883, now seen corresponding path program 2 times [2025-02-08 01:11:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422043999] [2025-02-08 01:11:57,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:57,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:11:57,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 30 statements. [2025-02-08 01:11:57,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:11:57,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:11:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:57,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422043999] [2025-02-08 01:11:57,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422043999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:57,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:57,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147503076] [2025-02-08 01:11:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:57,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:57,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:57,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:57,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:57,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 55 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:57,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:57,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:57,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:58,390 INFO L124 PetriNetUnfolderBase]: 4704/6724 cut-off events. [2025-02-08 01:11:58,390 INFO L125 PetriNetUnfolderBase]: For 13253/13253 co-relation queries the response was YES. [2025-02-08 01:11:58,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23489 conditions, 6724 events. 4704/6724 cut-off events. For 13253/13253 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33537 event pairs, 344 based on Foata normal form. 2/6724 useless extension candidates. Maximal degree in co-relation 23444. Up to 3468 conditions per place. [2025-02-08 01:11:58,410 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 77 selfloop transitions, 7 changer transitions 26/111 dead transitions. [2025-02-08 01:11:58,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 864 flow [2025-02-08 01:11:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-02-08 01:11:58,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45495495495495497 [2025-02-08 01:11:58,411 INFO L175 Difference]: Start difference. First operand has 78 places, 55 transitions, 384 flow. Second operand 6 states and 101 transitions. [2025-02-08 01:11:58,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 864 flow [2025-02-08 01:11:58,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 111 transitions, 848 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:11:58,417 INFO L231 Difference]: Finished difference. Result has 82 places, 51 transitions, 347 flow [2025-02-08 01:11:58,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=82, PETRI_TRANSITIONS=51} [2025-02-08 01:11:58,417 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2025-02-08 01:11:58,417 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 51 transitions, 347 flow [2025-02-08 01:11:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:58,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:58,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:58,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:11:58,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1876707609, now seen corresponding path program 3 times [2025-02-08 01:11:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462320755] [2025-02-08 01:11:58,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:11:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:58,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:11:58,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 30 statements. [2025-02-08 01:11:58,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:11:58,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:11:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462320755] [2025-02-08 01:11:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462320755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078351432] [2025-02-08 01:11:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:58,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:58,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 51 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:58,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:58,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:59,073 INFO L124 PetriNetUnfolderBase]: 4658/6636 cut-off events. [2025-02-08 01:11:59,073 INFO L125 PetriNetUnfolderBase]: For 15662/15662 co-relation queries the response was YES. [2025-02-08 01:11:59,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23352 conditions, 6636 events. 4658/6636 cut-off events. For 15662/15662 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 32586 event pairs, 702 based on Foata normal form. 2/6636 useless extension candidates. Maximal degree in co-relation 23305. Up to 3468 conditions per place. [2025-02-08 01:11:59,097 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 75 selfloop transitions, 8 changer transitions 20/104 dead transitions. [2025-02-08 01:11:59,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 812 flow [2025-02-08 01:11:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-02-08 01:11:59,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-02-08 01:11:59,098 INFO L175 Difference]: Start difference. First operand has 82 places, 51 transitions, 347 flow. Second operand 6 states and 96 transitions. [2025-02-08 01:11:59,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 812 flow [2025-02-08 01:11:59,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 762 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-08 01:11:59,108 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 319 flow [2025-02-08 01:11:59,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2025-02-08 01:11:59,108 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2025-02-08 01:11:59,108 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 319 flow [2025-02-08 01:11:59,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:59,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:59,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:59,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:11:59,109 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:59,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1757244425, now seen corresponding path program 4 times [2025-02-08 01:11:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013194376] [2025-02-08 01:11:59,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:11:59,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:59,114 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:11:59,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:11:59,118 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:11:59,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:11:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013194376] [2025-02-08 01:11:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013194376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:11:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689369069] [2025-02-08 01:11:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:59,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:11:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:59,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:11:59,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:11:59,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:11:59,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:59,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:59,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:11:59,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:59,570 INFO L124 PetriNetUnfolderBase]: 3550/5074 cut-off events. [2025-02-08 01:11:59,574 INFO L125 PetriNetUnfolderBase]: For 11845/11845 co-relation queries the response was YES. [2025-02-08 01:11:59,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18007 conditions, 5074 events. 3550/5074 cut-off events. For 11845/11845 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24492 event pairs, 54 based on Foata normal form. 2/5074 useless extension candidates. Maximal degree in co-relation 17970. Up to 1842 conditions per place. [2025-02-08 01:11:59,604 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 72 selfloop transitions, 6 changer transitions 25/104 dead transitions. [2025-02-08 01:11:59,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 771 flow [2025-02-08 01:11:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:11:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:11:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-02-08 01:11:59,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4369369369369369 [2025-02-08 01:11:59,605 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 319 flow. Second operand 6 states and 97 transitions. [2025-02-08 01:11:59,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 104 transitions, 771 flow [2025-02-08 01:11:59,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 743 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 01:11:59,614 INFO L231 Difference]: Finished difference. Result has 81 places, 48 transitions, 290 flow [2025-02-08 01:11:59,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=81, PETRI_TRANSITIONS=48} [2025-02-08 01:11:59,615 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-02-08 01:11:59,615 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 48 transitions, 290 flow [2025-02-08 01:11:59,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:11:59,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:59,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:11:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:11:59,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:11:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -920451101, now seen corresponding path program 5 times [2025-02-08 01:11:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108201706] [2025-02-08 01:11:59,616 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:11:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:59,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:11:59,642 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:11:59,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:12:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108201706] [2025-02-08 01:12:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108201706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:12:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132793911] [2025-02-08 01:12:00,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:12:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:12:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:12:00,080 INFO L229 MonitoredProcess]: Starting monitored process 13 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:12:00,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 01:12:00,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:12:00,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:12:00,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:12:00,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:00,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 01:12:00,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:12:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:12:00,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:12:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:12:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132793911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:12:00,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:12:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-02-08 01:12:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732409585] [2025-02-08 01:12:00,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:12:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 01:12:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:00,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 01:12:00,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-02-08 01:12:00,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:12:00,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 48 transitions, 290 flow. Second operand has 30 states, 30 states have (on average 6.9) internal successors, (207), 30 states have internal predecessors, (207), 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:12:00,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:00,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:12:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:02,302 INFO L124 PetriNetUnfolderBase]: 7696/10958 cut-off events. [2025-02-08 01:12:02,303 INFO L125 PetriNetUnfolderBase]: For 25295/25295 co-relation queries the response was YES. [2025-02-08 01:12:02,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39143 conditions, 10958 events. 7696/10958 cut-off events. For 25295/25295 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 57138 event pairs, 3181 based on Foata normal form. 8/10960 useless extension candidates. Maximal degree in co-relation 39099. Up to 3109 conditions per place. [2025-02-08 01:12:02,333 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 70 selfloop transitions, 15 changer transitions 153/239 dead transitions. [2025-02-08 01:12:02,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 239 transitions, 1843 flow [2025-02-08 01:12:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 01:12:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-08 01:12:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 299 transitions. [2025-02-08 01:12:02,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:12:02,335 INFO L175 Difference]: Start difference. First operand has 81 places, 48 transitions, 290 flow. Second operand 26 states and 299 transitions. [2025-02-08 01:12:02,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 239 transitions, 1843 flow [2025-02-08 01:12:02,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 239 transitions, 1799 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-08 01:12:02,344 INFO L231 Difference]: Finished difference. Result has 115 places, 56 transitions, 420 flow [2025-02-08 01:12:02,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=420, PETRI_PLACES=115, PETRI_TRANSITIONS=56} [2025-02-08 01:12:02,345 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2025-02-08 01:12:02,345 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 56 transitions, 420 flow [2025-02-08 01:12:02,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.9) internal successors, (207), 30 states have internal predecessors, (207), 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:12:02,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:02,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:02,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 01:12:02,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:12:02,546 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:02,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2016212034, now seen corresponding path program 6 times [2025-02-08 01:12:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646653816] [2025-02-08 01:12:02,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:12:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:02,553 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:12:02,566 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 31 statements. [2025-02-08 01:12:02,566 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:12:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:12:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646653816] [2025-02-08 01:12:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646653816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:12:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047057951] [2025-02-08 01:12:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:12:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:02,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:12:02,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:12:02,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:12:02,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 56 transitions, 420 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:02,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:02,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:12:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:03,721 INFO L124 PetriNetUnfolderBase]: 6416/9106 cut-off events. [2025-02-08 01:12:03,722 INFO L125 PetriNetUnfolderBase]: For 19970/19970 co-relation queries the response was YES. [2025-02-08 01:12:03,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32862 conditions, 9106 events. 6416/9106 cut-off events. For 19970/19970 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 48080 event pairs, 615 based on Foata normal form. 3/9107 useless extension candidates. Maximal degree in co-relation 32817. Up to 4123 conditions per place. [2025-02-08 01:12:03,765 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 115 selfloop transitions, 19 changer transitions 25/160 dead transitions. [2025-02-08 01:12:03,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 160 transitions, 1307 flow [2025-02-08 01:12:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:12:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:12:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2025-02-08 01:12:03,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36036036036036034 [2025-02-08 01:12:03,769 INFO L175 Difference]: Start difference. First operand has 115 places, 56 transitions, 420 flow. Second operand 12 states and 160 transitions. [2025-02-08 01:12:03,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 160 transitions, 1307 flow [2025-02-08 01:12:03,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 160 transitions, 1227 flow, removed 35 selfloop flow, removed 16 redundant places. [2025-02-08 01:12:03,778 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 567 flow [2025-02-08 01:12:03,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=567, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2025-02-08 01:12:03,779 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-02-08 01:12:03,779 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 567 flow [2025-02-08 01:12:03,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:03,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:03,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 01:12:03,781 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 819132944, now seen corresponding path program 7 times [2025-02-08 01:12:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344687766] [2025-02-08 01:12:03,781 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:12:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:03,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:12:03,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:12:03,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:03,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:12:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:03,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344687766] [2025-02-08 01:12:03,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344687766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:12:03,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678602135] [2025-02-08 01:12:03,881 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:12:03,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:12:03,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:12:03,884 INFO L229 MonitoredProcess]: Starting monitored process 14 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:12:03,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 01:12:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:12:03,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:12:03,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:03,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:03,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 01:12:03,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:12:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:12:04,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:12:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:12:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678602135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:12:04,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:12:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-02-08 01:12:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776368479] [2025-02-08 01:12:04,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:12:04,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 01:12:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:04,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 01:12:04,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:12:04,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:12:04,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 567 flow. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 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:12:04,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:04,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:12:04,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:04,910 INFO L124 PetriNetUnfolderBase]: 7977/11297 cut-off events. [2025-02-08 01:12:04,910 INFO L125 PetriNetUnfolderBase]: For 30751/30751 co-relation queries the response was YES. [2025-02-08 01:12:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45867 conditions, 11297 events. 7977/11297 cut-off events. For 30751/30751 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 59413 event pairs, 4698 based on Foata normal form. 2/11296 useless extension candidates. Maximal degree in co-relation 45815. Up to 5648 conditions per place. [2025-02-08 01:12:04,973 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 114 selfloop transitions, 7 changer transitions 60/182 dead transitions. [2025-02-08 01:12:04,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 182 transitions, 1704 flow [2025-02-08 01:12:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:12:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:12:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2025-02-08 01:12:04,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3366093366093366 [2025-02-08 01:12:04,974 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 567 flow. Second operand 11 states and 137 transitions. [2025-02-08 01:12:04,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 182 transitions, 1704 flow [2025-02-08 01:12:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 182 transitions, 1683 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 01:12:05,003 INFO L231 Difference]: Finished difference. Result has 111 places, 75 transitions, 595 flow [2025-02-08 01:12:05,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=595, PETRI_PLACES=111, PETRI_TRANSITIONS=75} [2025-02-08 01:12:05,003 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2025-02-08 01:12:05,003 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 75 transitions, 595 flow [2025-02-08 01:12:05,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 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:12:05,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:05,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:05,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 01:12:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:12:05,208 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash 733232108, now seen corresponding path program 8 times [2025-02-08 01:12:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240055937] [2025-02-08 01:12:05,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:05,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:12:05,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 31 statements. [2025-02-08 01:12:05,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:12:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240055937] [2025-02-08 01:12:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240055937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106184426] [2025-02-08 01:12:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:05,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:05,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:12:05,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 75 transitions, 595 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:05,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:05,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:12:05,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:06,104 INFO L124 PetriNetUnfolderBase]: 5984/8474 cut-off events. [2025-02-08 01:12:06,104 INFO L125 PetriNetUnfolderBase]: For 22880/22880 co-relation queries the response was YES. [2025-02-08 01:12:06,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34529 conditions, 8474 events. 5984/8474 cut-off events. For 22880/22880 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 43896 event pairs, 852 based on Foata normal form. 3/8477 useless extension candidates. Maximal degree in co-relation 34485. Up to 5025 conditions per place. [2025-02-08 01:12:06,156 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 84 selfloop transitions, 6 changer transitions 28/119 dead transitions. [2025-02-08 01:12:06,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 119 transitions, 1104 flow [2025-02-08 01:12:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-02-08 01:12:06,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34684684684684686 [2025-02-08 01:12:06,157 INFO L175 Difference]: Start difference. First operand has 111 places, 75 transitions, 595 flow. Second operand 6 states and 77 transitions. [2025-02-08 01:12:06,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 119 transitions, 1104 flow [2025-02-08 01:12:06,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 1075 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-02-08 01:12:06,182 INFO L231 Difference]: Finished difference. Result has 106 places, 72 transitions, 537 flow [2025-02-08 01:12:06,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=537, PETRI_PLACES=106, PETRI_TRANSITIONS=72} [2025-02-08 01:12:06,183 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2025-02-08 01:12:06,183 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 72 transitions, 537 flow [2025-02-08 01:12:06,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:06,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:06,183 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:06,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 01:12:06,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:06,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -633268516, now seen corresponding path program 9 times [2025-02-08 01:12:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:06,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073953815] [2025-02-08 01:12:06,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:12:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:06,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:12:06,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-02-08 01:12:06,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:12:06,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:12:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073953815] [2025-02-08 01:12:06,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073953815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:06,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:06,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256801115] [2025-02-08 01:12:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:06,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:06,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:06,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:06,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:12:06,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 72 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:06,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:06,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:12:06,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:06,662 INFO L124 PetriNetUnfolderBase]: 3614/5135 cut-off events. [2025-02-08 01:12:06,662 INFO L125 PetriNetUnfolderBase]: For 14683/14683 co-relation queries the response was YES. [2025-02-08 01:12:06,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20906 conditions, 5135 events. 3614/5135 cut-off events. For 14683/14683 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24299 event pairs, 558 based on Foata normal form. 3/5136 useless extension candidates. Maximal degree in co-relation 20876. Up to 4617 conditions per place. [2025-02-08 01:12:06,683 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2025-02-08 01:12:06,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 95 transitions, 874 flow [2025-02-08 01:12:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-02-08 01:12:06,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2972972972972973 [2025-02-08 01:12:06,685 INFO L175 Difference]: Start difference. First operand has 106 places, 72 transitions, 537 flow. Second operand 6 states and 66 transitions. [2025-02-08 01:12:06,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 95 transitions, 874 flow [2025-02-08 01:12:06,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 845 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-02-08 01:12:06,697 INFO L231 Difference]: Finished difference. Result has 100 places, 0 transitions, 0 flow [2025-02-08 01:12:06,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=100, PETRI_TRANSITIONS=0} [2025-02-08 01:12:06,698 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2025-02-08 01:12:06,698 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 0 transitions, 0 flow [2025-02-08 01:12:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:06,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-08 01:12:06,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-08 01:12:06,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 01:12:06,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 01:12:06,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 01:12:06,701 INFO L422 BasicCegarLoop]: Path program histogram: [9, 7, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:06,703 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:12:06,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:12:06,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:12:06 BasicIcfg [2025-02-08 01:12:06,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:12:06,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:12:06,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:12:06,707 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:12:06,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:40" (3/4) ... [2025-02-08 01:12:06,709 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:12:06,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:12:06,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:12:06,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 01:12:06,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2025-02-08 01:12:06,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2025-02-08 01:12:06,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 01:12:06,720 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 01:12:06,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:12:06,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:12:06,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:12:06,782 INFO L158 Benchmark]: Toolchain (without parser) took 27651.94ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 105.4MB in the beginning and 447.6MB in the end (delta: -342.2MB). Peak memory consumption was 774.1MB. Max. memory is 16.1GB. [2025-02-08 01:12:06,783 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:12:06,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:12:06,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:12:06,784 INFO L158 Benchmark]: Boogie Preprocessor took 53.63ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:12:06,784 INFO L158 Benchmark]: IcfgBuilder took 688.35ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 2.0MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-08 01:12:06,784 INFO L158 Benchmark]: TraceAbstraction took 26593.11ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.6MB in the beginning and 452.0MB in the end (delta: -366.3MB). Peak memory consumption was 742.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:06,784 INFO L158 Benchmark]: Witness Printer took 74.96ms. Allocated memory is still 1.3GB. Free memory was 452.0MB in the beginning and 447.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:06,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.63ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 688.35ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.4MB in the end (delta: 2.0MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26593.11ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.6MB in the beginning and 452.0MB in the end (delta: -366.3MB). Peak memory consumption was 742.4MB. Max. memory is 16.1GB. * Witness Printer took 74.96ms. Allocated memory is still 1.3GB. Free memory was 452.0MB in the beginning and 447.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 50 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3124 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3124 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6802 IncrementalHoareTripleChecker+Invalid, 6891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 0 mSDtfsCounter, 6802 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 559 SyntacticMatches, 12 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=11, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 969 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1253 ConstructedInterpolants, 0 QuantifiedInterpolants, 12766 SizeOfPredicates, 104 NumberOfNonLiveVariables, 3271 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 50 InterpolantComputations, 20 PerfectInterpolantSequences, 115/165 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:12:06,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE