./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:37:54,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:37:54,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:37:54,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:37:54,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:37:54,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:37:54,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:37:54,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:37:54,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:37:54,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:37:54,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:37:54,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:37:54,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:37:54,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:37:54,542 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:37:54,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:37:54,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:37:54,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:37:54,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:37:54,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:54,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:54,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:54,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:37:54,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:37:54,546 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-01-09 16:37:54,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:37:54,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:37:54,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:37:54,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:37:54,831 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:37:54,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-09 16:37:56,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22824f506/e2704a01afc949368f91ceee5fd3e1f4/FLAG58a460db4 [2025-01-09 16:37:56,339 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:37:56,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-01-09 16:37:56,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22824f506/e2704a01afc949368f91ceee5fd3e1f4/FLAG58a460db4 [2025-01-09 16:37:56,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22824f506/e2704a01afc949368f91ceee5fd3e1f4 [2025-01-09 16:37:56,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:37:56,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:37:56,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:56,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:37:56,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:37:56,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56, skipping insertion in model container [2025-01-09 16:37:56,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:37:56,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-01-09 16:37:56,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:56,819 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:37:56,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-01-09 16:37:56,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:56,854 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:37:56,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56 WrapperNode [2025-01-09 16:37:56,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:56,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:56,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:37:56,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:37:56,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,887 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-01-09 16:37:56,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:56,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:37:56,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:37:56,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:37:56,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,911 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:37:56,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:37:56,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:37:56,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:37:56,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:37:56,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:56,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:56,964 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-01-09 16:37:56,966 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-01-09 16:37:56,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:37:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:37:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:37:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:37:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:37:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:37:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:37:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:37:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:37:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:37:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:37:56,989 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:37:57,092 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:37:57,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:37:57,494 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:37:57,495 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:37:57,799 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:37:57,799 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:37:57,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:57 BoogieIcfgContainer [2025-01-09 16:37:57,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:37:57,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:37:57,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:37:57,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:37:57,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:37:56" (1/3) ... [2025-01-09 16:37:57,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:57, skipping insertion in model container [2025-01-09 16:37:57,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (2/3) ... [2025-01-09 16:37:57,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:57, skipping insertion in model container [2025-01-09 16:37:57,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:57" (3/3) ... [2025-01-09 16:37:57,810 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-01-09 16:37:57,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:37:57,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:37:57,825 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:37:57,885 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:37:57,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:37:57,957 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-01-09 16:37:57,959 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:37:57,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-09 16:37:57,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:37:57,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-01-09 16:37:57,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:37:57,989 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;@6d2cfee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:37:57,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:37:58,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:37:58,009 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-01-09 16:37:58,009 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:37:58,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,009 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-01-09 16:37:58,010 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-01-09 16:37:58,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -839590320, now seen corresponding path program 1 times [2025-01-09 16:37:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155236911] [2025-01-09 16:37:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:37:58,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:37:58,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155236911] [2025-01-09 16:37:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155236911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:37:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683958304] [2025-01-09 16:37:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:37:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:37:58,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:37:58,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:58,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:37:58,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:58,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:59,540 INFO L124 PetriNetUnfolderBase]: 2303/3290 cut-off events. [2025-01-09 16:37:59,540 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-01-09 16:37:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 3290 events. 2303/3290 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15758 event pairs, 337 based on Foata normal form. 1/2804 useless extension candidates. Maximal degree in co-relation 4076. Up to 1121 conditions per place. [2025-01-09 16:37:59,570 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 109 selfloop transitions, 17 changer transitions 2/132 dead transitions. [2025-01-09 16:37:59,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 132 transitions, 592 flow [2025-01-09 16:37:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:37:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:37:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2025-01-09 16:37:59,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4681818181818182 [2025-01-09 16:37:59,590 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 11 states and 206 transitions. [2025-01-09 16:37:59,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 132 transitions, 592 flow [2025-01-09 16:37:59,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 132 transitions, 544 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:37:59,607 INFO L231 Difference]: Finished difference. Result has 45 places, 53 transitions, 183 flow [2025-01-09 16:37:59,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=53} [2025-01-09 16:37:59,614 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-01-09 16:37:59,614 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 53 transitions, 183 flow [2025-01-09 16:37:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:37:59,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:59,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:37:59,615 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-01-09 16:37:59,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 687178746, now seen corresponding path program 2 times [2025-01-09 16:37:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-01-09 16:37:59,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:59,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:37:59,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:37:59,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:37:59,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-01-09 16:37:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506386721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:37:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133219019] [2025-01-09 16:37:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:37:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:59,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:37:59,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:37:59,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:37:59,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 53 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:37:59,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:59,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:37:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:00,625 INFO L124 PetriNetUnfolderBase]: 2505/3632 cut-off events. [2025-01-09 16:38:00,626 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-01-09 16:38:00,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 3632 events. 2505/3632 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18029 event pairs, 372 based on Foata normal form. 1/3471 useless extension candidates. Maximal degree in co-relation 5327. Up to 1093 conditions per place. [2025-01-09 16:38:00,650 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 111 selfloop transitions, 19 changer transitions 2/136 dead transitions. [2025-01-09 16:38:00,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 136 transitions, 650 flow [2025-01-09 16:38:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2025-01-09 16:38:00,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-01-09 16:38:00,653 INFO L175 Difference]: Start difference. First operand has 45 places, 53 transitions, 183 flow. Second operand 11 states and 208 transitions. [2025-01-09 16:38:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 136 transitions, 650 flow [2025-01-09 16:38:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 136 transitions, 644 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:38:00,657 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 249 flow [2025-01-09 16:38:00,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2025-01-09 16:38:00,658 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2025-01-09 16:38:00,658 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 249 flow [2025-01-09 16:38:00,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:00,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:00,658 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-01-09 16:38:00,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:38:00,659 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-01-09 16:38:00,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash 741908154, now seen corresponding path program 1 times [2025-01-09 16:38:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-01-09 16:38:00,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:00,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:00,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:00,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-01-09 16:38:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943499281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029659226] [2025-01-09 16:38:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:00,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:00,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:00,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:00,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:00,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 16:38:00,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:00,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:00,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:01,376 INFO L124 PetriNetUnfolderBase]: 3530/5297 cut-off events. [2025-01-09 16:38:01,377 INFO L125 PetriNetUnfolderBase]: For 2648/2648 co-relation queries the response was YES. [2025-01-09 16:38:01,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12256 conditions, 5297 events. 3530/5297 cut-off events. For 2648/2648 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 29488 event pairs, 1599 based on Foata normal form. 188/5210 useless extension candidates. Maximal degree in co-relation 8759. Up to 3242 conditions per place. [2025-01-09 16:38:01,404 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 88 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2025-01-09 16:38:01,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 620 flow [2025-01-09 16:38:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-01-09 16:38:01,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-01-09 16:38:01,408 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 249 flow. Second operand 5 states and 106 transitions. [2025-01-09 16:38:01,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 620 flow [2025-01-09 16:38:01,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 593 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-09 16:38:01,423 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 323 flow [2025-01-09 16:38:01,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-01-09 16:38:01,424 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2025-01-09 16:38:01,424 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 323 flow [2025-01-09 16:38:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 16:38:01,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:01,425 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-01-09 16:38:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:38:01,425 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-01-09 16:38:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 84647570, now seen corresponding path program 1 times [2025-01-09 16:38:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465637524] [2025-01-09 16:38:01,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:01,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:01,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:01,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:01,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465637524] [2025-01-09 16:38:01,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465637524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:01,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:38:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100336318] [2025-01-09 16:38:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:01,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:01,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:01,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:01,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:01,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:01,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 16:38:01,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:01,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:01,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:01,954 INFO L124 PetriNetUnfolderBase]: 2332/3587 cut-off events. [2025-01-09 16:38:01,954 INFO L125 PetriNetUnfolderBase]: For 2468/2468 co-relation queries the response was YES. [2025-01-09 16:38:01,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8531 conditions, 3587 events. 2332/3587 cut-off events. For 2468/2468 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 19690 event pairs, 977 based on Foata normal form. 172/3569 useless extension candidates. Maximal degree in co-relation 6443. Up to 1707 conditions per place. [2025-01-09 16:38:01,999 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 78 selfloop transitions, 9 changer transitions 3/94 dead transitions. [2025-01-09 16:38:01,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 561 flow [2025-01-09 16:38:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-01-09 16:38:02,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-01-09 16:38:02,000 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 323 flow. Second operand 6 states and 122 transitions. [2025-01-09 16:38:02,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 561 flow [2025-01-09 16:38:02,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 532 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:02,004 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 254 flow [2025-01-09 16:38:02,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-01-09 16:38:02,005 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-01-09 16:38:02,005 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 254 flow [2025-01-09 16:38:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 16:38:02,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:02,005 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-01-09 16:38:02,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:38:02,006 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-01-09 16:38:02,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1061264418, now seen corresponding path program 1 times [2025-01-09 16:38:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:02,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219003993] [2025-01-09 16:38:02,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:02,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:02,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:02,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:02,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219003993] [2025-01-09 16:38:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219003993] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769205766] [2025-01-09 16:38:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:02,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:02,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:02,182 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-01-09 16:38:02,183 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-01-09 16:38:02,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:38:02,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:38:02,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:02,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:02,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:38:02,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:02,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:38:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769205766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:38:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-01-09 16:38:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266795055] [2025-01-09 16:38:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:02,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:02,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:02,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:02,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:03,033 INFO L124 PetriNetUnfolderBase]: 4206/6287 cut-off events. [2025-01-09 16:38:03,033 INFO L125 PetriNetUnfolderBase]: For 3817/3817 co-relation queries the response was YES. [2025-01-09 16:38:03,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14732 conditions, 6287 events. 4206/6287 cut-off events. For 3817/3817 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 35928 event pairs, 1377 based on Foata normal form. 2/5775 useless extension candidates. Maximal degree in co-relation 12987. Up to 2455 conditions per place. [2025-01-09 16:38:03,070 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 101 selfloop transitions, 19 changer transitions 6/130 dead transitions. [2025-01-09 16:38:03,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 774 flow [2025-01-09 16:38:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:38:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:38:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-01-09 16:38:03,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-01-09 16:38:03,072 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 254 flow. Second operand 7 states and 144 transitions. [2025-01-09 16:38:03,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 774 flow [2025-01-09 16:38:03,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 746 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:03,080 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 393 flow [2025-01-09 16:38:03,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2025-01-09 16:38:03,082 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-01-09 16:38:03,082 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 393 flow [2025-01-09 16:38:03,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:03,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:03,083 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-01-09 16:38:03,091 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-01-09 16:38:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:03,283 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-01-09 16:38:03,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash -15016674, now seen corresponding path program 1 times [2025-01-09 16:38:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145184371] [2025-01-09 16:38:03,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:03,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:03,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145184371] [2025-01-09 16:38:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145184371] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87534598] [2025-01-09 16:38:03,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:03,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:03,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:03,442 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-01-09 16:38:03,444 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-01-09 16:38:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:38:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:38:03,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:03,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 16:38:03,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:03,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87534598] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:03,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-09 16:38:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510377359] [2025-01-09 16:38:03,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:38:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:03,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:38:03,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:38:03,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:03,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 393 flow. Second operand has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 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-01-09 16:38:03,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:03,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:03,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:05,944 INFO L124 PetriNetUnfolderBase]: 7177/10675 cut-off events. [2025-01-09 16:38:05,945 INFO L125 PetriNetUnfolderBase]: For 7557/7557 co-relation queries the response was YES. [2025-01-09 16:38:05,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26366 conditions, 10675 events. 7177/10675 cut-off events. For 7557/7557 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 65675 event pairs, 2917 based on Foata normal form. 8/9807 useless extension candidates. Maximal degree in co-relation 23824. Up to 2270 conditions per place. [2025-01-09 16:38:05,980 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 218 selfloop transitions, 38 changer transitions 111/371 dead transitions. [2025-01-09 16:38:05,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 371 transitions, 2164 flow [2025-01-09 16:38:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 16:38:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-09 16:38:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 573 transitions. [2025-01-09 16:38:05,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2025-01-09 16:38:05,983 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 393 flow. Second operand 33 states and 573 transitions. [2025-01-09 16:38:05,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 371 transitions, 2164 flow [2025-01-09 16:38:05,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 371 transitions, 2126 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:05,994 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 556 flow [2025-01-09 16:38:05,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=556, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-01-09 16:38:05,995 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 79 predicate places. [2025-01-09 16:38:05,995 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 556 flow [2025-01-09 16:38:05,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 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-01-09 16:38:05,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:05,996 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-01-09 16:38:06,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:06,196 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-01-09 16:38:06,196 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-01-09 16:38:06,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 927195332, now seen corresponding path program 1 times [2025-01-09 16:38:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19539580] [2025-01-09 16:38:06,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:06,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:38:06,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:38:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:38:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19539580] [2025-01-09 16:38:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19539580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669306286] [2025-01-09 16:38:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:06,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:06,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:06,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:06,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:06,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:06,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:06,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:06,884 INFO L124 PetriNetUnfolderBase]: 3842/5836 cut-off events. [2025-01-09 16:38:06,884 INFO L125 PetriNetUnfolderBase]: For 9061/9061 co-relation queries the response was YES. [2025-01-09 16:38:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 5836 events. 3842/5836 cut-off events. For 9061/9061 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33576 event pairs, 1954 based on Foata normal form. 130/5926 useless extension candidates. Maximal degree in co-relation 16608. Up to 4154 conditions per place. [2025-01-09 16:38:06,914 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 65 selfloop transitions, 4 changer transitions 46/119 dead transitions. [2025-01-09 16:38:06,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 931 flow [2025-01-09 16:38:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-01-09 16:38:06,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-01-09 16:38:06,916 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 556 flow. Second operand 6 states and 115 transitions. [2025-01-09 16:38:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 931 flow [2025-01-09 16:38:06,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 844 flow, removed 37 selfloop flow, removed 13 redundant places. [2025-01-09 16:38:06,937 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 414 flow [2025-01-09 16:38:06,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-01-09 16:38:06,938 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 52 predicate places. [2025-01-09 16:38:06,938 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 414 flow [2025-01-09 16:38:06,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:06,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:06,939 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-01-09 16:38:06,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:38:06,940 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-01-09 16:38:06,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 170559796, now seen corresponding path program 1 times [2025-01-09 16:38:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568756394] [2025-01-09 16:38:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:06,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568756394] [2025-01-09 16:38:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568756394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488748842] [2025-01-09 16:38:07,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:07,121 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-01-09 16:38:07,123 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-01-09 16:38:07,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:07,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 16:38:07,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:07,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488748842] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:07,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:07,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 16:38:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467405012] [2025-01-09 16:38:07,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:07,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:38:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:07,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:38:07,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:38:07,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:07,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 414 flow. Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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-01-09 16:38:07,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:07,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:07,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:08,577 INFO L124 PetriNetUnfolderBase]: 6131/9379 cut-off events. [2025-01-09 16:38:08,578 INFO L125 PetriNetUnfolderBase]: For 13914/13914 co-relation queries the response was YES. [2025-01-09 16:38:08,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26071 conditions, 9379 events. 6131/9379 cut-off events. For 13914/13914 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 58857 event pairs, 1429 based on Foata normal form. 2/9375 useless extension candidates. Maximal degree in co-relation 25973. Up to 3228 conditions per place. [2025-01-09 16:38:08,626 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 187 selfloop transitions, 24 changer transitions 3/218 dead transitions. [2025-01-09 16:38:08,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 218 transitions, 1542 flow [2025-01-09 16:38:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:38:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:38:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions. [2025-01-09 16:38:08,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2025-01-09 16:38:08,628 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 414 flow. Second operand 12 states and 218 transitions. [2025-01-09 16:38:08,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 218 transitions, 1542 flow [2025-01-09 16:38:08,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 218 transitions, 1478 flow, removed 15 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:08,680 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 584 flow [2025-01-09 16:38:08,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=584, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2025-01-09 16:38:08,681 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2025-01-09 16:38:08,681 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 584 flow [2025-01-09 16:38:08,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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-01-09 16:38:08,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:08,682 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:08,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:38:08,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:08,883 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-01-09 16:38:08,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 362220314, now seen corresponding path program 1 times [2025-01-09 16:38:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:08,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-01-09 16:38:08,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:38:08,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:38:08,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:08,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:38:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-01-09 16:38:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338344809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:08,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274927039] [2025-01-09 16:38:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:08,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:08,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:09,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:09,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:09,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:09,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:09,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:09,538 INFO L124 PetriNetUnfolderBase]: 5073/7722 cut-off events. [2025-01-09 16:38:09,538 INFO L125 PetriNetUnfolderBase]: For 11346/11346 co-relation queries the response was YES. [2025-01-09 16:38:09,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22135 conditions, 7722 events. 5073/7722 cut-off events. For 11346/11346 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 45965 event pairs, 2756 based on Foata normal form. 156/7843 useless extension candidates. Maximal degree in co-relation 18863. Up to 5483 conditions per place. [2025-01-09 16:38:09,573 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 52 selfloop transitions, 8 changer transitions 49/113 dead transitions. [2025-01-09 16:38:09,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 886 flow [2025-01-09 16:38:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:38:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:38:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-01-09 16:38:09,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-01-09 16:38:09,575 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 584 flow. Second operand 5 states and 98 transitions. [2025-01-09 16:38:09,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 886 flow [2025-01-09 16:38:09,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 850 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:09,662 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 373 flow [2025-01-09 16:38:09,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2025-01-09 16:38:09,662 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 53 predicate places. [2025-01-09 16:38:09,663 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 373 flow [2025-01-09 16:38:09,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:09,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:09,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:38:09,663 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-01-09 16:38:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1000908152, now seen corresponding path program 1 times [2025-01-09 16:38:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355205325] [2025-01-09 16:38:09,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:09,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:09,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:09,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355205325] [2025-01-09 16:38:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355205325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:09,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971707233] [2025-01-09 16:38:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:09,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:09,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:09,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:09,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:09,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:09,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:09,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:10,436 INFO L124 PetriNetUnfolderBase]: 6824/9962 cut-off events. [2025-01-09 16:38:10,436 INFO L125 PetriNetUnfolderBase]: For 9362/9362 co-relation queries the response was YES. [2025-01-09 16:38:10,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26437 conditions, 9962 events. 6824/9962 cut-off events. For 9362/9362 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 58738 event pairs, 994 based on Foata normal form. 1/9959 useless extension candidates. Maximal degree in co-relation 26347. Up to 3638 conditions per place. [2025-01-09 16:38:10,487 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 23 changer transitions 1/135 dead transitions. [2025-01-09 16:38:10,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 135 transitions, 933 flow [2025-01-09 16:38:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-01-09 16:38:10,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-01-09 16:38:10,489 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 373 flow. Second operand 6 states and 137 transitions. [2025-01-09 16:38:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 135 transitions, 933 flow [2025-01-09 16:38:10,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 135 transitions, 845 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-01-09 16:38:10,545 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 511 flow [2025-01-09 16:38:10,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2025-01-09 16:38:10,546 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2025-01-09 16:38:10,546 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 511 flow [2025-01-09 16:38:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:10,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:10,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:38:10,547 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-01-09 16:38:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 649665260, now seen corresponding path program 2 times [2025-01-09 16:38:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-01-09 16:38:10,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:10,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:10,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-01-09 16:38:10,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:10,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-01-09 16:38:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819565918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88372729] [2025-01-09 16:38:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:10,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:10,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 511 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:10,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:10,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:10,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:11,513 INFO L124 PetriNetUnfolderBase]: 9324/13524 cut-off events. [2025-01-09 16:38:11,514 INFO L125 PetriNetUnfolderBase]: For 14849/14849 co-relation queries the response was YES. [2025-01-09 16:38:11,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36821 conditions, 13524 events. 9324/13524 cut-off events. For 14849/14849 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 83790 event pairs, 1228 based on Foata normal form. 1/13521 useless extension candidates. Maximal degree in co-relation 26188. Up to 5532 conditions per place. [2025-01-09 16:38:11,562 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 109 selfloop transitions, 32 changer transitions 1/146 dead transitions. [2025-01-09 16:38:11,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 1054 flow [2025-01-09 16:38:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-01-09 16:38:11,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-01-09 16:38:11,564 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 511 flow. Second operand 6 states and 139 transitions. [2025-01-09 16:38:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 1054 flow [2025-01-09 16:38:11,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 1020 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:11,642 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 699 flow [2025-01-09 16:38:11,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2025-01-09 16:38:11,643 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-01-09 16:38:11,643 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 699 flow [2025-01-09 16:38:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:11,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:11,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:11,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:38:11,643 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-01-09 16:38:11,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 853385534, now seen corresponding path program 3 times [2025-01-09 16:38:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533173264] [2025-01-09 16:38:11,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:11,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:11,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-01-09 16:38:11,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:11,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:11,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:11,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533173264] [2025-01-09 16:38:11,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533173264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:11,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:11,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705803762] [2025-01-09 16:38:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:11,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:11,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:11,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:11,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:11,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 699 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:11,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:11,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:12,819 INFO L124 PetriNetUnfolderBase]: 9710/14106 cut-off events. [2025-01-09 16:38:12,819 INFO L125 PetriNetUnfolderBase]: For 25729/25729 co-relation queries the response was YES. [2025-01-09 16:38:12,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41645 conditions, 14106 events. 9710/14106 cut-off events. For 25729/25729 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 87161 event pairs, 1484 based on Foata normal form. 1/14107 useless extension candidates. Maximal degree in co-relation 34338. Up to 5899 conditions per place. [2025-01-09 16:38:12,880 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 116 selfloop transitions, 34 changer transitions 1/155 dead transitions. [2025-01-09 16:38:12,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 155 transitions, 1274 flow [2025-01-09 16:38:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-01-09 16:38:12,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-01-09 16:38:12,881 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 699 flow. Second operand 6 states and 137 transitions. [2025-01-09 16:38:12,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 155 transitions, 1274 flow [2025-01-09 16:38:12,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 155 transitions, 1232 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-09 16:38:12,926 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 909 flow [2025-01-09 16:38:12,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=909, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2025-01-09 16:38:12,927 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2025-01-09 16:38:12,927 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 909 flow [2025-01-09 16:38:12,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:12,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:12,927 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:12,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:38:12,928 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-01-09 16:38:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1592477602, now seen corresponding path program 4 times [2025-01-09 16:38:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:12,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-01-09 16:38:12,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:12,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:12,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 29 statements. [2025-01-09 16:38:12,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:12,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-01-09 16:38:12,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189421260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:12,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:12,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802203745] [2025-01-09 16:38:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:12,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:12,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:12,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:12,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 909 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:12,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:13,990 INFO L124 PetriNetUnfolderBase]: 10686/15840 cut-off events. [2025-01-09 16:38:13,990 INFO L125 PetriNetUnfolderBase]: For 42817/42817 co-relation queries the response was YES. [2025-01-09 16:38:14,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49328 conditions, 15840 events. 10686/15840 cut-off events. For 42817/42817 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 102386 event pairs, 1636 based on Foata normal form. 1/15833 useless extension candidates. Maximal degree in co-relation 38779. Up to 6184 conditions per place. [2025-01-09 16:38:14,080 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 136 selfloop transitions, 33 changer transitions 1/174 dead transitions. [2025-01-09 16:38:14,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 174 transitions, 1692 flow [2025-01-09 16:38:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-01-09 16:38:14,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-01-09 16:38:14,081 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 909 flow. Second operand 6 states and 133 transitions. [2025-01-09 16:38:14,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 174 transitions, 1692 flow [2025-01-09 16:38:14,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 174 transitions, 1620 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-01-09 16:38:14,171 INFO L231 Difference]: Finished difference. Result has 93 places, 122 transitions, 1211 flow [2025-01-09 16:38:14,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1211, PETRI_PLACES=93, PETRI_TRANSITIONS=122} [2025-01-09 16:38:14,172 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2025-01-09 16:38:14,172 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 122 transitions, 1211 flow [2025-01-09 16:38:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:14,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:14,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:14,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:38:14,173 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-01-09 16:38:14,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1775837010, now seen corresponding path program 5 times [2025-01-09 16:38:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:14,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190983680] [2025-01-09 16:38:14,173 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:14,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:14,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:14,199 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:14,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:14,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190983680] [2025-01-09 16:38:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190983680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807010123] [2025-01-09 16:38:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:14,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:14,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:14,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:14,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 122 transitions, 1211 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:14,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:14,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:14,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:15,538 INFO L124 PetriNetUnfolderBase]: 12278/18180 cut-off events. [2025-01-09 16:38:15,539 INFO L125 PetriNetUnfolderBase]: For 58323/58323 co-relation queries the response was YES. [2025-01-09 16:38:15,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59266 conditions, 18180 events. 12278/18180 cut-off events. For 58323/58323 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 121420 event pairs, 1704 based on Foata normal form. 1/18169 useless extension candidates. Maximal degree in co-relation 48223. Up to 7783 conditions per place. [2025-01-09 16:38:15,616 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 131 selfloop transitions, 45 changer transitions 1/181 dead transitions. [2025-01-09 16:38:15,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 181 transitions, 1861 flow [2025-01-09 16:38:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-01-09 16:38:15,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-09 16:38:15,617 INFO L175 Difference]: Start difference. First operand has 93 places, 122 transitions, 1211 flow. Second operand 6 states and 135 transitions. [2025-01-09 16:38:15,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 181 transitions, 1861 flow [2025-01-09 16:38:15,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 181 transitions, 1803 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:15,812 INFO L231 Difference]: Finished difference. Result has 100 places, 133 transitions, 1463 flow [2025-01-09 16:38:15,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1463, PETRI_PLACES=100, PETRI_TRANSITIONS=133} [2025-01-09 16:38:15,812 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2025-01-09 16:38:15,812 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 133 transitions, 1463 flow [2025-01-09 16:38:15,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:15,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:15,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:38:15,813 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-01-09 16:38:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2044147062, now seen corresponding path program 6 times [2025-01-09 16:38:15,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:15,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-01-09 16:38:15,813 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:38:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:15,822 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:15,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-01-09 16:38:15,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:38:15,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:38:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498650622] [2025-01-09 16:38:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498650622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:38:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571900535] [2025-01-09 16:38:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:38:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:15,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:38:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:38:15,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:15,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 133 transitions, 1463 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:15,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:15,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:15,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:17,524 INFO L124 PetriNetUnfolderBase]: 12278/18086 cut-off events. [2025-01-09 16:38:17,524 INFO L125 PetriNetUnfolderBase]: For 73498/73498 co-relation queries the response was YES. [2025-01-09 16:38:17,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62135 conditions, 18086 events. 12278/18086 cut-off events. For 73498/73498 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 117812 event pairs, 1848 based on Foata normal form. 1/18075 useless extension candidates. Maximal degree in co-relation 55506. Up to 7078 conditions per place. [2025-01-09 16:38:17,638 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 140 selfloop transitions, 42 changer transitions 1/187 dead transitions. [2025-01-09 16:38:17,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 187 transitions, 2094 flow [2025-01-09 16:38:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:38:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:38:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-01-09 16:38:17,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-01-09 16:38:17,640 INFO L175 Difference]: Start difference. First operand has 100 places, 133 transitions, 1463 flow. Second operand 6 states and 133 transitions. [2025-01-09 16:38:17,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 187 transitions, 2094 flow [2025-01-09 16:38:17,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 187 transitions, 2028 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:17,876 INFO L231 Difference]: Finished difference. Result has 105 places, 143 transitions, 1694 flow [2025-01-09 16:38:17,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1694, PETRI_PLACES=105, PETRI_TRANSITIONS=143} [2025-01-09 16:38:17,876 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2025-01-09 16:38:17,876 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 143 transitions, 1694 flow [2025-01-09 16:38:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-01-09 16:38:17,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:17,877 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:38:17,877 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-01-09 16:38:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1584085288, now seen corresponding path program 1 times [2025-01-09 16:38:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-01-09 16:38:17,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:17,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:17,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:17,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:17,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-01-09 16:38:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717594152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446253103] [2025-01-09 16:38:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:18,078 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-01-09 16:38:18,080 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-01-09 16:38:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:18,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:18,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:18,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:18,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:38:18,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:18,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:38:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446253103] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:18,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-09 16:38:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042037699] [2025-01-09 16:38:18,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:18,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:38:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:18,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:38:18,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:38:18,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:38:18,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 143 transitions, 1694 flow. Second operand has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 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-01-09 16:38:18,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:18,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:38:18,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:20,689 INFO L124 PetriNetUnfolderBase]: 18411/27037 cut-off events. [2025-01-09 16:38:20,690 INFO L125 PetriNetUnfolderBase]: For 137528/137528 co-relation queries the response was YES. [2025-01-09 16:38:20,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96828 conditions, 27037 events. 18411/27037 cut-off events. For 137528/137528 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 187616 event pairs, 8688 based on Foata normal form. 8/27030 useless extension candidates. Maximal degree in co-relation 87143. Up to 8507 conditions per place. [2025-01-09 16:38:20,940 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 292 selfloop transitions, 30 changer transitions 2/328 dead transitions. [2025-01-09 16:38:20,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 328 transitions, 4550 flow [2025-01-09 16:38:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:38:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:38:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2025-01-09 16:38:20,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445 [2025-01-09 16:38:20,941 INFO L175 Difference]: Start difference. First operand has 105 places, 143 transitions, 1694 flow. Second operand 10 states and 178 transitions. [2025-01-09 16:38:20,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 328 transitions, 4550 flow [2025-01-09 16:38:21,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 328 transitions, 4419 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-01-09 16:38:21,660 INFO L231 Difference]: Finished difference. Result has 115 places, 162 transitions, 2017 flow [2025-01-09 16:38:21,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2017, PETRI_PLACES=115, PETRI_TRANSITIONS=162} [2025-01-09 16:38:21,661 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2025-01-09 16:38:21,661 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 2017 flow [2025-01-09 16:38:21,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 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-01-09 16:38:21,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:21,661 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:21,669 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-01-09 16:38:21,862 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,SelfDestructingSolverStorable15 [2025-01-09 16:38:21,862 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-01-09 16:38:21,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1291779760, now seen corresponding path program 2 times [2025-01-09 16:38:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142526083] [2025-01-09 16:38:21,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:21,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:21,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-01-09 16:38:21,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:21,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:38:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142526083] [2025-01-09 16:38:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142526083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:38:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761418105] [2025-01-09 16:38:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:22,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:22,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:22,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:22,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 2017 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-01-09 16:38:22,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:22,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:22,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:29,671 INFO L124 PetriNetUnfolderBase]: 59241/85170 cut-off events. [2025-01-09 16:38:29,671 INFO L125 PetriNetUnfolderBase]: For 397054/397054 co-relation queries the response was YES. [2025-01-09 16:38:30,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291756 conditions, 85170 events. 59241/85170 cut-off events. For 397054/397054 co-relation queries the response was YES. Maximal size of possible extension queue 4724. Compared 647859 event pairs, 4044 based on Foata normal form. 4/81006 useless extension candidates. Maximal degree in co-relation 271875. Up to 30989 conditions per place. [2025-01-09 16:38:30,307 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 461 selfloop transitions, 89 changer transitions 4/557 dead transitions. [2025-01-09 16:38:30,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 557 transitions, 7702 flow [2025-01-09 16:38:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 253 transitions. [2025-01-09 16:38:30,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-01-09 16:38:30,308 INFO L175 Difference]: Start difference. First operand has 115 places, 162 transitions, 2017 flow. Second operand 11 states and 253 transitions. [2025-01-09 16:38:30,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 557 transitions, 7702 flow [2025-01-09 16:38:31,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 557 transitions, 7677 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:31,595 INFO L231 Difference]: Finished difference. Result has 129 places, 231 transitions, 3556 flow [2025-01-09 16:38:31,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3556, PETRI_PLACES=129, PETRI_TRANSITIONS=231} [2025-01-09 16:38:31,596 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 92 predicate places. [2025-01-09 16:38:31,596 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 231 transitions, 3556 flow [2025-01-09 16:38:31,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-01-09 16:38:31,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:31,596 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:31,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:38:31,596 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-01-09 16:38:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -342980414, now seen corresponding path program 3 times [2025-01-09 16:38:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-01-09 16:38:31,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:31,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:31,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-01-09 16:38:31,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:31,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:38:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-01-09 16:38:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709554628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:31,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:38:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645001119] [2025-01-09 16:38:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:31,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:31,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:31,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:38:31,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:31,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 231 transitions, 3556 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:31,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:31,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:45,075 INFO L124 PetriNetUnfolderBase]: 91602/130351 cut-off events. [2025-01-09 16:38:45,075 INFO L125 PetriNetUnfolderBase]: For 798278/798602 co-relation queries the response was YES. [2025-01-09 16:38:46,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507706 conditions, 130351 events. 91602/130351 cut-off events. For 798278/798602 co-relation queries the response was YES. Maximal size of possible extension queue 6978. Compared 1018313 event pairs, 8646 based on Foata normal form. 350/123546 useless extension candidates. Maximal degree in co-relation 483041. Up to 54839 conditions per place. [2025-01-09 16:38:46,799 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 433 selfloop transitions, 91 changer transitions 88/617 dead transitions. [2025-01-09 16:38:46,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 617 transitions, 10147 flow [2025-01-09 16:38:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:38:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:38:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2025-01-09 16:38:46,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-01-09 16:38:46,800 INFO L175 Difference]: Start difference. First operand has 129 places, 231 transitions, 3556 flow. Second operand 9 states and 208 transitions. [2025-01-09 16:38:46,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 617 transitions, 10147 flow [2025-01-09 16:38:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 617 transitions, 10083 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:51,829 INFO L231 Difference]: Finished difference. Result has 140 places, 293 transitions, 4975 flow [2025-01-09 16:38:51,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3516, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4975, PETRI_PLACES=140, PETRI_TRANSITIONS=293} [2025-01-09 16:38:51,830 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 103 predicate places. [2025-01-09 16:38:51,830 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 293 transitions, 4975 flow [2025-01-09 16:38:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:51,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:51,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:51,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:38:51,830 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-01-09 16:38:51,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1621188670, now seen corresponding path program 4 times [2025-01-09 16:38:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:51,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-01-09 16:38:51,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:51,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:51,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 29 statements. [2025-01-09 16:38:51,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:51,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:38:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332200271] [2025-01-09 16:38:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332200271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:38:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261457353] [2025-01-09 16:38:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:38:51,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-01-09 16:38:51,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 293 transitions, 4975 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:51,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:51,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-01-09 16:38:51,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand