./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/popl20-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:37:57,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:37:57,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:37:57,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:37:57,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:37:57,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:37:57,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:37:57,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:37:57,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:37:57,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:37:57,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:37:57,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:37:57,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:37:57,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:37:57,616 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:37:57,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:37:57,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:37:57,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:37:57,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:37:57,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:37:57,618 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-06 04:37:57,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:37:57,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:37:57,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:37:57,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:37:57,843 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:37:57,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 04:37:58,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2417e7c03/4a5486608246414f91ad48807229e566/FLAG54287019e [2025-02-06 04:37:59,280 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:37:59,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 04:37:59,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2417e7c03/4a5486608246414f91ad48807229e566/FLAG54287019e [2025-02-06 04:37:59,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2417e7c03/4a5486608246414f91ad48807229e566 [2025-02-06 04:37:59,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:37:59,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:37:59,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:37:59,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:37:59,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:37:59,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59, skipping insertion in model container [2025-02-06 04:37:59,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:37:59,706 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/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-02-06 04:37:59,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:37:59,720 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:37:59,739 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/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-02-06 04:37:59,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:37:59,755 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:37:59,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59 WrapperNode [2025-02-06 04:37:59,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:37:59,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:37:59,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:37:59,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:37:59,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,795 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-02-06 04:37:59,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:37:59,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:37:59,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:37:59,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:37:59,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,833 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 04:37:59,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:37:59,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:37:59,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:37:59,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:37:59,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (1/1) ... [2025-02-06 04:37:59,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:37:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:59,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:37:59,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:37:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:37:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:37:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:37:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:37:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:37:59,910 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:37:59,988 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:37:59,990 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:38:00,393 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:38:00,393 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:38:00,662 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:38:00,662 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:38:00,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:38:00 BoogieIcfgContainer [2025-02-06 04:38:00,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:38:00,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:38:00,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:38:00,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:38:00,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:37:59" (1/3) ... [2025-02-06 04:38:00,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e63f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:38:00, skipping insertion in model container [2025-02-06 04:38:00,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:59" (2/3) ... [2025-02-06 04:38:00,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e63f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:38:00, skipping insertion in model container [2025-02-06 04:38:00,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:38:00" (3/3) ... [2025-02-06 04:38:00,672 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-06 04:38:00,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:38:00,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-06 04:38:00,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:38:00,737 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:38:00,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-02-06 04:38:00,795 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-06 04:38:00,798 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:38:00,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-02-06 04:38:00,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-02-06 04:38:00,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-02-06 04:38:00,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:38:00,827 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;@487f0340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:38:00,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:38:00,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:38:00,845 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-02-06 04:38:00,846 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:38:00,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:00,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:00,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -451484021, now seen corresponding path program 1 times [2025-02-06 04:38:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131594846] [2025-02-06 04:38:00,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:00,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:38:00,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:38:00,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:00,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:01,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131594846] [2025-02-06 04:38:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131594846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:38:01,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:38:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:38:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717213671] [2025-02-06 04:38:01,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:38:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:01,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:38:01,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:38:01,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:01,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:01,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:01,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:01,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:01,516 INFO L124 PetriNetUnfolderBase]: 389/571 cut-off events. [2025-02-06 04:38:01,517 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-06 04:38:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 571 events. 389/571 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1778 event pairs, 124 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-02-06 04:38:01,527 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 38 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-02-06 04:38:01,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 207 flow [2025-02-06 04:38:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:38:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:38:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-06 04:38:01,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-02-06 04:38:01,540 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 56 transitions. [2025-02-06 04:38:01,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 207 flow [2025-02-06 04:38:01,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 185 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:38:01,549 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 86 flow [2025-02-06 04:38:01,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2025-02-06 04:38:01,554 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-02-06 04:38:01,554 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 86 flow [2025-02-06 04:38:01,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:01,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:01,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:01,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:38:01,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:01,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -252659196, now seen corresponding path program 1 times [2025-02-06 04:38:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-02-06 04:38:01,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:01,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:38:01,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:38:01,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403111456] [2025-02-06 04:38:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403111456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:38:01,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:38:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:38:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927379] [2025-02-06 04:38:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:38:01,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:01,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:01,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:01,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:01,998 INFO L124 PetriNetUnfolderBase]: 729/1093 cut-off events. [2025-02-06 04:38:01,998 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-02-06 04:38:02,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1093 events. 729/1093 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3834 event pairs, 417 based on Foata normal form. 42/1125 useless extension candidates. Maximal degree in co-relation 926. Up to 571 conditions per place. [2025-02-06 04:38:02,004 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-02-06 04:38:02,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 75 transitions, 354 flow [2025-02-06 04:38:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:38:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:38:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-06 04:38:02,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2025-02-06 04:38:02,006 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 86 flow. Second operand 6 states and 92 transitions. [2025-02-06 04:38:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 75 transitions, 354 flow [2025-02-06 04:38:02,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 75 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:38:02,010 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 186 flow [2025-02-06 04:38:02,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2025-02-06 04:38:02,011 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-02-06 04:38:02,011 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 186 flow [2025-02-06 04:38:02,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:02,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:38:02,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -798696930, now seen corresponding path program 1 times [2025-02-06 04:38:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062076935] [2025-02-06 04:38:02,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:02,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:38:02,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:38:02,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062076935] [2025-02-06 04:38:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062076935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:38:02,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:38:02,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:38:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875192268] [2025-02-06 04:38:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:02,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:02,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:38:02,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:02,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:02,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:02,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:02,359 INFO L124 PetriNetUnfolderBase]: 644/985 cut-off events. [2025-02-06 04:38:02,359 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-02-06 04:38:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 985 events. 644/985 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3506 event pairs, 391 based on Foata normal form. 42/1024 useless extension candidates. Maximal degree in co-relation 1439. Up to 571 conditions per place. [2025-02-06 04:38:02,364 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 57 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2025-02-06 04:38:02,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 428 flow [2025-02-06 04:38:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:38:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:38:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-06 04:38:02,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2025-02-06 04:38:02,366 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 186 flow. Second operand 6 states and 92 transitions. [2025-02-06 04:38:02,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 428 flow [2025-02-06 04:38:02,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 73 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:38:02,369 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 237 flow [2025-02-06 04:38:02,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2025-02-06 04:38:02,370 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-02-06 04:38:02,370 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 237 flow [2025-02-06 04:38:02,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:02,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:38:02,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1540390377, now seen corresponding path program 1 times [2025-02-06 04:38:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-02-06 04:38:02,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:02,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:38:02,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:38:02,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:02,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-02-06 04:38:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766907485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:38:02,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:38:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:38:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836871749] [2025-02-06 04:38:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:02,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:02,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:38:02,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:02,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:02,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:02,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:02,644 INFO L124 PetriNetUnfolderBase]: 519/800 cut-off events. [2025-02-06 04:38:02,644 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-02-06 04:38:02,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 800 events. 519/800 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2720 event pairs, 324 based on Foata normal form. 27/824 useless extension candidates. Maximal degree in co-relation 1589. Up to 571 conditions per place. [2025-02-06 04:38:02,648 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 26 selfloop transitions, 6 changer transitions 34/67 dead transitions. [2025-02-06 04:38:02,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 449 flow [2025-02-06 04:38:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:38:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:38:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-02-06 04:38:02,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-02-06 04:38:02,649 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 237 flow. Second operand 6 states and 88 transitions. [2025-02-06 04:38:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 449 flow [2025-02-06 04:38:02,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:38:02,654 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 154 flow [2025-02-06 04:38:02,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-02-06 04:38:02,654 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-02-06 04:38:02,654 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 154 flow [2025-02-06 04:38:02,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:02,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:38:02,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1490746438, now seen corresponding path program 1 times [2025-02-06 04:38:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-02-06 04:38:02,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:02,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:38:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:38:02,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:02,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-02-06 04:38:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510398535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763365240] [2025-02-06 04:38:02,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:02,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:02,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:38:02,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:38:02,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:38:02,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:02,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:02,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:38:02,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:02,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763365240] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:02,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:38:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-06 04:38:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100622721] [2025-02-06 04:38:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:02,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:02,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:02,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:38:02,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:02,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:02,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:02,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:02,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:03,081 INFO L124 PetriNetUnfolderBase]: 377/554 cut-off events. [2025-02-06 04:38:03,082 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-02-06 04:38:03,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 554 events. 377/554 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1679 event pairs, 150 based on Foata normal form. 50/603 useless extension candidates. Maximal degree in co-relation 1665. Up to 385 conditions per place. [2025-02-06 04:38:03,084 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-02-06 04:38:03,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 298 flow [2025-02-06 04:38:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:38:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:38:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-02-06 04:38:03,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2025-02-06 04:38:03,085 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 154 flow. Second operand 5 states and 59 transitions. [2025-02-06 04:38:03,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 298 flow [2025-02-06 04:38:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 234 flow, removed 23 selfloop flow, removed 10 redundant places. [2025-02-06 04:38:03,088 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 127 flow [2025-02-06 04:38:03,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2025-02-06 04:38:03,089 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-02-06 04:38:03,089 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 127 flow [2025-02-06 04:38:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:03,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:03,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:03,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:38:03,294 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-02-06 04:38:03,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2011831693, now seen corresponding path program 1 times [2025-02-06 04:38:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523217052] [2025-02-06 04:38:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:38:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:38:03,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:03,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:03,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523217052] [2025-02-06 04:38:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523217052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464739465] [2025-02-06 04:38:03,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:03,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:03,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:03,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:38:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:38:03,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:38:03,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:03,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:03,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:38:03,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:03,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464739465] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:03,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:38:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-06 04:38:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601647517] [2025-02-06 04:38:03,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:03,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:03,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:38:03,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:03,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:03,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:03,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:03,654 INFO L124 PetriNetUnfolderBase]: 383/560 cut-off events. [2025-02-06 04:38:03,655 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2025-02-06 04:38:03,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 560 events. 383/560 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1700 event pairs, 164 based on Foata normal form. 42/599 useless extension candidates. Maximal degree in co-relation 1518. Up to 418 conditions per place. [2025-02-06 04:38:03,658 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-02-06 04:38:03,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 280 flow [2025-02-06 04:38:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:38:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:38:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-02-06 04:38:03,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-02-06 04:38:03,660 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 127 flow. Second operand 5 states and 60 transitions. [2025-02-06 04:38:03,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 280 flow [2025-02-06 04:38:03,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 262 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-06 04:38:03,661 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 137 flow [2025-02-06 04:38:03,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-02-06 04:38:03,662 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-02-06 04:38:03,662 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 137 flow [2025-02-06 04:38:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:03,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:03,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:03,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:38:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:03,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 185897760, now seen corresponding path program 1 times [2025-02-06 04:38:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122391951] [2025-02-06 04:38:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:38:03,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:38:03,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:38:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122391951] [2025-02-06 04:38:03,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122391951] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111920634] [2025-02-06 04:38:03,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:03,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:03,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:38:04,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:38:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:38:04,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:04,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:04,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:38:04,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:38:04,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:38:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111920634] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:38:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-06 04:38:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517411611] [2025-02-06 04:38:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:38:04,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:38:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:04,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:38:04,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:38:04,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:04,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:04,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:04,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:04,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:04,278 INFO L124 PetriNetUnfolderBase]: 432/630 cut-off events. [2025-02-06 04:38:04,278 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2025-02-06 04:38:04,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 630 events. 432/630 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1838 event pairs, 202 based on Foata normal form. 37/664 useless extension candidates. Maximal degree in co-relation 1848. Up to 502 conditions per place. [2025-02-06 04:38:04,281 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-02-06 04:38:04,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 296 flow [2025-02-06 04:38:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:38:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:38:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-02-06 04:38:04,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2025-02-06 04:38:04,282 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 137 flow. Second operand 5 states and 58 transitions. [2025-02-06 04:38:04,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 296 flow [2025-02-06 04:38:04,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 278 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 04:38:04,284 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 147 flow [2025-02-06 04:38:04,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-02-06 04:38:04,285 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-02-06 04:38:04,285 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 147 flow [2025-02-06 04:38:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:04,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:04,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:04,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:38:04,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:04,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:04,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1161298415, now seen corresponding path program 1 times [2025-02-06 04:38:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:04,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-02-06 04:38:04,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:38:04,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:04,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:04,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:38:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-02-06 04:38:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014518153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567718041] [2025-02-06 04:38:05,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:38:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:05,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:38:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:38:05,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:38:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:05,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 04:38:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:05,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 04:38:05,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:38:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 04:38:05,895 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-02-06 04:38:05,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-02-06 04:38:05,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 04:38:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:05,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:10,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse2 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse0 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse2 ~B~0.offset))) (.cse1 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse2)))) (= (+ .cse0 c_~csum~0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse2 ~C~0.offset) (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset))))))) is different from false [2025-02-06 04:38:14,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~asum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset)) c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) is different from false [2025-02-06 04:38:14,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:14,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-02-06 04:38:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-02-06 04:38:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567718041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:38:15,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:38:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2025-02-06 04:38:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764418789] [2025-02-06 04:38:15,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:38:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 04:38:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:15,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 04:38:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=656, Unknown=2, NotChecked=106, Total=870 [2025-02-06 04:38:15,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:15,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 147 flow. Second operand has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:15,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:15,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:15,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:19,231 INFO L124 PetriNetUnfolderBase]: 618/900 cut-off events. [2025-02-06 04:38:19,231 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-02-06 04:38:19,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 900 events. 618/900 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3030 event pairs, 27 based on Foata normal form. 1/898 useless extension candidates. Maximal degree in co-relation 2809. Up to 659 conditions per place. [2025-02-06 04:38:19,236 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 65 selfloop transitions, 30 changer transitions 1/97 dead transitions. [2025-02-06 04:38:19,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 573 flow [2025-02-06 04:38:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:38:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:38:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-02-06 04:38:19,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36228287841191065 [2025-02-06 04:38:19,238 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 147 flow. Second operand 13 states and 146 transitions. [2025-02-06 04:38:19,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 97 transitions, 573 flow [2025-02-06 04:38:19,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 546 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 04:38:19,241 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 328 flow [2025-02-06 04:38:19,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=328, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2025-02-06 04:38:19,241 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2025-02-06 04:38:19,242 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 328 flow [2025-02-06 04:38:19,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:19,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:19,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:19,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:38:19,447 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,SelfDestructingSolverStorable7 [2025-02-06 04:38:19,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:19,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -900279171, now seen corresponding path program 2 times [2025-02-06 04:38:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132919648] [2025-02-06 04:38:19,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:38:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:19,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:19,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:19,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:38:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:21,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132919648] [2025-02-06 04:38:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132919648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:21,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029400829] [2025-02-06 04:38:21,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:38:21,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:21,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:21,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:21,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:38:21,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:21,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:21,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:38:21,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:21,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:38:21,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:22,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:22,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 04:38:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:22,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:23,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:23,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-02-06 04:38:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029400829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:38:23,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:38:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 26 [2025-02-06 04:38:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692563806] [2025-02-06 04:38:23,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:38:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:38:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:38:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:38:23,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:23,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 328 flow. Second operand has 27 states, 27 states have (on average 6.592592592592593) internal successors, (178), 27 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:23,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:23,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:23,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:27,196 INFO L124 PetriNetUnfolderBase]: 720/1047 cut-off events. [2025-02-06 04:38:27,196 INFO L125 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2025-02-06 04:38:27,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1047 events. 720/1047 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3597 event pairs, 117 based on Foata normal form. 1/1048 useless extension candidates. Maximal degree in co-relation 3874. Up to 894 conditions per place. [2025-02-06 04:38:27,204 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 69 selfloop transitions, 35 changer transitions 1/106 dead transitions. [2025-02-06 04:38:27,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 106 transitions, 782 flow [2025-02-06 04:38:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:38:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:38:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-02-06 04:38:27,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3032258064516129 [2025-02-06 04:38:27,207 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 328 flow. Second operand 15 states and 141 transitions. [2025-02-06 04:38:27,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 106 transitions, 782 flow [2025-02-06 04:38:27,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 721 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-02-06 04:38:27,210 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 550 flow [2025-02-06 04:38:27,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=550, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2025-02-06 04:38:27,211 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2025-02-06 04:38:27,211 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 550 flow [2025-02-06 04:38:27,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.592592592592593) internal successors, (178), 27 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:27,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:27,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:27,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:38:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:27,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1496295479, now seen corresponding path program 3 times [2025-02-06 04:38:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-02-06 04:38:27,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:38:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:27,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:27,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:27,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:38:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:38:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-02-06 04:38:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687802690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999483817] [2025-02-06 04:38:28,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:38:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:28,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:28,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:28,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:38:28,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:28,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:28,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:38:28,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:28,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:38:28,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:29,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:29,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 04:38:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:29,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:38:30,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:30,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-02-06 04:38:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999483817] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:38:31,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:38:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 25 [2025-02-06 04:38:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200675707] [2025-02-06 04:38:31,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:38:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:38:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:38:31,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:38:31,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:38:31,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:38:31,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 550 flow. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:31,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:38:31,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:38:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:38:33,637 INFO L124 PetriNetUnfolderBase]: 841/1221 cut-off events. [2025-02-06 04:38:33,637 INFO L125 PetriNetUnfolderBase]: For 2545/2545 co-relation queries the response was YES. [2025-02-06 04:38:33,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1221 events. 841/1221 cut-off events. For 2545/2545 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4345 event pairs, 144 based on Foata normal form. 1/1222 useless extension candidates. Maximal degree in co-relation 4998. Up to 1045 conditions per place. [2025-02-06 04:38:33,644 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 84 selfloop transitions, 45 changer transitions 1/131 dead transitions. [2025-02-06 04:38:33,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 131 transitions, 1087 flow [2025-02-06 04:38:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:38:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:38:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2025-02-06 04:38:33,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3424317617866005 [2025-02-06 04:38:33,645 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 550 flow. Second operand 13 states and 138 transitions. [2025-02-06 04:38:33,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 131 transitions, 1087 flow [2025-02-06 04:38:33,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 131 transitions, 1037 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-02-06 04:38:33,651 INFO L231 Difference]: Finished difference. Result has 82 places, 99 transitions, 819 flow [2025-02-06 04:38:33,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=819, PETRI_PLACES=82, PETRI_TRANSITIONS=99} [2025-02-06 04:38:33,651 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-02-06 04:38:33,651 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 819 flow [2025-02-06 04:38:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:38:33,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:38:33,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:38:33,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:38:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 04:38:33,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:38:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:38:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -752414939, now seen corresponding path program 4 times [2025-02-06 04:38:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:38:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-02-06 04:38:33,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:38:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:38:33,862 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:33,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:33,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:38:33,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:38:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:38:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-02-06 04:38:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512271370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:38:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086261692] [2025-02-06 04:38:35,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:38:35,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:38:35,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:38:35,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:38:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:38:35,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:38:35,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:38:35,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:38:35,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:38:35,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 04:38:35,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:38:36,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:38:36,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-02-06 04:38:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:38:36,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:39:17,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:39:17,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-02-06 04:39:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086261692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:39:17,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:39:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-02-06 04:39:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802546258] [2025-02-06 04:39:17,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:39:17,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 04:39:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:17,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 04:39:17,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=514, Unknown=9, NotChecked=0, Total=600 [2025-02-06 04:39:17,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:39:17,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 819 flow. Second operand has 25 states, 25 states have (on average 6.72) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:17,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:17,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:39:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:24,749 INFO L124 PetriNetUnfolderBase]: 952/1381 cut-off events. [2025-02-06 04:39:24,749 INFO L125 PetriNetUnfolderBase]: For 4351/4351 co-relation queries the response was YES. [2025-02-06 04:39:24,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6239 conditions, 1381 events. 952/1381 cut-off events. For 4351/4351 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4975 event pairs, 214 based on Foata normal form. 1/1382 useless extension candidates. Maximal degree in co-relation 6175. Up to 1200 conditions per place. [2025-02-06 04:39:24,757 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 89 selfloop transitions, 54 changer transitions 1/145 dead transitions. [2025-02-06 04:39:24,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 145 transitions, 1396 flow [2025-02-06 04:39:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:39:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:39:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 142 transitions. [2025-02-06 04:39:24,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3053763440860215 [2025-02-06 04:39:24,758 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 819 flow. Second operand 15 states and 142 transitions. [2025-02-06 04:39:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 145 transitions, 1396 flow [2025-02-06 04:39:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 1308 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-02-06 04:39:24,767 INFO L231 Difference]: Finished difference. Result has 96 places, 118 transitions, 1117 flow [2025-02-06 04:39:24,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1117, PETRI_PLACES=96, PETRI_TRANSITIONS=118} [2025-02-06 04:39:24,768 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2025-02-06 04:39:24,768 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 118 transitions, 1117 flow [2025-02-06 04:39:24,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.72) internal successors, (168), 25 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:24,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:24,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:39:24,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:39:24,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:24,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1210999513, now seen corresponding path program 5 times [2025-02-06 04:39:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96847227] [2025-02-06 04:39:24,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:39:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:24,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:39:25,004 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:25,004 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:39:25,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96847227] [2025-02-06 04:39:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96847227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589323574] [2025-02-06 04:39:25,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:39:25,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:25,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:25,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:39:25,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:39:25,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:39:25,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:25,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:39:25,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:25,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:39:25,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:26,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:39:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 04:39:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:26,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:39:27,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:39:27,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-02-06 04:39:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589323574] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:39:27,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:39:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 20 [2025-02-06 04:39:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196898] [2025-02-06 04:39:27,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:39:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:39:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:39:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:39:27,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:39:27,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 118 transitions, 1117 flow. Second operand has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:27,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:27,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:39:27,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:28,849 INFO L124 PetriNetUnfolderBase]: 1093/1586 cut-off events. [2025-02-06 04:39:28,849 INFO L125 PetriNetUnfolderBase]: For 6781/6781 co-relation queries the response was YES. [2025-02-06 04:39:28,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 1586 events. 1093/1586 cut-off events. For 6781/6781 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6044 event pairs, 83 based on Foata normal form. 1/1587 useless extension candidates. Maximal degree in co-relation 7623. Up to 1166 conditions per place. [2025-02-06 04:39:28,859 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 91 selfloop transitions, 78 changer transitions 1/171 dead transitions. [2025-02-06 04:39:28,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 171 transitions, 1728 flow [2025-02-06 04:39:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:39:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:39:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2025-02-06 04:39:28,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3771712158808933 [2025-02-06 04:39:28,862 INFO L175 Difference]: Start difference. First operand has 96 places, 118 transitions, 1117 flow. Second operand 13 states and 152 transitions. [2025-02-06 04:39:28,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 171 transitions, 1728 flow [2025-02-06 04:39:28,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 171 transitions, 1644 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-02-06 04:39:28,882 INFO L231 Difference]: Finished difference. Result has 104 places, 128 transitions, 1353 flow [2025-02-06 04:39:28,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1353, PETRI_PLACES=104, PETRI_TRANSITIONS=128} [2025-02-06 04:39:28,883 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 73 predicate places. [2025-02-06 04:39:28,883 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 128 transitions, 1353 flow [2025-02-06 04:39:28,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:28,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:28,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:39:28,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 04:39:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:29,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -613333893, now seen corresponding path program 6 times [2025-02-06 04:39:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-02-06 04:39:29,085 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:39:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:29,093 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:39:29,129 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:29,129 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:39:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:39:30,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924510177] [2025-02-06 04:39:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924510177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237134654] [2025-02-06 04:39:30,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:39:30,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:30,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:30,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:39:30,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:39:30,199 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:39:30,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:30,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:39:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:30,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:39:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:31,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:39:31,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 04:39:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:31,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:39:31,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:39:31,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-02-06 04:39:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237134654] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:39:31,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:39:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 25 [2025-02-06 04:39:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416137704] [2025-02-06 04:39:31,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:39:31,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:39:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:31,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:39:31,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:39:31,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:39:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 128 transitions, 1353 flow. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:31,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:39:31,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:34,748 INFO L124 PetriNetUnfolderBase]: 1168/1695 cut-off events. [2025-02-06 04:39:34,748 INFO L125 PetriNetUnfolderBase]: For 8410/8410 co-relation queries the response was YES. [2025-02-06 04:39:34,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8719 conditions, 1695 events. 1168/1695 cut-off events. For 8410/8410 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6523 event pairs, 141 based on Foata normal form. 1/1696 useless extension candidates. Maximal degree in co-relation 8644. Up to 1390 conditions per place. [2025-02-06 04:39:34,761 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 102 selfloop transitions, 72 changer transitions 1/176 dead transitions. [2025-02-06 04:39:34,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 176 transitions, 1985 flow [2025-02-06 04:39:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:39:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:39:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 145 transitions. [2025-02-06 04:39:34,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3598014888337469 [2025-02-06 04:39:34,764 INFO L175 Difference]: Start difference. First operand has 104 places, 128 transitions, 1353 flow. Second operand 13 states and 145 transitions. [2025-02-06 04:39:34,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 176 transitions, 1985 flow [2025-02-06 04:39:34,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 176 transitions, 1789 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-02-06 04:39:34,786 INFO L231 Difference]: Finished difference. Result has 112 places, 140 transitions, 1539 flow [2025-02-06 04:39:34,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1539, PETRI_PLACES=112, PETRI_TRANSITIONS=140} [2025-02-06 04:39:34,787 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2025-02-06 04:39:34,787 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 140 transitions, 1539 flow [2025-02-06 04:39:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:39:34,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:34,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:39:34,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 04:39:34,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:34,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:39:34,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 214625971, now seen corresponding path program 7 times [2025-02-06 04:39:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-02-06 04:39:34,992 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:39:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:34,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:39:35,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:35,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:35,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-02-06 04:39:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024945763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592253610] [2025-02-06 04:39:36,405 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:39:36,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:36,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:39:36,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 04:39:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:39:36,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:39:36,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:36,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:36,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 04:39:36,485 INFO L279 TraceCheckSpWp]: Computing forward predicates...