./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-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-node-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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:00,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:00,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:13:00,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:00,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:00,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:00,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:00,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:00,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:00,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:00,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:00,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:00,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:00,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:00,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:00,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:00,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:00,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:00,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:00,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:00,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:00,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:00,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:00,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:00,473 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-02-08 01:13:00,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:00,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:00,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:00,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:00,717 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:00,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-02-08 01:13:01,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e709246df/260990d5ec6144f89cbbd9c00ed77ec3/FLAG4e948cb0b [2025-02-08 01:13:02,127 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:02,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-02-08 01:13:02,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e709246df/260990d5ec6144f89cbbd9c00ed77ec3/FLAG4e948cb0b [2025-02-08 01:13:02,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e709246df/260990d5ec6144f89cbbd9c00ed77ec3 [2025-02-08 01:13:02,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:02,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:02,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:02,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:02,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:02,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1b875b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02, skipping insertion in model container [2025-02-08 01:13:02,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:02,580 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-node-subst.wvr.c[4035,4048] [2025-02-08 01:13:02,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:02,603 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:02,633 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-node-subst.wvr.c[4035,4048] [2025-02-08 01:13:02,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:02,656 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:02,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02 WrapperNode [2025-02-08 01:13:02,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:02,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:02,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:02,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:02,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,716 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-02-08 01:13:02,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:02,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:02,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:02,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:02,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,750 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-02-08 01:13:02,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:02,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:02,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:02,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:02,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (1/1) ... [2025-02-08 01:13:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:02,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:02,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:13:02,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:13:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:13:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:13:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:02,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:02,842 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:13:02,944 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:02,945 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:03,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 01:13:03,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 01:13:03,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,036 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 01:13:03,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 01:13:03,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 01:13:03,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,099 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 01:13:03,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: #t~ite27#1 := #t~ret26#1; [2025-02-08 01:13:03,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 01:13:03,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,154 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-12: #t~ret26#1 := minus_#res#1; [2025-02-08 01:13:03,489 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:03,489 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:03,852 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:03,853 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:03,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:03 BoogieIcfgContainer [2025-02-08 01:13:03,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:03,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:03,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:03,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:03,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:02" (1/3) ... [2025-02-08 01:13:03,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e74a7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:03, skipping insertion in model container [2025-02-08 01:13:03,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:02" (2/3) ... [2025-02-08 01:13:03,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e74a7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:03, skipping insertion in model container [2025-02-08 01:13:03,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:03" (3/3) ... [2025-02-08 01:13:03,861 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-02-08 01:13:03,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:03,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:13:03,874 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:03,925 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:13:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:13:03,974 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2025-02-08 01:13:03,979 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:03,981 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 3. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-08 01:13:03,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:13:03,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 78 flow [2025-02-08 01:13:03,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:04,010 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;@7761168c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:04,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:13:04,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:04,033 INFO L124 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-02-08 01:13:04,034 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:04,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:04,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:04,035 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:13:04,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1946785053, now seen corresponding path program 1 times [2025-02-08 01:13:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:04,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185076794] [2025-02-08 01:13:04,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:04,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:13:04,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:13:04,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:04,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185076794] [2025-02-08 01:13:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185076794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:04,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:13:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549629385] [2025-02-08 01:13:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:04,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:04,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:04,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:04,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:04,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:04,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:04,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:04,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:04,749 INFO L124 PetriNetUnfolderBase]: 130/231 cut-off events. [2025-02-08 01:13:04,749 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 01:13:04,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 231 events. 130/231 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 627 event pairs, 124 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 398. Up to 230 conditions per place. [2025-02-08 01:13:04,752 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-02-08 01:13:04,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 140 flow [2025-02-08 01:13:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-08 01:13:04,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-02-08 01:13:04,760 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 3 states and 43 transitions. [2025-02-08 01:13:04,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 140 flow [2025-02-08 01:13:04,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:04,768 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 78 flow [2025-02-08 01:13:04,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-02-08 01:13:04,776 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-02-08 01:13:04,776 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 78 flow [2025-02-08 01:13:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:04,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:04,780 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:13:04,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:04,781 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:13:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -115586471, now seen corresponding path program 1 times [2025-02-08 01:13:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971417552] [2025-02-08 01:13:04,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:13:04,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:13:04,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:04,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,017 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:13:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971417552] [2025-02-08 01:13:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971417552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957760614] [2025-02-08 01:13:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:05,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,146 INFO L124 PetriNetUnfolderBase]: 130/232 cut-off events. [2025-02-08 01:13:05,147 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:05,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 232 events. 130/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 474. Up to 229 conditions per place. [2025-02-08 01:13:05,150 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-08 01:13:05,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 142 flow [2025-02-08 01:13:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-02-08 01:13:05,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:05,152 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 78 flow. Second operand 4 states and 48 transitions. [2025-02-08 01:13:05,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 142 flow [2025-02-08 01:13:05,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 138 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:05,153 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 92 flow [2025-02-08 01:13:05,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-02-08 01:13:05,155 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 01:13:05,155 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 92 flow [2025-02-08 01:13:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,155 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:13:05,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:05,156 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:13:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1706512525, now seen corresponding path program 1 times [2025-02-08 01:13:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604477731] [2025-02-08 01:13:05,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:13:05,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:13:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,350 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:13:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604477731] [2025-02-08 01:13:05,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604477731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378089467] [2025-02-08 01:13:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:05,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,448 INFO L124 PetriNetUnfolderBase]: 130/233 cut-off events. [2025-02-08 01:13:05,449 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 233 events. 130/233 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 474. Up to 231 conditions per place. [2025-02-08 01:13:05,452 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-08 01:13:05,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 158 flow [2025-02-08 01:13:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:05,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:05,454 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 92 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:05,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 158 flow [2025-02-08 01:13:05,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:05,456 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 105 flow [2025-02-08 01:13:05,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-02-08 01:13:05,457 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-08 01:13:05,457 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 105 flow [2025-02-08 01:13:05,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:05,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:05,458 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:13:05,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1909642725, now seen corresponding path program 1 times [2025-02-08 01:13:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059969595] [2025-02-08 01:13:05,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:13:05,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:13:05,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,708 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:13:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059969595] [2025-02-08 01:13:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059969595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650126266] [2025-02-08 01:13:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:05,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:05,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:13:05,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:13:05,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:13:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:05,895 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:13:05,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:05,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650126266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 01:13:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487573968] [2025-02-08 01:13:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:05,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,993 INFO L124 PetriNetUnfolderBase]: 130/234 cut-off events. [2025-02-08 01:13:05,994 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:13:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 234 events. 130/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 481. Up to 232 conditions per place. [2025-02-08 01:13:05,995 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-02-08 01:13:05,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 173 flow [2025-02-08 01:13:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:05,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:05,996 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 105 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:05,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 173 flow [2025-02-08 01:13:05,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 167 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:05,997 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 113 flow [2025-02-08 01:13:05,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-02-08 01:13:05,998 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-02-08 01:13:05,998 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 113 flow [2025-02-08 01:13:05,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,998 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:13:06,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:13:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:06,203 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:13:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2089559589, now seen corresponding path program 1 times [2025-02-08 01:13:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074510893] [2025-02-08 01:13:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:13:06,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:13:06,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,384 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:13:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074510893] [2025-02-08 01:13:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074510893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:06,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194745332] [2025-02-08 01:13:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:06,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:06,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,468 INFO L124 PetriNetUnfolderBase]: 130/235 cut-off events. [2025-02-08 01:13:06,468 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 01:13:06,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 235 events. 130/235 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 486. Up to 233 conditions per place. [2025-02-08 01:13:06,472 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 31 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-02-08 01:13:06,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 183 flow [2025-02-08 01:13:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:06,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:06,473 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 113 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:06,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 183 flow [2025-02-08 01:13:06,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 177 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:06,474 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 121 flow [2025-02-08 01:13:06,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-02-08 01:13:06,474 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-02-08 01:13:06,474 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 121 flow [2025-02-08 01:13:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,475 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] [2025-02-08 01:13:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:06,475 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:13:06,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1764439928, now seen corresponding path program 1 times [2025-02-08 01:13:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916881908] [2025-02-08 01:13:06,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:13:06,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:13:06,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916881908] [2025-02-08 01:13:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916881908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404024632] [2025-02-08 01:13:06,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:06,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:06,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:13:06,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:13:06,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:13:06,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:06,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:06,810 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:13:06,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404024632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-08 01:13:06,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793104485] [2025-02-08 01:13:06,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:06,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:06,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:06,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,899 INFO L124 PetriNetUnfolderBase]: 130/236 cut-off events. [2025-02-08 01:13:06,899 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 01:13:06,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 236 events. 130/236 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 491. Up to 234 conditions per place. [2025-02-08 01:13:06,900 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 32 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-02-08 01:13:06,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 193 flow [2025-02-08 01:13:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:06,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:06,901 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 121 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:06,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 193 flow [2025-02-08 01:13:06,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 187 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:06,902 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 129 flow [2025-02-08 01:13:06,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-02-08 01:13:06,902 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-02-08 01:13:06,902 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 129 flow [2025-02-08 01:13:06,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,902 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:13:06,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:13:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:07,103 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:13:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash -128739547, now seen corresponding path program 1 times [2025-02-08 01:13:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474919718] [2025-02-08 01:13:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:07,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:07,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:07,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:08,295 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:13:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474919718] [2025-02-08 01:13:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474919718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:08,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324960802] [2025-02-08 01:13:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:08,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:08,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:08,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:08,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:08,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:08,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:08,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:08,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,781 INFO L124 PetriNetUnfolderBase]: 151/294 cut-off events. [2025-02-08 01:13:08,781 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 01:13:08,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 294 events. 151/294 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1079 event pairs, 20 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 611. Up to 88 conditions per place. [2025-02-08 01:13:08,782 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 4 changer transitions 11/78 dead transitions. [2025-02-08 01:13:08,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 382 flow [2025-02-08 01:13:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:13:08,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:13:08,790 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 129 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:13:08,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 382 flow [2025-02-08 01:13:08,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:08,792 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 150 flow [2025-02-08 01:13:08,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2025-02-08 01:13:08,792 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2025-02-08 01:13:08,792 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 150 flow [2025-02-08 01:13:08,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:08,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,792 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:13:08,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:13:08,793 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:13:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 770605207, now seen corresponding path program 2 times [2025-02-08 01:13:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65897051] [2025-02-08 01:13:08,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:08,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:08,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:08,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,479 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:13:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65897051] [2025-02-08 01:13:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65897051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437027859] [2025-02-08 01:13:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:09,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:09,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:09,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:09,966 INFO L124 PetriNetUnfolderBase]: 155/315 cut-off events. [2025-02-08 01:13:09,966 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-02-08 01:13:09,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 315 events. 155/315 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 26 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 867. Up to 102 conditions per place. [2025-02-08 01:13:09,968 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 59 selfloop transitions, 6 changer transitions 7/73 dead transitions. [2025-02-08 01:13:09,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 411 flow [2025-02-08 01:13:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:09,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:09,969 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 150 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:09,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 411 flow [2025-02-08 01:13:09,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 383 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:09,971 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 177 flow [2025-02-08 01:13:09,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-02-08 01:13:09,972 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-02-08 01:13:09,972 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 177 flow [2025-02-08 01:13:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:09,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,972 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:13:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:13:09,973 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:13:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1570090651, now seen corresponding path program 3 times [2025-02-08 01:13:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367433719] [2025-02-08 01:13:09,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:10,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:10,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:10,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,662 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:13:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367433719] [2025-02-08 01:13:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367433719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:10,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96920188] [2025-02-08 01:13:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:10,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:10,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:10,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 177 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:10,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:10,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,047 INFO L124 PetriNetUnfolderBase]: 181/393 cut-off events. [2025-02-08 01:13:11,047 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2025-02-08 01:13:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 393 events. 181/393 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1788 event pairs, 26 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1234. Up to 144 conditions per place. [2025-02-08 01:13:11,049 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2025-02-08 01:13:11,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 541 flow [2025-02-08 01:13:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:11,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:11,050 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 177 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:11,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 541 flow [2025-02-08 01:13:11,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 510 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:11,053 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 222 flow [2025-02-08 01:13:11,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-02-08 01:13:11,054 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-02-08 01:13:11,054 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 222 flow [2025-02-08 01:13:11,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:11,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,054 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:13:11,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:11,054 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:13:11,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1864696795, now seen corresponding path program 4 times [2025-02-08 01:13:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148784809] [2025-02-08 01:13:11,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,065 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:11,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:11,204 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:11,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,036 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:13:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148784809] [2025-02-08 01:13:12,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148784809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464742483] [2025-02-08 01:13:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:12,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:12,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:12,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:12,515 INFO L124 PetriNetUnfolderBase]: 218/504 cut-off events. [2025-02-08 01:13:12,516 INFO L125 PetriNetUnfolderBase]: For 1036/1036 co-relation queries the response was YES. [2025-02-08 01:13:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 504 events. 218/504 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2546 event pairs, 49 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 1714. Up to 209 conditions per place. [2025-02-08 01:13:12,519 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 10 changer transitions 8/87 dead transitions. [2025-02-08 01:13:12,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 593 flow [2025-02-08 01:13:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:12,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:12,521 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 222 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:12,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 593 flow [2025-02-08 01:13:12,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 565 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:12,526 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 313 flow [2025-02-08 01:13:12,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-02-08 01:13:12,530 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2025-02-08 01:13:12,531 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 313 flow [2025-02-08 01:13:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:12,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:12,531 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:13:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:12,531 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:13:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 933879449, now seen corresponding path program 5 times [2025-02-08 01:13:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955121653] [2025-02-08 01:13:12,532 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:12,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:12,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:12,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955121653] [2025-02-08 01:13:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955121653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084941074] [2025-02-08 01:13:13,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:13,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:13,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:13:14,005 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:14,043 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:14,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:14,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:13:14,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:15,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:15,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 449 treesize of output 1245 [2025-02-08 01:13:43,413 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:13:43,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084941074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-02-08 01:13:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092310884] [2025-02-08 01:13:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:43,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-08 01:13:43,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:43,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 313 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:43,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:43,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:43,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:45,352 INFO L124 PetriNetUnfolderBase]: 292/727 cut-off events. [2025-02-08 01:13:45,352 INFO L125 PetriNetUnfolderBase]: For 2504/2504 co-relation queries the response was YES. [2025-02-08 01:13:45,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 727 events. 292/727 cut-off events. For 2504/2504 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4507 event pairs, 51 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 2809. Up to 276 conditions per place. [2025-02-08 01:13:45,358 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 84 selfloop transitions, 11 changer transitions 10/106 dead transitions. [2025-02-08 01:13:45,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 873 flow [2025-02-08 01:13:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:45,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:45,361 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 313 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:45,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 873 flow [2025-02-08 01:13:45,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 844 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:45,368 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 428 flow [2025-02-08 01:13:45,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2025-02-08 01:13:45,370 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2025-02-08 01:13:45,370 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 428 flow [2025-02-08 01:13:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:45,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:45,370 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:13:45,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:13:45,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:45,571 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:13:45,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1299511253, now seen corresponding path program 6 times [2025-02-08 01:13:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914559812] [2025-02-08 01:13:45,571 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:45,591 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:45,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:45,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:45,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:46,121 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:13:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914559812] [2025-02-08 01:13:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914559812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898612091] [2025-02-08 01:13:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:46,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:46,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:46,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:46,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:46,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 428 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:46,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:46,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:46,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:46,632 INFO L124 PetriNetUnfolderBase]: 285/767 cut-off events. [2025-02-08 01:13:46,632 INFO L125 PetriNetUnfolderBase]: For 3430/3430 co-relation queries the response was YES. [2025-02-08 01:13:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 767 events. 285/767 cut-off events. For 3430/3430 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4857 event pairs, 93 based on Foata normal form. 1/767 useless extension candidates. Maximal degree in co-relation 3141. Up to 337 conditions per place. [2025-02-08 01:13:46,637 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 74 selfloop transitions, 16 changer transitions 8/99 dead transitions. [2025-02-08 01:13:46,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 99 transitions, 888 flow [2025-02-08 01:13:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-02-08 01:13:46,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:46,639 INFO L175 Difference]: Start difference. First operand has 80 places, 57 transitions, 428 flow. Second operand 8 states and 96 transitions. [2025-02-08 01:13:46,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 99 transitions, 888 flow [2025-02-08 01:13:46,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 99 transitions, 863 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:46,649 INFO L231 Difference]: Finished difference. Result has 88 places, 63 transitions, 546 flow [2025-02-08 01:13:46,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=88, PETRI_TRANSITIONS=63} [2025-02-08 01:13:46,649 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2025-02-08 01:13:46,649 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 63 transitions, 546 flow [2025-02-08 01:13:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:46,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:46,650 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:13:46,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:13:46,650 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:13:46,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 466211115, now seen corresponding path program 7 times [2025-02-08 01:13:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341153869] [2025-02-08 01:13:46,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:46,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:46,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:46,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:47,273 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:13:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341153869] [2025-02-08 01:13:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341153869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545390000] [2025-02-08 01:13:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:47,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:47,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:47,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 63 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:47,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:47,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:47,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:47,839 INFO L124 PetriNetUnfolderBase]: 368/1067 cut-off events. [2025-02-08 01:13:47,840 INFO L125 PetriNetUnfolderBase]: For 6341/6341 co-relation queries the response was YES. [2025-02-08 01:13:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 1067 events. 368/1067 cut-off events. For 6341/6341 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7978 event pairs, 81 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 4731. Up to 401 conditions per place. [2025-02-08 01:13:47,848 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 114 selfloop transitions, 9 changer transitions 15/139 dead transitions. [2025-02-08 01:13:47,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1447 flow [2025-02-08 01:13:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2025-02-08 01:13:47,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36824324324324326 [2025-02-08 01:13:47,849 INFO L175 Difference]: Start difference. First operand has 88 places, 63 transitions, 546 flow. Second operand 8 states and 109 transitions. [2025-02-08 01:13:47,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1447 flow [2025-02-08 01:13:47,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 139 transitions, 1360 flow, removed 35 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:47,863 INFO L231 Difference]: Finished difference. Result has 95 places, 69 transitions, 620 flow [2025-02-08 01:13:47,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2025-02-08 01:13:47,864 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2025-02-08 01:13:47,864 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 620 flow [2025-02-08 01:13:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:47,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:47,865 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:13:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:13:47,865 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:13:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1589365055, now seen corresponding path program 8 times [2025-02-08 01:13:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345825931] [2025-02-08 01:13:47,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:47,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:47,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:47,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:47,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:48,641 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:13:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345825931] [2025-02-08 01:13:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345825931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252445779] [2025-02-08 01:13:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:48,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:48,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:48,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:48,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:48,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 620 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:48,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:48,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:48,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:49,350 INFO L124 PetriNetUnfolderBase]: 357/1046 cut-off events. [2025-02-08 01:13:49,351 INFO L125 PetriNetUnfolderBase]: For 6595/6595 co-relation queries the response was YES. [2025-02-08 01:13:49,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1046 events. 357/1046 cut-off events. For 6595/6595 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7745 event pairs, 67 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 4804. Up to 538 conditions per place. [2025-02-08 01:13:49,357 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 83 selfloop transitions, 18 changer transitions 7/109 dead transitions. [2025-02-08 01:13:49,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 1100 flow [2025-02-08 01:13:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:49,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:49,359 INFO L175 Difference]: Start difference. First operand has 95 places, 69 transitions, 620 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 1100 flow [2025-02-08 01:13:49,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 1080 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:49,369 INFO L231 Difference]: Finished difference. Result has 100 places, 71 transitions, 680 flow [2025-02-08 01:13:49,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=100, PETRI_TRANSITIONS=71} [2025-02-08 01:13:49,370 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 66 predicate places. [2025-02-08 01:13:49,370 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 71 transitions, 680 flow [2025-02-08 01:13:49,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:49,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:49,370 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:13:49,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:13:49,370 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:13:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1655023785, now seen corresponding path program 9 times [2025-02-08 01:13:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306096999] [2025-02-08 01:13:49,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:49,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:49,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:49,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:49,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:49,926 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:13:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306096999] [2025-02-08 01:13:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306096999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105061571] [2025-02-08 01:13:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:49,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:49,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:49,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:49,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 71 transitions, 680 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:49,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:49,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:50,452 INFO L124 PetriNetUnfolderBase]: 354/1036 cut-off events. [2025-02-08 01:13:50,452 INFO L125 PetriNetUnfolderBase]: For 7256/7256 co-relation queries the response was YES. [2025-02-08 01:13:50,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 1036 events. 354/1036 cut-off events. For 7256/7256 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7737 event pairs, 78 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 5001. Up to 573 conditions per place. [2025-02-08 01:13:50,460 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 101 selfloop transitions, 11 changer transitions 9/122 dead transitions. [2025-02-08 01:13:50,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 1269 flow [2025-02-08 01:13:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:13:50,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:13:50,461 INFO L175 Difference]: Start difference. First operand has 100 places, 71 transitions, 680 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:13:50,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 1269 flow [2025-02-08 01:13:50,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 1212 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:50,473 INFO L231 Difference]: Finished difference. Result has 106 places, 73 transitions, 707 flow [2025-02-08 01:13:50,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=707, PETRI_PLACES=106, PETRI_TRANSITIONS=73} [2025-02-08 01:13:50,474 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2025-02-08 01:13:50,474 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 73 transitions, 707 flow [2025-02-08 01:13:50,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:50,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:50,475 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:13:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:13:50,475 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:13:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1883514571, now seen corresponding path program 10 times [2025-02-08 01:13:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386424412] [2025-02-08 01:13:50,476 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:50,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:50,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:50,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:50,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:51,457 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:13:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386424412] [2025-02-08 01:13:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386424412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:51,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:51,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708466901] [2025-02-08 01:13:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:51,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:51,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:51,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:51,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 73 transitions, 707 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:52,236 INFO L124 PetriNetUnfolderBase]: 377/1140 cut-off events. [2025-02-08 01:13:52,236 INFO L125 PetriNetUnfolderBase]: For 8323/8323 co-relation queries the response was YES. [2025-02-08 01:13:52,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 1140 events. 377/1140 cut-off events. For 8323/8323 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8763 event pairs, 75 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 5465. Up to 610 conditions per place. [2025-02-08 01:13:52,245 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 88 selfloop transitions, 18 changer transitions 13/120 dead transitions. [2025-02-08 01:13:52,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 120 transitions, 1309 flow [2025-02-08 01:13:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:52,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:52,247 INFO L175 Difference]: Start difference. First operand has 106 places, 73 transitions, 707 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:52,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 120 transitions, 1309 flow [2025-02-08 01:13:52,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 120 transitions, 1266 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:52,263 INFO L231 Difference]: Finished difference. Result has 112 places, 76 transitions, 789 flow [2025-02-08 01:13:52,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=789, PETRI_PLACES=112, PETRI_TRANSITIONS=76} [2025-02-08 01:13:52,264 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2025-02-08 01:13:52,265 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 76 transitions, 789 flow [2025-02-08 01:13:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:52,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:52,265 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:13:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:13:52,265 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:13:52,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1738140675, now seen corresponding path program 11 times [2025-02-08 01:13:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977731143] [2025-02-08 01:13:52,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:52,278 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:52,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:52,318 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:53,287 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:13:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977731143] [2025-02-08 01:13:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977731143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788925613] [2025-02-08 01:13:53,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:53,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:53,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:53,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:53,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:13:53,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:53,415 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:53,415 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:53,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:53,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:13:53,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:53,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 247 [2025-02-08 01:13:54,016 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:13:54,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788925613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:54,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:54,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2025-02-08 01:13:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851621007] [2025-02-08 01:13:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:54,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:54,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:54,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:13:54,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:54,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 76 transitions, 789 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:54,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:54,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:54,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:55,154 INFO L124 PetriNetUnfolderBase]: 371/1123 cut-off events. [2025-02-08 01:13:55,154 INFO L125 PetriNetUnfolderBase]: For 9351/9351 co-relation queries the response was YES. [2025-02-08 01:13:55,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5611 conditions, 1123 events. 371/1123 cut-off events. For 9351/9351 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8735 event pairs, 80 based on Foata normal form. 1/1123 useless extension candidates. Maximal degree in co-relation 5554. Up to 649 conditions per place. [2025-02-08 01:13:55,161 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 90 selfloop transitions, 11 changer transitions 18/120 dead transitions. [2025-02-08 01:13:55,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 1319 flow [2025-02-08 01:13:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:55,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:55,163 INFO L175 Difference]: Start difference. First operand has 112 places, 76 transitions, 789 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 1319 flow [2025-02-08 01:13:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 1282 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:55,176 INFO L231 Difference]: Finished difference. Result has 114 places, 72 transitions, 716 flow [2025-02-08 01:13:55,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=106, 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=8, PETRI_FLOW=716, PETRI_PLACES=114, PETRI_TRANSITIONS=72} [2025-02-08 01:13:55,177 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2025-02-08 01:13:55,177 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 72 transitions, 716 flow [2025-02-08 01:13:55,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:55,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:55,177 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:13:55,184 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:13:55,378 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,SelfDestructingSolverStorable16 [2025-02-08 01:13:55,378 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:13:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash -208468657, now seen corresponding path program 12 times [2025-02-08 01:13:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248397861] [2025-02-08 01:13:55,379 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:55,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:55,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:55,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:55,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:55,981 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:13:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248397861] [2025-02-08 01:13:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248397861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912548995] [2025-02-08 01:13:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:55,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:55,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:55,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:55,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 72 transitions, 716 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:55,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:55,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:56,639 INFO L124 PetriNetUnfolderBase]: 368/1172 cut-off events. [2025-02-08 01:13:56,640 INFO L125 PetriNetUnfolderBase]: For 9124/9124 co-relation queries the response was YES. [2025-02-08 01:13:56,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5766 conditions, 1172 events. 368/1172 cut-off events. For 9124/9124 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9316 event pairs, 93 based on Foata normal form. 1/1172 useless extension candidates. Maximal degree in co-relation 5710. Up to 524 conditions per place. [2025-02-08 01:13:56,647 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 112 selfloop transitions, 13 changer transitions 13/139 dead transitions. [2025-02-08 01:13:56,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 1557 flow [2025-02-08 01:13:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-02-08 01:13:56,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2025-02-08 01:13:56,649 INFO L175 Difference]: Start difference. First operand has 114 places, 72 transitions, 716 flow. Second operand 8 states and 108 transitions. [2025-02-08 01:13:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 1557 flow [2025-02-08 01:13:56,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 1499 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:56,664 INFO L231 Difference]: Finished difference. Result has 116 places, 78 transitions, 831 flow [2025-02-08 01:13:56,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=831, PETRI_PLACES=116, PETRI_TRANSITIONS=78} [2025-02-08 01:13:56,666 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2025-02-08 01:13:56,666 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 78 transitions, 831 flow [2025-02-08 01:13:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:56,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:56,666 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:13:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:13:56,667 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:13:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1661138035, now seen corresponding path program 13 times [2025-02-08 01:13:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498633651] [2025-02-08 01:13:56,667 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:56,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:56,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:56,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:56,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:57,133 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:13:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498633651] [2025-02-08 01:13:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498633651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791573251] [2025-02-08 01:13:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:57,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:57,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:57,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:57,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 78 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:57,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:57,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:57,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:57,662 INFO L124 PetriNetUnfolderBase]: 364/1245 cut-off events. [2025-02-08 01:13:57,663 INFO L125 PetriNetUnfolderBase]: For 10177/10177 co-relation queries the response was YES. [2025-02-08 01:13:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 1245 events. 364/1245 cut-off events. For 10177/10177 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10328 event pairs, 106 based on Foata normal form. 1/1245 useless extension candidates. Maximal degree in co-relation 6029. Up to 594 conditions per place. [2025-02-08 01:13:57,673 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 94 selfloop transitions, 21 changer transitions 10/126 dead transitions. [2025-02-08 01:13:57,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 126 transitions, 1561 flow [2025-02-08 01:13:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-02-08 01:13:57,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:57,676 INFO L175 Difference]: Start difference. First operand has 116 places, 78 transitions, 831 flow. Second operand 8 states and 96 transitions. [2025-02-08 01:13:57,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 126 transitions, 1561 flow [2025-02-08 01:13:57,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 126 transitions, 1507 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:57,695 INFO L231 Difference]: Finished difference. Result has 124 places, 86 transitions, 1017 flow [2025-02-08 01:13:57,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1017, PETRI_PLACES=124, PETRI_TRANSITIONS=86} [2025-02-08 01:13:57,696 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 90 predicate places. [2025-02-08 01:13:57,696 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 86 transitions, 1017 flow [2025-02-08 01:13:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:57,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:57,697 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:13:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:13:57,697 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:13:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 910896177, now seen corresponding path program 14 times [2025-02-08 01:13:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601885852] [2025-02-08 01:13:57,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:57,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:57,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:57,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:57,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:58,133 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:13:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601885852] [2025-02-08 01:13:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601885852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:58,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739727501] [2025-02-08 01:13:58,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:58,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:58,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:58,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:58,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 86 transitions, 1017 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:58,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:58,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:58,679 INFO L124 PetriNetUnfolderBase]: 354/1213 cut-off events. [2025-02-08 01:13:58,680 INFO L125 PetriNetUnfolderBase]: For 10775/10775 co-relation queries the response was YES. [2025-02-08 01:13:58,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 1213 events. 354/1213 cut-off events. For 10775/10775 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10036 event pairs, 103 based on Foata normal form. 1/1213 useless extension candidates. Maximal degree in co-relation 6115. Up to 728 conditions per place. [2025-02-08 01:13:58,689 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 96 selfloop transitions, 23 changer transitions 9/129 dead transitions. [2025-02-08 01:13:58,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 129 transitions, 1577 flow [2025-02-08 01:13:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:58,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:58,691 INFO L175 Difference]: Start difference. First operand has 124 places, 86 transitions, 1017 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:58,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 129 transitions, 1577 flow [2025-02-08 01:13:58,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 129 transitions, 1521 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:58,718 INFO L231 Difference]: Finished difference. Result has 128 places, 87 transitions, 1056 flow [2025-02-08 01:13:58,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1056, PETRI_PLACES=128, PETRI_TRANSITIONS=87} [2025-02-08 01:13:58,719 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 94 predicate places. [2025-02-08 01:13:58,719 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 87 transitions, 1056 flow [2025-02-08 01:13:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:58,723 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:13:58,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:13:58,723 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:13:58,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 721609339, now seen corresponding path program 15 times [2025-02-08 01:13:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398120721] [2025-02-08 01:13:58,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:58,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:58,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:58,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:59,224 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:13:59,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:59,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398120721] [2025-02-08 01:13:59,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398120721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:59,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:59,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:59,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473787552] [2025-02-08 01:13:59,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:59,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:59,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:59,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:59,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:59,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 87 transitions, 1056 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:59,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:59,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:59,662 INFO L124 PetriNetUnfolderBase]: 350/1199 cut-off events. [2025-02-08 01:13:59,663 INFO L125 PetriNetUnfolderBase]: For 10391/10391 co-relation queries the response was YES. [2025-02-08 01:13:59,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6138 conditions, 1199 events. 350/1199 cut-off events. For 10391/10391 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9886 event pairs, 103 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 6075. Up to 728 conditions per place. [2025-02-08 01:13:59,669 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 85 selfloop transitions, 20 changer transitions 18/124 dead transitions. [2025-02-08 01:13:59,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1543 flow [2025-02-08 01:13:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:59,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:59,671 INFO L175 Difference]: Start difference. First operand has 128 places, 87 transitions, 1056 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:59,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1543 flow [2025-02-08 01:13:59,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 1505 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:59,691 INFO L231 Difference]: Finished difference. Result has 132 places, 84 transitions, 1006 flow [2025-02-08 01:13:59,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1006, PETRI_PLACES=132, PETRI_TRANSITIONS=84} [2025-02-08 01:13:59,691 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2025-02-08 01:13:59,691 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 84 transitions, 1006 flow [2025-02-08 01:13:59,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:59,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:59,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 01:13:59,692 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:13:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2101001033, now seen corresponding path program 16 times [2025-02-08 01:13:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181970448] [2025-02-08 01:13:59,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:59,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:59,741 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:59,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:59,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:00,342 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:14:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181970448] [2025-02-08 01:14:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181970448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146839519] [2025-02-08 01:14:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:00,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:00,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:00,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 84 transitions, 1006 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:00,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:00,925 INFO L124 PetriNetUnfolderBase]: 339/1168 cut-off events. [2025-02-08 01:14:00,926 INFO L125 PetriNetUnfolderBase]: For 10119/10119 co-relation queries the response was YES. [2025-02-08 01:14:00,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6069 conditions, 1168 events. 339/1168 cut-off events. For 10119/10119 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9576 event pairs, 86 based on Foata normal form. 1/1168 useless extension candidates. Maximal degree in co-relation 6006. Up to 562 conditions per place. [2025-02-08 01:14:00,934 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 18 changer transitions 15/143 dead transitions. [2025-02-08 01:14:00,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 143 transitions, 1778 flow [2025-02-08 01:14:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2025-02-08 01:14:00,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-02-08 01:14:00,936 INFO L175 Difference]: Start difference. First operand has 132 places, 84 transitions, 1006 flow. Second operand 8 states and 106 transitions. [2025-02-08 01:14:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 143 transitions, 1778 flow [2025-02-08 01:14:00,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 1678 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-02-08 01:14:00,987 INFO L231 Difference]: Finished difference. Result has 130 places, 89 transitions, 1081 flow [2025-02-08 01:14:00,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1081, PETRI_PLACES=130, PETRI_TRANSITIONS=89} [2025-02-08 01:14:00,987 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 96 predicate places. [2025-02-08 01:14:00,987 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 89 transitions, 1081 flow [2025-02-08 01:14:00,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:00,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:14:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 01:14:00,987 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:14:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1521005483, now seen corresponding path program 17 times [2025-02-08 01:14:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211360168] [2025-02-08 01:14:00,988 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,000 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:01,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:01,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:14:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211360168] [2025-02-08 01:14:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211360168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007280421] [2025-02-08 01:14:02,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:02,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:02,086 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:14:02,087 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:14:02,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:02,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:02,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:02,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:14:02,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:02,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:02,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 247 [2025-02-08 01:14:02,981 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:14:02,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:14:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007280421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:14:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-02-08 01:14:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732274363] [2025-02-08 01:14:02,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:02,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:14:02,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:02,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 89 transitions, 1081 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:02,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:03,946 INFO L124 PetriNetUnfolderBase]: 330/1142 cut-off events. [2025-02-08 01:14:03,946 INFO L125 PetriNetUnfolderBase]: For 9868/9868 co-relation queries the response was YES. [2025-02-08 01:14:03,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5870 conditions, 1142 events. 330/1142 cut-off events. For 9868/9868 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9334 event pairs, 84 based on Foata normal form. 1/1142 useless extension candidates. Maximal degree in co-relation 5807. Up to 562 conditions per place. [2025-02-08 01:14:03,953 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 18 changer transitions 9/137 dead transitions. [2025-02-08 01:14:03,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 1695 flow [2025-02-08 01:14:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:14:03,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:14:03,954 INFO L175 Difference]: Start difference. First operand has 130 places, 89 transitions, 1081 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:14:03,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 1695 flow [2025-02-08 01:14:03,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 137 transitions, 1666 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:03,975 INFO L231 Difference]: Finished difference. Result has 135 places, 91 transitions, 1146 flow [2025-02-08 01:14:03,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1146, PETRI_PLACES=135, PETRI_TRANSITIONS=91} [2025-02-08 01:14:03,976 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 101 predicate places. [2025-02-08 01:14:03,976 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 91 transitions, 1146 flow [2025-02-08 01:14:03,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:03,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:03,976 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:14:03,983 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:14:04,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 01:14:04,180 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:14:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 947825469, now seen corresponding path program 18 times [2025-02-08 01:14:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396506083] [2025-02-08 01:14:04,181 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:04,191 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:04,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:04,209 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:04,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:04,628 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:14:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396506083] [2025-02-08 01:14:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396506083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129154192] [2025-02-08 01:14:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:04,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:04,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:04,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:04,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 91 transitions, 1146 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:04,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:04,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:04,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:05,135 INFO L124 PetriNetUnfolderBase]: 328/1131 cut-off events. [2025-02-08 01:14:05,135 INFO L125 PetriNetUnfolderBase]: For 10664/10664 co-relation queries the response was YES. [2025-02-08 01:14:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1131 events. 328/1131 cut-off events. For 10664/10664 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9193 event pairs, 84 based on Foata normal form. 1/1131 useless extension candidates. Maximal degree in co-relation 5904. Up to 562 conditions per place. [2025-02-08 01:14:05,147 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 98 selfloop transitions, 15 changer transitions 17/131 dead transitions. [2025-02-08 01:14:05,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 131 transitions, 1676 flow [2025-02-08 01:14:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:14:05,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:14:05,148 INFO L175 Difference]: Start difference. First operand has 135 places, 91 transitions, 1146 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:14:05,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 131 transitions, 1676 flow [2025-02-08 01:14:05,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 1641 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:05,197 INFO L231 Difference]: Finished difference. Result has 138 places, 88 transitions, 1092 flow [2025-02-08 01:14:05,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1092, PETRI_PLACES=138, PETRI_TRANSITIONS=88} [2025-02-08 01:14:05,197 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 104 predicate places. [2025-02-08 01:14:05,198 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 88 transitions, 1092 flow [2025-02-08 01:14:05,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:05,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:05,198 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:14:05,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 01:14:05,198 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:14:05,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1201694369, now seen corresponding path program 19 times [2025-02-08 01:14:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610312737] [2025-02-08 01:14:05,201 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:05,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:14:05,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:05,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:05,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:05,950 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:14:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610312737] [2025-02-08 01:14:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610312737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143530034] [2025-02-08 01:14:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:05,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:05,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:05,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:05,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 88 transitions, 1092 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:05,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:05,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:05,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:06,384 INFO L124 PetriNetUnfolderBase]: 320/1106 cut-off events. [2025-02-08 01:14:06,385 INFO L125 PetriNetUnfolderBase]: For 10365/10365 co-relation queries the response was YES. [2025-02-08 01:14:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5882 conditions, 1106 events. 320/1106 cut-off events. For 10365/10365 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8938 event pairs, 93 based on Foata normal form. 1/1106 useless extension candidates. Maximal degree in co-relation 5818. Up to 562 conditions per place. [2025-02-08 01:14:06,391 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 113 selfloop transitions, 17 changer transitions 9/140 dead transitions. [2025-02-08 01:14:06,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 140 transitions, 1730 flow [2025-02-08 01:14:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2025-02-08 01:14:06,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3614864864864865 [2025-02-08 01:14:06,392 INFO L175 Difference]: Start difference. First operand has 138 places, 88 transitions, 1092 flow. Second operand 8 states and 107 transitions. [2025-02-08 01:14:06,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 140 transitions, 1730 flow [2025-02-08 01:14:06,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 140 transitions, 1678 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:06,412 INFO L231 Difference]: Finished difference. Result has 137 places, 90 transitions, 1136 flow [2025-02-08 01:14:06,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=137, PETRI_TRANSITIONS=90} [2025-02-08 01:14:06,412 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 103 predicate places. [2025-02-08 01:14:06,413 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 90 transitions, 1136 flow [2025-02-08 01:14:06,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:06,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:06,413 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:14:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 01:14:06,413 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:14:06,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -458329087, now seen corresponding path program 20 times [2025-02-08 01:14:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409205622] [2025-02-08 01:14:06,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:06,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:06,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:06,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:06,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:06,750 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:14:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:06,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409205622] [2025-02-08 01:14:06,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409205622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:06,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538815715] [2025-02-08 01:14:06,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:06,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:06,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:06,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:06,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:06,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 90 transitions, 1136 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:06,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:06,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:06,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:07,121 INFO L124 PetriNetUnfolderBase]: 316/1092 cut-off events. [2025-02-08 01:14:07,122 INFO L125 PetriNetUnfolderBase]: For 9949/9949 co-relation queries the response was YES. [2025-02-08 01:14:07,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 1092 events. 316/1092 cut-off events. For 9949/9949 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8801 event pairs, 93 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 5786. Up to 562 conditions per place. [2025-02-08 01:14:07,131 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 102 selfloop transitions, 14 changer transitions 18/135 dead transitions. [2025-02-08 01:14:07,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 1691 flow [2025-02-08 01:14:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:14:07,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:14:07,132 INFO L175 Difference]: Start difference. First operand has 137 places, 90 transitions, 1136 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:14:07,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 1691 flow [2025-02-08 01:14:07,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 1655 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:07,150 INFO L231 Difference]: Finished difference. Result has 140 places, 87 transitions, 1082 flow [2025-02-08 01:14:07,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=140, PETRI_TRANSITIONS=87} [2025-02-08 01:14:07,150 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 106 predicate places. [2025-02-08 01:14:07,151 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 87 transitions, 1082 flow [2025-02-08 01:14:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:07,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:07,151 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:14:07,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 01:14:07,151 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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:14:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1281363145, now seen corresponding path program 21 times [2025-02-08 01:14:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633998382] [2025-02-08 01:14:07,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:07,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:07,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:07,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:07,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:07,572 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:14:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633998382] [2025-02-08 01:14:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633998382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:07,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600547749] [2025-02-08 01:14:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:07,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:07,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:07,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:07,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 87 transitions, 1082 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:07,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:07,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:07,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:08,113 INFO L124 PetriNetUnfolderBase]: 306/1063 cut-off events. [2025-02-08 01:14:08,113 INFO L125 PetriNetUnfolderBase]: For 9653/9653 co-relation queries the response was YES. [2025-02-08 01:14:08,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 1063 events. 306/1063 cut-off events. For 9653/9653 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8549 event pairs, 86 based on Foata normal form. 1/1063 useless extension candidates. Maximal degree in co-relation 5629. Up to 562 conditions per place. [2025-02-08 01:14:08,123 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 111 selfloop transitions, 16 changer transitions 9/137 dead transitions. [2025-02-08 01:14:08,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 137 transitions, 1749 flow [2025-02-08 01:14:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:14:08,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:14:08,124 INFO L175 Difference]: Start difference. First operand has 140 places, 87 transitions, 1082 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:14:08,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 137 transitions, 1749 flow [2025-02-08 01:14:08,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 137 transitions, 1693 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:08,144 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 1194 flow [2025-02-08 01:14:08,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1194, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-02-08 01:14:08,145 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 106 predicate places. [2025-02-08 01:14:08,145 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 1194 flow [2025-02-08 01:14:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:08,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:08,146 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:14:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 01:14:08,147 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:14:08,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1857736831, now seen corresponding path program 22 times [2025-02-08 01:14:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463356978] [2025-02-08 01:14:08,147 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:08,158 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:08,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:08,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:08,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:08,751 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:14:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463356978] [2025-02-08 01:14:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463356978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945434244] [2025-02-08 01:14:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:08,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:08,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 1194 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:09,269 INFO L124 PetriNetUnfolderBase]: 304/1052 cut-off events. [2025-02-08 01:14:09,270 INFO L125 PetriNetUnfolderBase]: For 9961/9961 co-relation queries the response was YES. [2025-02-08 01:14:09,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5726 conditions, 1052 events. 304/1052 cut-off events. For 9961/9961 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8420 event pairs, 87 based on Foata normal form. 1/1052 useless extension candidates. Maximal degree in co-relation 5661. Up to 562 conditions per place. [2025-02-08 01:14:09,276 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 15 changer transitions 8/133 dead transitions. [2025-02-08 01:14:09,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 1703 flow [2025-02-08 01:14:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:14:09,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:14:09,277 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 1194 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:14:09,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 1703 flow [2025-02-08 01:14:09,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 133 transitions, 1657 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:09,295 INFO L231 Difference]: Finished difference. Result has 145 places, 94 transitions, 1216 flow [2025-02-08 01:14:09,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1216, PETRI_PLACES=145, PETRI_TRANSITIONS=94} [2025-02-08 01:14:09,299 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 111 predicate places. [2025-02-08 01:14:09,300 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 94 transitions, 1216 flow [2025-02-08 01:14:09,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:09,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:09,300 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:14:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 01:14:09,300 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:14:09,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash -935087255, now seen corresponding path program 23 times [2025-02-08 01:14:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752019671] [2025-02-08 01:14:09,301 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:09,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:09,375 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:09,375 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:10,302 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:14:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752019671] [2025-02-08 01:14:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752019671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208605282] [2025-02-08 01:14:10,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:10,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:10,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:10,305 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:14:10,306 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:14:10,402 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:10,439 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:10,439 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:10,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:14:10,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:10,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:10,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:10,889 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:14:10,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:14:10,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208605282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:10,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:14:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2025-02-08 01:14:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571381115] [2025-02-08 01:14:10,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:10,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:10,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:10,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:14:10,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:10,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 94 transitions, 1216 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:10,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:10,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:11,748 INFO L124 PetriNetUnfolderBase]: 301/1042 cut-off events. [2025-02-08 01:14:11,749 INFO L125 PetriNetUnfolderBase]: For 9945/9945 co-relation queries the response was YES. [2025-02-08 01:14:11,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 1042 events. 301/1042 cut-off events. For 9945/9945 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8311 event pairs, 86 based on Foata normal form. 1/1042 useless extension candidates. Maximal degree in co-relation 5644. Up to 562 conditions per place. [2025-02-08 01:14:11,754 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 15 changer transitions 11/136 dead transitions. [2025-02-08 01:14:11,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 136 transitions, 1765 flow [2025-02-08 01:14:11,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:14:11,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:14:11,755 INFO L175 Difference]: Start difference. First operand has 145 places, 94 transitions, 1216 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:14:11,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 136 transitions, 1765 flow [2025-02-08 01:14:11,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 136 transitions, 1736 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:11,772 INFO L231 Difference]: Finished difference. Result has 150 places, 93 transitions, 1224 flow [2025-02-08 01:14:11,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1224, PETRI_PLACES=150, PETRI_TRANSITIONS=93} [2025-02-08 01:14:11,775 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 116 predicate places. [2025-02-08 01:14:11,775 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 93 transitions, 1224 flow [2025-02-08 01:14:11,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:11,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:11,775 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:14:11,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 01:14:11,979 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,SelfDestructingSolverStorable28 [2025-02-08 01:14:11,979 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:14:11,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1284556817, now seen corresponding path program 24 times [2025-02-08 01:14:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708158494] [2025-02-08 01:14:11,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:11,990 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:11,995 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:11,995 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:11,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:12,361 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:14:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708158494] [2025-02-08 01:14:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708158494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:12,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940389329] [2025-02-08 01:14:12,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:12,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:12,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:12,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:12,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 93 transitions, 1224 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:12,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:12,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:12,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:12,745 INFO L124 PetriNetUnfolderBase]: 296/1021 cut-off events. [2025-02-08 01:14:12,745 INFO L125 PetriNetUnfolderBase]: For 9913/9913 co-relation queries the response was YES. [2025-02-08 01:14:12,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5605 conditions, 1021 events. 296/1021 cut-off events. For 9913/9913 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8083 event pairs, 86 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 5537. Up to 562 conditions per place. [2025-02-08 01:14:12,751 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 106 selfloop transitions, 14 changer transitions 10/131 dead transitions. [2025-02-08 01:14:12,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 131 transitions, 1696 flow [2025-02-08 01:14:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:14:12,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:14:12,752 INFO L175 Difference]: Start difference. First operand has 150 places, 93 transitions, 1224 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:14:12,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 131 transitions, 1696 flow [2025-02-08 01:14:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 131 transitions, 1657 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:12,774 INFO L231 Difference]: Finished difference. Result has 150 places, 90 transitions, 1159 flow [2025-02-08 01:14:12,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1159, PETRI_PLACES=150, PETRI_TRANSITIONS=90} [2025-02-08 01:14:12,775 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 116 predicate places. [2025-02-08 01:14:12,775 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 90 transitions, 1159 flow [2025-02-08 01:14:12,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:12,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:12,776 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:14:12,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 01:14:12,776 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:14:12,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1771959883, now seen corresponding path program 25 times [2025-02-08 01:14:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:12,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488489396] [2025-02-08 01:14:12,777 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:12,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:14:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:13,302 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:14:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:13,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488489396] [2025-02-08 01:14:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488489396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681878878] [2025-02-08 01:14:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:13,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:13,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 90 transitions, 1159 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:13,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:13,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:13,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:13,722 INFO L124 PetriNetUnfolderBase]: 293/1007 cut-off events. [2025-02-08 01:14:13,722 INFO L125 PetriNetUnfolderBase]: For 9701/9701 co-relation queries the response was YES. [2025-02-08 01:14:13,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 1007 events. 293/1007 cut-off events. For 9701/9701 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7934 event pairs, 86 based on Foata normal form. 1/1007 useless extension candidates. Maximal degree in co-relation 5450. Up to 562 conditions per place. [2025-02-08 01:14:13,729 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 102 selfloop transitions, 13 changer transitions 9/125 dead transitions. [2025-02-08 01:14:13,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 125 transitions, 1609 flow [2025-02-08 01:14:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:14:13,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:14:13,730 INFO L175 Difference]: Start difference. First operand has 150 places, 90 transitions, 1159 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:14:13,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 125 transitions, 1609 flow [2025-02-08 01:14:13,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 125 transitions, 1569 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:13,751 INFO L231 Difference]: Finished difference. Result has 149 places, 89 transitions, 1137 flow [2025-02-08 01:14:13,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1137, PETRI_PLACES=149, PETRI_TRANSITIONS=89} [2025-02-08 01:14:13,751 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:14:13,751 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 89 transitions, 1137 flow [2025-02-08 01:14:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:13,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:13,752 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:14:13,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 01:14:13,752 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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:14:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -128689497, now seen corresponding path program 26 times [2025-02-08 01:14:13,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:13,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115424027] [2025-02-08 01:14:13,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:13,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:13,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:13,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:14,177 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:14:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:14,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115424027] [2025-02-08 01:14:14,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115424027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:14,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:14,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:14,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924721598] [2025-02-08 01:14:14,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:14,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:14,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:14,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:14,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:14,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:14,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 89 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:14,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:14,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:14,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:14,583 INFO L124 PetriNetUnfolderBase]: 289/993 cut-off events. [2025-02-08 01:14:14,584 INFO L125 PetriNetUnfolderBase]: For 9413/9413 co-relation queries the response was YES. [2025-02-08 01:14:14,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 993 events. 289/993 cut-off events. For 9413/9413 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7783 event pairs, 85 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 5362. Up to 562 conditions per place. [2025-02-08 01:14:14,588 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 90 selfloop transitions, 9 changer transitions 20/120 dead transitions. [2025-02-08 01:14:14,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 120 transitions, 1547 flow [2025-02-08 01:14:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-02-08 01:14:14,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32094594594594594 [2025-02-08 01:14:14,589 INFO L175 Difference]: Start difference. First operand has 149 places, 89 transitions, 1137 flow. Second operand 8 states and 95 transitions. [2025-02-08 01:14:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 120 transitions, 1547 flow [2025-02-08 01:14:14,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 120 transitions, 1513 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:14,608 INFO L231 Difference]: Finished difference. Result has 148 places, 84 transitions, 1026 flow [2025-02-08 01:14:14,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1026, PETRI_PLACES=148, PETRI_TRANSITIONS=84} [2025-02-08 01:14:14,609 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2025-02-08 01:14:14,609 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 84 transitions, 1026 flow [2025-02-08 01:14:14,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:14,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:14,609 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:14:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 01:14:14,610 INFO L396 AbstractCegarLoop]: === Iteration 33 === 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:14:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 503061419, now seen corresponding path program 27 times [2025-02-08 01:14:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618791340] [2025-02-08 01:14:14,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:14,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:14,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:14:14,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:14,999 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:14:14,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618791340] [2025-02-08 01:14:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618791340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004274041] [2025-02-08 01:14:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:15,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:15,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:15,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:15,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:15,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 84 transitions, 1026 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:15,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:15,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:15,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:15,584 INFO L124 PetriNetUnfolderBase]: 283/988 cut-off events. [2025-02-08 01:14:15,585 INFO L125 PetriNetUnfolderBase]: For 9248/9248 co-relation queries the response was YES. [2025-02-08 01:14:15,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 988 events. 283/988 cut-off events. For 9248/9248 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7835 event pairs, 66 based on Foata normal form. 1/988 useless extension candidates. Maximal degree in co-relation 5284. Up to 488 conditions per place. [2025-02-08 01:14:15,590 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 101 selfloop transitions, 27 changer transitions 9/138 dead transitions. [2025-02-08 01:14:15,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 1900 flow [2025-02-08 01:14:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:14:15,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:14:15,591 INFO L175 Difference]: Start difference. First operand has 148 places, 84 transitions, 1026 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:14:15,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 1900 flow [2025-02-08 01:14:15,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 138 transitions, 1840 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:15,610 INFO L231 Difference]: Finished difference. Result has 142 places, 92 transitions, 1237 flow [2025-02-08 01:14:15,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1237, PETRI_PLACES=142, PETRI_TRANSITIONS=92} [2025-02-08 01:14:15,610 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 108 predicate places. [2025-02-08 01:14:15,610 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 92 transitions, 1237 flow [2025-02-08 01:14:15,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:15,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:15,611 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:14:15,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 01:14:15,611 INFO L396 AbstractCegarLoop]: === Iteration 34 === 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:14:15,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1819218723, now seen corresponding path program 28 times [2025-02-08 01:14:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:15,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507046731] [2025-02-08 01:14:15,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:15,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:15,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:15,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:16,229 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:14:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507046731] [2025-02-08 01:14:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507046731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:14:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537412268] [2025-02-08 01:14:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:16,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:14:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:16,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:14:16,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:14:16,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:16,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 92 transitions, 1237 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:16,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:16,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:16,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:16,713 INFO L124 PetriNetUnfolderBase]: 281/977 cut-off events. [2025-02-08 01:14:16,713 INFO L125 PetriNetUnfolderBase]: For 9933/9933 co-relation queries the response was YES. [2025-02-08 01:14:16,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5484 conditions, 977 events. 281/977 cut-off events. For 9933/9933 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7690 event pairs, 76 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 5419. Up to 488 conditions per place. [2025-02-08 01:14:16,719 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 107 selfloop transitions, 22 changer transitions 9/139 dead transitions. [2025-02-08 01:14:16,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 139 transitions, 1942 flow [2025-02-08 01:14:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:14:16,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:14:16,720 INFO L175 Difference]: Start difference. First operand has 142 places, 92 transitions, 1237 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:14:16,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 139 transitions, 1942 flow [2025-02-08 01:14:16,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 139 transitions, 1875 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:16,742 INFO L231 Difference]: Finished difference. Result has 149 places, 98 transitions, 1405 flow [2025-02-08 01:14:16,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1405, PETRI_PLACES=149, PETRI_TRANSITIONS=98} [2025-02-08 01:14:16,742 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:14:16,742 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 98 transitions, 1405 flow [2025-02-08 01:14:16,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:16,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:16,742 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:14:16,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 01:14:16,743 INFO L396 AbstractCegarLoop]: === Iteration 35 === 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:14:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash 10306539, now seen corresponding path program 29 times [2025-02-08 01:14:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083527280] [2025-02-08 01:14:16,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:16,752 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:16,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:16,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:16,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:14:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083527280] [2025-02-08 01:14:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083527280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139226740] [2025-02-08 01:14:17,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:17,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:17,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:17,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:14:17,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:17,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:17,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:17,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:14:17,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:18,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 449 treesize of output 1245