/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:11:15,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:11:15,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:11:15,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:11:15,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:11:16,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:11:16,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:11:16,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:11:16,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:11:16,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:11:16,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:11:16,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:11:16,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:11:16,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:11:16,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:11:16,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:11:16,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:11:16,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:11:16,009 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:11:16,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:11:16,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:11:16,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:11:16,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:11:16,270 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:11:16,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2025-04-13 20:11:17,550 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b242ee6a7/892c69cfc95f420eb9531b43d35f7c14/FLAGb10e68f9e [2025-04-13 20:11:17,808 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:11:17,809 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2025-04-13 20:11:17,819 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b242ee6a7/892c69cfc95f420eb9531b43d35f7c14/FLAGb10e68f9e [2025-04-13 20:11:18,551 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b242ee6a7/892c69cfc95f420eb9531b43d35f7c14 [2025-04-13 20:11:18,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:11:18,554 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:11:18,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:11:18,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:11:18,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:11:18,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff1dc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18, skipping insertion in model container [2025-04-13 20:11:18,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:11:18,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2025-04-13 20:11:18,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:11:18,753 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:11:18,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2644,2657] [2025-04-13 20:11:18,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:11:18,820 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:11:18,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18 WrapperNode [2025-04-13 20:11:18,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:11:18,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:11:18,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:11:18,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:11:18,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,860 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 172 [2025-04-13 20:11:18,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:11:18,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:11:18,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:11:18,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:11:18,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,891 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-04-13 20:11:18,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:11:18,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:11:18,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:11:18,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:11:18,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (1/1) ... [2025-04-13 20:11:18,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:11:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:11:18,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:11:18,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:11:18,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:11:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:11:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:11:18,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:11:18,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:11:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 20:11:18,951 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:11:19,063 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:11:19,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:11:19,391 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:11:19,392 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:11:19,392 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:11:19,681 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:11:19,684 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:11:19,695 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:11:19,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:11:19 BoogieIcfgContainer [2025-04-13 20:11:19,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:11:19,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:11:19,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:11:19,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:11:19,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:11:18" (1/3) ... [2025-04-13 20:11:19,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c652436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:11:19, skipping insertion in model container [2025-04-13 20:11:19,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:11:18" (2/3) ... [2025-04-13 20:11:19,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c652436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:11:19, skipping insertion in model container [2025-04-13 20:11:19,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:11:19" (3/3) ... [2025-04-13 20:11:19,703 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-04-13 20:11:19,712 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:11:19,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 19 locations, 23 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:11:19,714 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:11:19,757 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:11:19,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 64 flow [2025-04-13 20:11:19,806 INFO L116 PetriNetUnfolderBase]: 7/23 cut-off events. [2025-04-13 20:11:19,808 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:11:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 7/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-13 20:11:19,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 25 transitions, 64 flow [2025-04-13 20:11:19,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 22 transitions, 56 flow [2025-04-13 20:11:19,819 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:11:19,830 INFO L340 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;@383b8377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:11:19,830 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:11:19,844 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:11:19,844 INFO L116 PetriNetUnfolderBase]: 7/21 cut-off events. [2025-04-13 20:11:19,844 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:11:19,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:19,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:19,847 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:19,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1801227009, now seen corresponding path program 1 times [2025-04-13 20:11:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:19,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845267330] [2025-04-13 20:11:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:19,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:11:19,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:11:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:11:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:20,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845267330] [2025-04-13 20:11:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845267330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:20,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:20,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:11:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510134420] [2025-04-13 20:11:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:20,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:11:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:11:20,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:11:20,193 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:11:20,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-04-13 20:11:20,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:20,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:11:20,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:20,308 INFO L116 PetriNetUnfolderBase]: 67/122 cut-off events. [2025-04-13 20:11:20,308 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-13 20:11:20,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 122 events. 67/122 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 36 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 132. Up to 74 conditions per place. [2025-04-13 20:11:20,311 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 20 selfloop transitions, 0 changer transitions 12/32 dead transitions. [2025-04-13 20:11:20,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 32 transitions, 152 flow [2025-04-13 20:11:20,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:11:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:11:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-13 20:11:20,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-13 20:11:20,322 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 56 flow. Second operand 3 states and 40 transitions. [2025-04-13 20:11:20,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 32 transitions, 152 flow [2025-04-13 20:11:20,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:11:20,328 INFO L231 Difference]: Finished difference. Result has 21 places, 20 transitions, 48 flow [2025-04-13 20:11:20,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=21, PETRI_TRANSITIONS=20} [2025-04-13 20:11:20,334 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-04-13 20:11:20,334 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 20 transitions, 48 flow [2025-04-13 20:11:20,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-04-13 20:11:20,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:20,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:20,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:11:20,335 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:20,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -539747353, now seen corresponding path program 1 times [2025-04-13 20:11:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:20,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892926470] [2025-04-13 20:11:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:20,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:11:20,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:11:20,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:20,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:11:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:20,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892926470] [2025-04-13 20:11:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892926470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:20,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:20,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:11:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360078139] [2025-04-13 20:11:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:20,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:11:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:20,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:11:20,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:11:20,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:11:20,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-04-13 20:11:20,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:20,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:11:20,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:20,685 INFO L116 PetriNetUnfolderBase]: 77/140 cut-off events. [2025-04-13 20:11:20,685 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 20:11:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 140 events. 77/140 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 336 event pairs, 44 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 303. Up to 74 conditions per place. [2025-04-13 20:11:20,686 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 19 selfloop transitions, 2 changer transitions 13/34 dead transitions. [2025-04-13 20:11:20,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 150 flow [2025-04-13 20:11:20,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:11:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:11:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-13 20:11:20,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43 [2025-04-13 20:11:20,689 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 48 flow. Second operand 4 states and 43 transitions. [2025-04-13 20:11:20,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 150 flow [2025-04-13 20:11:20,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 144 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:11:20,692 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 58 flow [2025-04-13 20:11:20,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-04-13 20:11:20,692 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2025-04-13 20:11:20,692 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 58 flow [2025-04-13 20:11:20,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-04-13 20:11:20,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:20,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:20,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:11:20,693 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:20,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1946038159, now seen corresponding path program 1 times [2025-04-13 20:11:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:20,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066225823] [2025-04-13 20:11:20,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:20,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:11:20,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:11:20,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:20,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:11:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:20,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066225823] [2025-04-13 20:11:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066225823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:11:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738967863] [2025-04-13 20:11:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:20,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:11:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:20,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:11:20,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:11:20,805 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:11:20,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-04-13 20:11:20,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:11:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:20,907 INFO L116 PetriNetUnfolderBase]: 60/109 cut-off events. [2025-04-13 20:11:20,907 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:11:20,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 109 events. 60/109 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 242 event pairs, 22 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 228. Up to 75 conditions per place. [2025-04-13 20:11:20,908 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 25 selfloop transitions, 2 changer transitions 7/34 dead transitions. [2025-04-13 20:11:20,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 155 flow [2025-04-13 20:11:20,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:11:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:11:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-13 20:11:20,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-04-13 20:11:20,909 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 58 flow. Second operand 4 states and 42 transitions. [2025-04-13 20:11:20,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 155 flow [2025-04-13 20:11:20,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 149 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:11:20,910 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 66 flow [2025-04-13 20:11:20,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-04-13 20:11:20,911 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2025-04-13 20:11:20,911 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 66 flow [2025-04-13 20:11:20,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-04-13 20:11:20,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:20,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:20,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:11:20,911 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:20,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 752498599, now seen corresponding path program 1 times [2025-04-13 20:11:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:20,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883713178] [2025-04-13 20:11:20,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:20,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:11:20,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:11:20,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:20,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 20:11:20,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66712651] [2025-04-13 20:11:20,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:20,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:11:20,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:11:20,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:11:20,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:11:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:11:21,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:11:21,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:21,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:21,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:11:21,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:11:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:11:21,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:11:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:21,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883713178] [2025-04-13 20:11:21,216 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 20:11:21,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66712651] [2025-04-13 20:11:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66712651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:11:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473512561] [2025-04-13 20:11:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:21,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:11:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:21,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:11:21,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:11:21,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:11:21,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-04-13 20:11:21,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:21,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:11:21,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:21,339 INFO L116 PetriNetUnfolderBase]: 82/148 cut-off events. [2025-04-13 20:11:21,339 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-13 20:11:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 148 events. 82/148 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 396 event pairs, 30 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 366. Up to 87 conditions per place. [2025-04-13 20:11:21,340 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 26 selfloop transitions, 4 changer transitions 10/40 dead transitions. [2025-04-13 20:11:21,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 206 flow [2025-04-13 20:11:21,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:11:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:11:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-13 20:11:21,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2025-04-13 20:11:21,346 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 66 flow. Second operand 6 states and 49 transitions. [2025-04-13 20:11:21,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 206 flow [2025-04-13 20:11:21,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 192 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 20:11:21,347 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 78 flow [2025-04-13 20:11:21,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2025-04-13 20:11:21,347 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2025-04-13 20:11:21,347 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 78 flow [2025-04-13 20:11:21,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-04-13 20:11:21,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:21,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:21,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:11:21,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:11:21,549 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:21,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1469088579, now seen corresponding path program 1 times [2025-04-13 20:11:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:21,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065366076] [2025-04-13 20:11:21,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:21,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:11:21,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:11:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:11:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:21,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065366076] [2025-04-13 20:11:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065366076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:21,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:11:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435934598] [2025-04-13 20:11:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:21,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:11:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:21,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:11:21,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:11:21,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:11:21,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04-13 20:11:21,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:21,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:11:21,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:21,858 INFO L116 PetriNetUnfolderBase]: 85/162 cut-off events. [2025-04-13 20:11:21,858 INFO L117 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-04-13 20:11:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 162 events. 85/162 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 405 event pairs, 45 based on Foata normal form. 11/146 useless extension candidates. Maximal degree in co-relation 443. Up to 116 conditions per place. [2025-04-13 20:11:21,860 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 21 selfloop transitions, 4 changer transitions 22/47 dead transitions. [2025-04-13 20:11:21,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 250 flow [2025-04-13 20:11:21,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:11:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:11:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-13 20:11:21,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-04-13 20:11:21,862 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 78 flow. Second operand 6 states and 55 transitions. [2025-04-13 20:11:21,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 250 flow [2025-04-13 20:11:21,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 235 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 20:11:21,863 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 98 flow [2025-04-13 20:11:21,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2025-04-13 20:11:21,864 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 12 predicate places. [2025-04-13 20:11:21,864 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 98 flow [2025-04-13 20:11:21,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-04-13 20:11:21,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:21,864 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-04-13 20:11:21,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:11:21,864 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:11:21,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash 199809073, now seen corresponding path program 1 times [2025-04-13 20:11:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:21,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930519594] [2025-04-13 20:11:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:11:21,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:11:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 20:11:21,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215046083] [2025-04-13 20:11:21,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:21,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:11:21,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:11:21,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:11:21,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:11:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:11:22,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:11:22,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:22,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:22,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:11:22,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:11:22,131 INFO L354 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-04-13 20:11:22,176 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 20:11:22,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 20:11:22,221 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 20:11:22,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2025-04-13 20:11:22,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-13 20:11:22,515 INFO L354 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 8 treesize of output 1 [2025-04-13 20:11:22,540 INFO L354 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 8 treesize of output 1 [2025-04-13 20:11:22,769 INFO L354 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 23 treesize of output 1 [2025-04-13 20:11:23,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2025-04-13 20:11:23,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:11:23,322 INFO L325 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-04-13 20:11:23,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2025-04-13 20:11:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:11:23,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:11:23,709 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:11:23,709 INFO L354 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 192 treesize of output 184 [2025-04-13 20:12:05,516 INFO L354 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 9 treesize of output 1 [2025-04-13 20:12:05,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-13 20:12:05,569 INFO L354 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 9 treesize of output 1 [2025-04-13 20:12:05,642 INFO L325 Elim1Store]: treesize reduction 4, result has 95.2 percent of original size [2025-04-13 20:12:05,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1872 treesize of output 1614 [2025-04-13 20:12:05,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 726 treesize of output 674 [2025-04-13 20:12:05,706 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:12:05,706 INFO L354 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 890 treesize of output 778 [2025-04-13 20:12:06,328 INFO L325 Elim1Store]: treesize reduction 4, result has 95.2 percent of original size [2025-04-13 20:12:06,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1460 treesize of output 1202 [2025-04-13 20:12:06,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 541 treesize of output 505 [2025-04-13 20:12:06,369 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:12:06,370 INFO L354 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 687 treesize of output 587 [2025-04-13 20:12:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:12:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:06,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930519594] [2025-04-13 20:12:06,732 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 20:12:06,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215046083] [2025-04-13 20:12:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215046083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:12:06,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:12:06,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2025-04-13 20:12:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112990991] [2025-04-13 20:12:06,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 20:12:06,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:12:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:12:06,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=240, Unknown=10, NotChecked=0, Total=306 [2025-04-13 20:12:06,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:12:06,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 98 flow. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 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-04-13 20:12:06,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:06,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:12:06,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:12,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-04-13 20:12:16,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-04-13 20:12:20,507 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-04-13 20:12:24,540 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2025-04-13 20:12:25,088 INFO L116 PetriNetUnfolderBase]: 186/331 cut-off events. [2025-04-13 20:12:25,088 INFO L117 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-04-13 20:12:25,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 331 events. 186/331 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1135 event pairs, 49 based on Foata normal form. 2/257 useless extension candidates. Maximal degree in co-relation 914. Up to 109 conditions per place. [2025-04-13 20:12:25,090 INFO L140 encePairwiseOnDemand]: 13/25 looper letters, 63 selfloop transitions, 19 changer transitions 4/86 dead transitions. [2025-04-13 20:12:25,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 86 transitions, 470 flow [2025-04-13 20:12:25,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:12:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:12:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2025-04-13 20:12:25,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2025-04-13 20:12:25,093 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 98 flow. Second operand 14 states and 110 transitions. [2025-04-13 20:12:25,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 86 transitions, 470 flow [2025-04-13 20:12:25,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 86 transitions, 454 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:25,095 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 232 flow [2025-04-13 20:12:25,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=232, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-13 20:12:25,095 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 26 predicate places. [2025-04-13 20:12:25,095 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 232 flow [2025-04-13 20:12:25,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 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-04-13 20:12:25,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:25,095 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-04-13 20:12:25,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:12:25,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:12:25,296 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:12:25,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash -830991265, now seen corresponding path program 2 times [2025-04-13 20:12:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:25,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057337224] [2025-04-13 20:12:25,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:25,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:25,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:25,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:25,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 20:12:25,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378673387] [2025-04-13 20:12:25,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:25,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:25,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:25,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:25,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:12:25,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:12:25,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:12:25,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:12:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 20:12:25,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:25,584 INFO L354 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-04-13 20:12:25,653 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 20:12:25,653 INFO L354 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 29 treesize of output 34 [2025-04-13 20:12:25,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-13 20:12:25,837 INFO L354 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 8 treesize of output 1 [2025-04-13 20:12:25,847 INFO L354 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 8 treesize of output 1 [2025-04-13 20:12:25,870 INFO L354 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 8 treesize of output 1 [2025-04-13 20:12:25,876 INFO L354 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 8 treesize of output 1 [2025-04-13 20:12:25,892 INFO L354 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 8 treesize of output 1 [2025-04-13 20:12:26,187 INFO L354 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 19 treesize of output 1 [2025-04-13 20:12:26,196 INFO L354 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 19 treesize of output 1 [2025-04-13 20:12:26,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:12:26,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-04-13 20:12:26,987 INFO L325 Elim1Store]: treesize reduction 48, result has 55.1 percent of original size [2025-04-13 20:12:26,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 77 [2025-04-13 20:12:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:12:27,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:13:18,287 INFO L354 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 9 treesize of output 1 [2025-04-13 20:13:18,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 276 [2025-04-13 20:13:18,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:18,441 INFO L354 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 774 treesize of output 730 [2025-04-13 20:13:18,450 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 588 treesize of output 562 [2025-04-13 20:13:18,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:18,497 INFO L354 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 1298 treesize of output 1236 [2025-04-13 20:13:18,848 INFO L325 Elim1Store]: treesize reduction 135, result has 55.6 percent of original size [2025-04-13 20:13:18,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 1210 treesize of output 972 [2025-04-13 20:13:19,104 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:19,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9555 treesize of output 9163 [2025-04-13 20:13:19,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 20:13:20,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 20:13:20,675 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:20,675 INFO L354 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 21 treesize of output 17 [2025-04-13 20:13:20,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 20:13:20,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 20:13:23,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:23,175 INFO L354 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 51 treesize of output 53 [2025-04-13 20:13:23,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-04-13 20:13:23,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-04-13 20:13:23,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-04-13 20:13:23,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-04-13 20:13:24,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:24,334 INFO L354 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 57 treesize of output 75 [2025-04-13 20:13:24,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:24,836 INFO L354 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 33 treesize of output 37 [2025-04-13 20:13:25,216 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:13:25,216 INFO L354 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 33 treesize of output 37 [2025-04-13 20:15:03,575 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:03,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3046 treesize of output 2856 [2025-04-13 20:15:03,677 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:03,678 INFO L354 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 2768 treesize of output 2664 [2025-04-13 20:15:09,236 INFO L325 Elim1Store]: treesize reduction 8, result has 94.6 percent of original size [2025-04-13 20:15:09,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5429 treesize of output 4801 [2025-04-13 20:15:29,074 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,545 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,599 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,633 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,744 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,760 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:15:29,793 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:29,793 INFO L354 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 118 treesize of output 108 [2025-04-13 20:15:29,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 20:15:30,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 20:15:30,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:30,322 INFO L354 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 114 treesize of output 104 [2025-04-13 20:15:30,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 20:15:30,793 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:30,794 INFO L354 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 118 treesize of output 108 [2025-04-13 20:15:30,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 20:15:31,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 20:15:37,313 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:37,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1306 treesize of output 1216 [2025-04-13 20:16:12,331 INFO L325 Elim1Store]: treesize reduction 22, result has 50.0 percent of original size [2025-04-13 20:16:12,331 INFO L354 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 33 treesize of output 29 [2025-04-13 20:16:12,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2025-04-13 20:16:12,367 INFO L325 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2025-04-13 20:16:12,367 INFO L354 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 20 treesize of output 13 [2025-04-13 20:16:12,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-04-13 20:16:12,400 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:16:12,400 INFO L354 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 26 treesize of output 16 [2025-04-13 20:16:12,408 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2025-04-13 20:16:12,459 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:16:12,459 INFO L354 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 12 treesize of output 4 [2025-04-13 20:16:12,503 INFO L325 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2025-04-13 20:16:12,503 INFO L354 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 35 treesize of output 23 [2025-04-13 20:16:12,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-04-13 20:16:12,528 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:16:12,528 INFO L354 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 12 treesize of output 4 [2025-04-13 20:16:12,615 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,618 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,634 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-13 20:16:12,634 INFO L354 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 68 treesize of output 1 [2025-04-13 20:16:12,712 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,744 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,758 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,764 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,855 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,859 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,867 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,871 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,878 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,881 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:12,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 947 treesize of output 839 [2025-04-13 20:16:12,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:16:12,914 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 20:16:12,920 INFO L325 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-04-13 20:16:12,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 839 treesize of output 1 [2025-04-13 20:16:12,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:16:12,967 INFO L325 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2025-04-13 20:16:12,967 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 1 [2025-04-13 20:16:12,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:16:13,016 INFO L325 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-04-13 20:16:13,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 48 [2025-04-13 20:16:13,050 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 20:16:13,077 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:16:13,078 INFO L354 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 342 treesize of output 1 [2025-04-13 20:16:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:16:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:13,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057337224] [2025-04-13 20:16:13,188 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 20:16:13,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378673387] [2025-04-13 20:16:13,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378673387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:13,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:16:13,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2025-04-13 20:16:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881157036] [2025-04-13 20:16:13,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:13,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:16:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:16:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=234, Unknown=12, NotChecked=0, Total=306 [2025-04-13 20:16:13,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 20:16:13,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 232 flow. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 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-04-13 20:16:13,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:13,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 20:16:13,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:16,567 INFO L116 PetriNetUnfolderBase]: 303/540 cut-off events. [2025-04-13 20:16:16,568 INFO L117 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2025-04-13 20:16:16,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 540 events. 303/540 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2162 event pairs, 81 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 1940. Up to 179 conditions per place. [2025-04-13 20:16:16,572 INFO L140 encePairwiseOnDemand]: 14/25 looper letters, 72 selfloop transitions, 31 changer transitions 13/116 dead transitions. [2025-04-13 20:16:16,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 843 flow [2025-04-13 20:16:16,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:16:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:16:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 130 transitions. [2025-04-13 20:16:16,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-13 20:16:16,573 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 232 flow. Second operand 17 states and 130 transitions. [2025-04-13 20:16:16,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 843 flow [2025-04-13 20:16:16,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 829 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:16,579 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 483 flow [2025-04-13 20:16:16,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=483, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2025-04-13 20:16:16,580 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 52 predicate places. [2025-04-13 20:16:16,580 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 483 flow [2025-04-13 20:16:16,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 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-04-13 20:16:16,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:16,580 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-04-13 20:16:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:16:16,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:16,781 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:16,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash 418211321, now seen corresponding path program 3 times [2025-04-13 20:16:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:16,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184497762] [2025-04-13 20:16:16,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:16,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:16:16,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:16,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:16:16,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 20:16:16,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000104258] [2025-04-13 20:16:16,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:16,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:16,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:16:16,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:16:16,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:16,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:16:16,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:16,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 20:16:16,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:16,988 INFO L354 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-04-13 20:16:17,068 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 20:16:17,069 INFO L354 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 29 treesize of output 34 [2025-04-13 20:16:17,237 INFO L354 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 8 treesize of output 1 [2025-04-13 20:16:17,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-13 20:16:17,255 INFO L354 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 8 treesize of output 1 [2025-04-13 20:16:17,274 INFO L354 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 8 treesize of output 1 [2025-04-13 20:16:17,280 INFO L354 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 8 treesize of output 1 [2025-04-13 20:16:17,294 INFO L354 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 8 treesize of output 1 [2025-04-13 20:16:17,572 INFO L354 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 19 treesize of output 1 [2025-04-13 20:16:17,580 INFO L354 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 19 treesize of output 1 [2025-04-13 20:16:18,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:16:18,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-04-13 20:16:18,199 INFO L325 Elim1Store]: treesize reduction 48, result has 55.1 percent of original size [2025-04-13 20:16:18,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 77 [2025-04-13 20:16:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:16:18,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:17:16,426 INFO L354 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 9 treesize of output 1 [2025-04-13 20:17:16,446 INFO L354 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 9 treesize of output 1 [2025-04-13 20:17:16,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-13 20:17:16,525 INFO L354 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 9 treesize of output 1 [2025-04-13 20:17:16,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 276 [2025-04-13 20:17:16,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:17:16,582 INFO L354 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 774 treesize of output 730 [2025-04-13 20:17:16,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 588 treesize of output 562 [2025-04-13 20:17:16,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:17:16,622 INFO L354 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 1298 treesize of output 1236 [2025-04-13 20:17:16,899 INFO L325 Elim1Store]: treesize reduction 135, result has 55.6 percent of original size [2025-04-13 20:17:16,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 1458 treesize of output 1136 [2025-04-13 20:17:17,261 INFO L325 Elim1Store]: treesize reduction 120, result has 45.9 percent of original size [2025-04-13 20:17:17,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 964 treesize of output 955 [2025-04-13 20:17:17,369 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:17:17,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 458 [2025-04-13 20:17:17,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-04-13 20:17:24,746 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:17:24,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 20:17:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:17:24,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184497762] [2025-04-13 20:17:24,747 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 20:17:24,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000104258] [2025-04-13 20:17:24,747 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:17:24,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:17:24,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:17:24,951 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:583) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2025-04-13 20:17:24,956 INFO L158 Benchmark]: Toolchain (without parser) took 366402.09ms. Allocated memory was 167.8MB in the beginning and 826.3MB in the end (delta: 658.5MB). Free memory was 118.6MB in the beginning and 402.9MB in the end (delta: -284.3MB). Peak memory consumption was 502.5MB. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 103.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.68ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 100.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: RCFGBuilder took 790.24ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 102.8MB in the end (delta: -4.6MB). Peak memory consumption was 79.5MB. Max. memory is 8.0GB. [2025-04-13 20:17:24,956 INFO L158 Benchmark]: TraceAbstraction took 365257.79ms. Allocated memory was 167.8MB in the beginning and 826.3MB in the end (delta: 658.5MB). Free memory was 102.0MB in the beginning and 402.9MB in the end (delta: -300.9MB). Peak memory consumption was 486.0MB. Max. memory is 8.0GB. [2025-04-13 20:17:24,957 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 103.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.68ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 100.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 790.24ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 102.8MB in the end (delta: -4.6MB). Peak memory consumption was 79.5MB. Max. memory is 8.0GB. * TraceAbstraction took 365257.79ms. Allocated memory was 167.8MB in the beginning and 826.3MB in the end (delta: 658.5MB). Free memory was 102.0MB in the beginning and 402.9MB in the end (delta: -300.9MB). Peak memory consumption was 486.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...