./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.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-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:39:40,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:39:40,646 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:39:40,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:39:40,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:39:40,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:39:40,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:39:40,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:39:40,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:39:40,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:39:40,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:39:40,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:39:40,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:39:40,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:39:40,681 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:39:40,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:39:40,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:39:40,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:39:40,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:39:40,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:39:40,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:39:40,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:39:40,685 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-02-06 04:39:40,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:39:40,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:39:40,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:39:40,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:39:40,915 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:39:40,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-06 04:39:42,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/622c35473/e68e73cae7594a90b961e03b45744953/FLAGfb77f6955 [2025-02-06 04:39:42,400 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:39:42,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-06 04:39:42,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/622c35473/e68e73cae7594a90b961e03b45744953/FLAGfb77f6955 [2025-02-06 04:39:42,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/622c35473/e68e73cae7594a90b961e03b45744953 [2025-02-06 04:39:42,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:39:42,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:39:42,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:39:42,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:39:42,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:39:42,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f6dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42, skipping insertion in model container [2025-02-06 04:39:42,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:39:42,549 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-more-array-sum.wvr.c[2423,2436] [2025-02-06 04:39:42,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:39:42,565 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:39:42,578 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-more-array-sum.wvr.c[2423,2436] [2025-02-06 04:39:42,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:39:42,589 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:39:42,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42 WrapperNode [2025-02-06 04:39:42,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:39:42,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:39:42,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:39:42,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:39:42,594 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:39:42" (1/1) ... [2025-02-06 04:39:42,599 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:39:42" (1/1) ... [2025-02-06 04:39:42,618 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-02-06 04:39:42,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:39:42,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:39:42,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:39:42,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:39:42,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,645 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 04:39:42,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:39:42,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:39:42,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:39:42,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:39:42,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (1/1) ... [2025-02-06 04:39:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:39:42,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:42,689 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:39:42,698 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:39:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:39:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:39:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:39:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:39:42,715 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:39:42,783 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:39:42,785 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:39:43,085 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:39:43,085 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:39:43,436 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:39:43,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:39:43,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:39:43 BoogieIcfgContainer [2025-02-06 04:39:43,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:39:43,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:39:43,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:39:43,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:39:43,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:39:42" (1/3) ... [2025-02-06 04:39:43,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e315f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:39:43, skipping insertion in model container [2025-02-06 04:39:43,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:39:42" (2/3) ... [2025-02-06 04:39:43,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e315f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:39:43, skipping insertion in model container [2025-02-06 04:39:43,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:39:43" (3/3) ... [2025-02-06 04:39:43,446 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-02-06 04:39:43,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:39:43,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 04:39:43,460 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:39:43,514 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:39:43,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-02-06 04:39:43,574 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-02-06 04:39:43,576 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:39:43,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 5/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-06 04:39:43,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-02-06 04:39:43,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 76 flow [2025-02-06 04:39:43,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:39:43,592 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;@4601a4e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:39:43,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:39:43,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:39:43,600 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-02-06 04:39:43,600 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:39:43,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:43,600 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] [2025-02-06 04:39:43,601 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:39:43,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1915494120, now seen corresponding path program 1 times [2025-02-06 04:39:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899205161] [2025-02-06 04:39:43,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:43,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:39:43,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:39:43,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:43,859 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:39:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899205161] [2025-02-06 04:39:43,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899205161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:43,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:43,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:39:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638591276] [2025-02-06 04:39:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:39:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:39:43,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:39:43,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:39:43,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:43,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:43,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:39:43,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:44,176 INFO L124 PetriNetUnfolderBase]: 818/1181 cut-off events. [2025-02-06 04:39:44,177 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-02-06 04:39:44,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 1181 events. 818/1181 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4425 event pairs, 226 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 2122. Up to 803 conditions per place. [2025-02-06 04:39:44,190 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-06 04:39:44,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 223 flow [2025-02-06 04:39:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:39:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:39:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-06 04:39:44,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-06 04:39:44,202 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-02-06 04:39:44,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 223 flow [2025-02-06 04:39:44,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:39:44,211 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 90 flow [2025-02-06 04:39:44,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-02-06 04:39:44,215 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-02-06 04:39:44,216 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 90 flow [2025-02-06 04:39:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:44,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:44,218 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:39:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:39:44,218 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:39:44,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:44,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1071297909, now seen corresponding path program 1 times [2025-02-06 04:39:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:44,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842931045] [2025-02-06 04:39:44,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:44,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:39:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:39:44,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:44,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:39:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842931045] [2025-02-06 04:39:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842931045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:44,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:39:44,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627685979] [2025-02-06 04:39:44,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:44,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:39:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:39:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:39:44,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:39:44,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:44,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:44,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:39:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:44,614 INFO L124 PetriNetUnfolderBase]: 819/1186 cut-off events. [2025-02-06 04:39:44,614 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-02-06 04:39:44,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1186 events. 819/1186 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4186 event pairs, 577 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 780. Up to 1181 conditions per place. [2025-02-06 04:39:44,620 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 29 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2025-02-06 04:39:44,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 172 flow [2025-02-06 04:39:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:39:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:39:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-02-06 04:39:44,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2025-02-06 04:39:44,621 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 90 flow. Second operand 5 states and 56 transitions. [2025-02-06 04:39:44,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 172 flow [2025-02-06 04:39:44,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:39:44,622 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 114 flow [2025-02-06 04:39:44,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-02-06 04:39:44,623 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-06 04:39:44,623 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 114 flow [2025-02-06 04:39:44,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:44,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:44,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:39:44,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:39:44,623 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:39:44,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1022037181, now seen corresponding path program 1 times [2025-02-06 04:39:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:44,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524693417] [2025-02-06 04:39:44,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:44,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:39:44,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:39:44,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:39:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524693417] [2025-02-06 04:39:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524693417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:39:44,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:39:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:39:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179108947] [2025-02-06 04:39:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:44,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:39:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:44,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:39:44,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:39:44,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:39:44,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:44,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:44,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:39:44,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:44,889 INFO L124 PetriNetUnfolderBase]: 830/1199 cut-off events. [2025-02-06 04:39:44,890 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-02-06 04:39:44,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 1199 events. 830/1199 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4165 event pairs, 270 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2671. Up to 618 conditions per place. [2025-02-06 04:39:44,896 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 43 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-02-06 04:39:44,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 246 flow [2025-02-06 04:39:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:39:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:39:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-06 04:39:44,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 04:39:44,897 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 114 flow. Second operand 4 states and 57 transitions. [2025-02-06 04:39:44,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 246 flow [2025-02-06 04:39:44,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 234 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 04:39:44,899 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 123 flow [2025-02-06 04:39:44,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-02-06 04:39:44,900 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-06 04:39:44,900 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 123 flow [2025-02-06 04:39:44,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:44,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:44,900 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:39:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:39:44,900 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:39:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 266988034, now seen corresponding path program 1 times [2025-02-06 04:39:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441096098] [2025-02-06 04:39:44,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:39:44,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:39:44,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:44,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:45,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441096098] [2025-02-06 04:39:45,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441096098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:45,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949922226] [2025-02-06 04:39:45,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:45,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:45,015 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:39:45,019 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:39:45,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:39:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:39:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:45,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:39:45,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:45,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:39:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:39:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949922226] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:45,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:39:45,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-06 04:39:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322192648] [2025-02-06 04:39:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:39:45,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:39:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:39:45,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:39:45,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:39:45,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:39:45,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 123 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:39:45,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:39:45,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:39:45,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:39:45,450 INFO L124 PetriNetUnfolderBase]: 881/1265 cut-off events. [2025-02-06 04:39:45,451 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-02-06 04:39:45,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1265 events. 881/1265 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4550 event pairs, 411 based on Foata normal form. 98/1284 useless extension candidates. Maximal degree in co-relation 3260. Up to 931 conditions per place. [2025-02-06 04:39:45,457 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-02-06 04:39:45,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 295 flow [2025-02-06 04:39:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:39:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:39:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-02-06 04:39:45,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 04:39:45,459 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 123 flow. Second operand 5 states and 66 transitions. [2025-02-06 04:39:45,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 295 flow [2025-02-06 04:39:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:39:45,462 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 140 flow [2025-02-06 04:39:45,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=140, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-02-06 04:39:45,462 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-02-06 04:39:45,462 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 140 flow [2025-02-06 04:39:45,462 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:39:45,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:39:45,462 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:39:45,472 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:39:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:45,663 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:39:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:39:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1715171265, now seen corresponding path program 1 times [2025-02-06 04:39:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:39:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802773130] [2025-02-06 04:39:45,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:39:45,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:39:45,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:39:45,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:45,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:39:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802773130] [2025-02-06 04:39:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802773130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:39:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743223987] [2025-02-06 04:39:46,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:39:46,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:39:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:39:46,801 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:39:46,802 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:39:46,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:39:46,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:39:46,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:39:46,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:39:46,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 04:39:46,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:39:46,912 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:39:46,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 04:39:46,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:39:46,988 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:39:47,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:39:47,213 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 27 treesize of output 11 [2025-02-06 04:39:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:39:47,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:40:04,013 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-02-06 04:40:04,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1610 treesize of output 1180 [2025-02-06 04:40:04,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:04,073 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 640 treesize of output 598 [2025-02-06 04:40:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743223987] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:40:10,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:40:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-06 04:40:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442652932] [2025-02-06 04:40:10,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:40:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 04:40:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:10,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 04:40:10,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=641, Unknown=4, NotChecked=0, Total=756 [2025-02-06 04:40:10,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:40:10,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 140 flow. Second operand has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 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:40:10,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:10,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:40:10,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:14,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:18,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:31,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:35,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:37,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:41,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:45,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:53,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:57,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:01,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:05,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:09,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:14,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:14,468 INFO L124 PetriNetUnfolderBase]: 1812/2607 cut-off events. [2025-02-06 04:41:14,469 INFO L125 PetriNetUnfolderBase]: For 1739/1739 co-relation queries the response was YES. [2025-02-06 04:41:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7391 conditions, 2607 events. 1812/2607 cut-off events. For 1739/1739 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10570 event pairs, 142 based on Foata normal form. 2/2434 useless extension candidates. Maximal degree in co-relation 5941. Up to 1399 conditions per place. [2025-02-06 04:41:14,481 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 124 selfloop transitions, 46 changer transitions 2/173 dead transitions. [2025-02-06 04:41:14,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 173 transitions, 943 flow [2025-02-06 04:41:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:41:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:41:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 244 transitions. [2025-02-06 04:41:14,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38915470494417864 [2025-02-06 04:41:14,483 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 140 flow. Second operand 19 states and 244 transitions. [2025-02-06 04:41:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 173 transitions, 943 flow [2025-02-06 04:41:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 173 transitions, 927 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:14,491 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 473 flow [2025-02-06 04:41:14,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=473, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2025-02-06 04:41:14,496 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-02-06 04:41:14,496 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 473 flow [2025-02-06 04:41:14,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 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:41:14,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:14,496 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:41:14,505 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:41:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:14,697 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:41:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2134543719, now seen corresponding path program 2 times [2025-02-06 04:41:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180650575] [2025-02-06 04:41:14,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:14,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:14,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:14,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:14,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:15,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180650575] [2025-02-06 04:41:15,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180650575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:15,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726575206] [2025-02-06 04:41:15,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:15,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:15,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:15,269 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:41:15,271 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:41:15,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:15,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:15,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:41:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:15,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 04:41:15,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 04:41:15,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:15,672 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 27 treesize of output 19 [2025-02-06 04:41:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:41:15,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:15,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:15,970 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 248 treesize of output 232 [2025-02-06 04:41:16,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:41:16,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2025-02-06 04:41:16,391 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:41:16,392 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 283 treesize of output 238 [2025-02-06 04:41:16,402 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:41:16,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 92 [2025-02-06 04:41:16,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:16,465 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 369 treesize of output 313 [2025-02-06 04:41:16,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:16,485 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 236 treesize of output 192 [2025-02-06 04:41:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:41:16,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726575206] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:16,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 21 [2025-02-06 04:41:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441554289] [2025-02-06 04:41:16,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 04:41:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:16,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 04:41:16,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-02-06 04:41:16,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:41:16,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 473 flow. Second operand has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:16,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:16,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:41:16,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:18,282 INFO L124 PetriNetUnfolderBase]: 2562/3703 cut-off events. [2025-02-06 04:41:18,282 INFO L125 PetriNetUnfolderBase]: For 4497/4497 co-relation queries the response was YES. [2025-02-06 04:41:18,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12265 conditions, 3703 events. 2562/3703 cut-off events. For 4497/4497 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16262 event pairs, 490 based on Foata normal form. 1/3490 useless extension candidates. Maximal degree in co-relation 11353. Up to 2508 conditions per place. [2025-02-06 04:41:18,301 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 144 selfloop transitions, 106 changer transitions 1/252 dead transitions. [2025-02-06 04:41:18,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 252 transitions, 1814 flow [2025-02-06 04:41:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 04:41:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 04:41:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 275 transitions. [2025-02-06 04:41:18,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2025-02-06 04:41:18,306 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 473 flow. Second operand 24 states and 275 transitions. [2025-02-06 04:41:18,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 252 transitions, 1814 flow [2025-02-06 04:41:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 252 transitions, 1742 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:18,314 INFO L231 Difference]: Finished difference. Result has 102 places, 161 transitions, 1343 flow [2025-02-06 04:41:18,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1343, PETRI_PLACES=102, PETRI_TRANSITIONS=161} [2025-02-06 04:41:18,315 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 68 predicate places. [2025-02-06 04:41:18,315 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 161 transitions, 1343 flow [2025-02-06 04:41:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:18,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:18,316 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:41:18,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:18,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:18,520 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:41:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 764666973, now seen corresponding path program 3 times [2025-02-06 04:41:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977463770] [2025-02-06 04:41:18,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:18,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:18,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:18,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:41:18,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977463770] [2025-02-06 04:41:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977463770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77767154] [2025-02-06 04:41:19,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:19,637 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:41:19,639 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:41:19,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:41:19,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:41:19,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:41:19,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:19,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 04:41:19,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:19,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-02-06 04:41:20,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:20,099 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 27 treesize of output 19 [2025-02-06 04:41:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:20,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:20,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:20,517 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 256 treesize of output 240 [2025-02-06 04:41:20,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:20,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 144 [2025-02-06 04:41:21,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:41:21,131 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 211 [2025-02-06 04:41:21,137 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 04:41:21,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:21,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 112 treesize of output 104 [2025-02-06 04:41:21,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 96 treesize of output 72 [2025-02-06 04:41:21,277 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:41:21,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 300 treesize of output 255 [2025-02-06 04:41:21,284 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:41:21,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 188 [2025-02-06 04:41:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:41:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77767154] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:21,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2025-02-06 04:41:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347508090] [2025-02-06 04:41:21,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 04:41:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:21,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 04:41:21,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-02-06 04:41:21,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-06 04:41:21,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 161 transitions, 1343 flow. Second operand has 30 states, 30 states have (on average 5.933333333333334) internal successors, (178), 30 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:41:21,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:21,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-06 04:41:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand